Public-key cryptography from different assumptions

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 171-180

  Applebaum, Benny ^a   Barak, Boaz ^b   Wigderson, Avi ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b PRINCETON UNIVERSITY   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

3lin; densest subgraph problem; expander graphs; learning juntas; learning parity with noise; nc0; public key cryptography

Indexed keywords

BIPARTITE GRAPHS; CYCLE COUNTING; EXPANDER GRAPHS; LEARNING PARITY WITH NOISE; NEW PARAMETERS; NOISE RATE; NP-HARD; OPTIMIZATION PROBLEMS; PRIVATE-KEY; PSEUDORANDOM GENERATORS; PSEUDORANDOMNESS; PUBLIC KEY SCHEMES; PUBLIC-KEY ENCRYPTION; PUBLIC-KEY ENCRYPTION SCHEME; RANDOM SET; SEMIDEFINITE PROGRAMS; SQUARE ROOTS; SUBGRAPH PROBLEMS;

AGRICULTURE; ALGORITHMS; COMPUTATION THEORY; GRAPH THEORY; LINEAR EQUATIONS; NETWORK SECURITY;

PUBLIC KEY CRYPTOGRAPHY;

EID: 77954751550     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806715     Document Type: Conference Paper

References (57)

1. D. Achlioptas and A. Coja-Oghlan. Algorithmic barriers from phase transitions. In FOCS, pages 793-802, 2008.
2. D. Aharonov and O. Regev. Lattice problems in NP intersect coNP. J. ACM, 52:749-765, 2005.
3. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In STOC, pages 284-293, 1997.
4. M. Alekhnovich. More on average case vs approximation complexity. In FOCS, pages 298-307, 2003.
5. B. Applebaum, Y. Ishai, and E. Kushilevitz. Cryptography in NC0. SIAM J. Comput, 36(4):845-888, 2006.
6. S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci., 54(2):317-331, 1997.
7. S. Arora, B. Barak, M. Brunnermeier, and R. Ge. Computational complexity and information asymmetry in financial products. In ICS, 2010.
8. 2) attack on key exchange from a random oracle. In Proceedings of CRYPTO '09, 2009.
9. 1/4)-approximation for densest k-subgraph. In STOC, 2010.
10. E. Biham, Y. J. Goren, and Y. Ishai. Basing weak public-key cryptography on strong one-way functions. In TCC, volume 4948, pages 55-72, 2008.
11. A. Blum, M. Furst, M. Kearns, and R. J. Lipton. Cryptographic primitives based on hard learning problems. In CRYPTO, pages 278-291, 1994.
12. A. L. Blum. Relevant examples and relevant features: Thoughts from computational learning theory. AAAI Fall Symposium on Relevance, 1994.
13. A. L. Blum and P. Langley. Selection of relevant features and examples in machine learning. Artificial Intelligence, 97(1-2):245-271, 1997.
14. A. Bogdanov and Y. Qiao. On the security of goldreich's one-way function. In APPROX-RANDOM, pages 392-405, 2009.
15. 0 circuits. In CCC, pages 3-8, 2009.
16. Chor, Goldreich, Hastad, Freidmann, Rudich, and Smolensky. The bit extraction problem or t-resilient functions. In FOCS, 1985.
17. J. Cook, O. Etesami, R. Miller, and L. Trevisan. Goldreich's one-way function candidate and myopic backtracking algorithms. In TCC, 2009.
18. 0. In Proc. 26th MFCS, 2001.
19. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22(5):644-654, 1976.
20. I. Dinur, G. Kindler, R. Raz, and S. Safra. Approximating cvp to within almost-polynomial factors is np-hard. Combinatorica, 23(2):205-243, 2003.
21. U. Feige, J. H. Kim, and E. Ofek. Witnesses for non-satisfiability of dense random 3CNF formulas. In FOCS, pages 497-508, 2006.
22. U. Feige, D. Peleg, and G. Kortsarz. The dense k-subgraph problem. Algorithmica, 29(3):410-421, 2001.
23. Goemans and Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM, 42, 1995.
24. O. Goldreich. Candidate one-way functions based on expander graphs. Technical Report TR00-090, Electronic Colloquium on Computational Complexity (ECCC), 2000.
25. O. Goldreich and S. Goldwasser. On the limits of nonapproximability of lattice problems. J. Comput. Syst. Sci., 60(3):540-563, 2000.
26. O. Goldreich, H. Krawczyk, and M. Luby. On the existence of pseudorandom generators. SIAM J. Comput, 22:1163, 1993.
27. S. Goldwasser and S. Micali. Probabilistic encryption. J. Comput. Syst. Sci., 28(2):270-299, 1984.
28. T. Holenstein and R. Renner. One-way secret-key agreement and applications to circuit polarization and immunization of public-key encryption. In CRYPTO, pages 478-493, 2005.
29. R. Impagliazzo. A personal view of average-case complexity. In Structure in Complexity Theory Conference, pages 134-147, 1995.
30. R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In STOC, pages 44-61, 1989.
31. Y. Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai. Cryptography with constant computational overhead. In STOC, pages 433-442, 2008.
32. A. Juels and M. Peinado. Hiding cliques for cryptographic security. Designs, Codes and Cryptography, 20(3):269-280, 2000.
33. M. Kearns and L. Valiant. Cryptographic limitations on learning Boolean formulae and finite automata. J. ACM, 41(1):67-95, 1994.
34. S. Khot. Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique. In FOCS, pages 136-145, 2004.
35. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48:203-209, 1987.
36. J. B. Lasserre. An explicit exact SDP relaxation for nonlinear 0-1 programs. In IPCO: 8th Integer Programming and Combinatorial Optimization Conference, 2001.
37. M. Laurent. A comparison of the Sherali-Adams, Lovasz-Schrijver, and Lasserre relaxations for 0-1 programming. MOR: Mathematics of Operations Research, 28:470-496, 2003.
38. H. Lipmaa. Cryptology pointers: Public key cryptography: Concrete systems, 1997. Web site, url: http://www.adastral.ucl.ac.uk/~helger/crypto/ link/public/concrete.php.
39. L. Lovász and A. Schrijver. Cones of matrices and set-functions and 0-1 optimization. SIAM Journal on Optimization, 1(2):166-190, 1991.
40. R. J. McEliece. A public-key cryptosystem based on algebraic coding theory. DSN Progress Report, pages 42-44, 1978.
41. R. Merkle. Secure communications over insecure channels. Commun. ACM, 21(4):294-299, 1978.
42. V. S. Miller. Use of elliptic curves in cryptography. In CRYPTO, volume 218, pages 417-426, 1985.
43. E. Mossel, A. Shpilka, and L. Trevisan. On epsilon-biased generators in NC0. Random Struct. Algorithms, 29(1):56-81, 2006.
44. M. Naor. Bit commitment using pseudorandomness. J. Cryptology, 4(2):151-158, 1991.
45. S. K. Panjwani. An experimental evaluation of goldreich's one-way function. Technical report, IIT, Bombay, 2001.
46. J. Patarin. Hidden fields equations (HFE) and isomorphisms of polynomials (IP): Two new families of asymmetric algorithms. In EUROCRYPT, pages 33-48, 1996.
47. C. Peikert. Public-key cryptosystems from the worst-case shortest vector problem. In STOC, pages 333-342, 2009.
48. C. Peikert, V. Vaikuntanathan, and B. Waters. A framework for efficient and composable oblivious transfer. In CRYPTO, pages 554-571, 2008.
49. M. O. Rabin. Digitalized signatures and public-key functions as intractable as factorization. Technical Report MIT/LCS/TR-212, 1979.
50. O. Regev. New lattice-based cryptographic constructions. J. ACM, 51(6):899-942, 2004.
51. O. Regev. On lattices, learning with errors, random linear codes, and cryptography. In STOC, pages 84-93, 2005.
52. R. L. Rivest, A. Shamir, and L. Adelman. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM, 21(2):120-126, 1978.
53. G. Schoenebeck. Linear level Lasserre lower bounds for certain k-csps. In FOCS, pages 593-602, 2008.
54. H. D. Sherali and W. P. Adams. A hierarchy of relaxation between the continuous and convex hull representations for zero-one programming problems. SIAM J. Disc. Math., 3:411-430, 1990.
55. E. Viola. The sum of d small-bias generators fools polynomials of degree d. In CCC, pages 124-127, 2008.
56. A. C. C. Yao. Theory and applications of trapdoor functions. In FOCS, pages 80-91, 1982.
57. H. Zhu. Survey of computational assumptions used in cryptography broken or not by Shor's algorithm. Master's thesis, School of Computer Science McGill University, 2001.