Public-key cryptographic primitives provably as secure as subset sum

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5978 LNCS, Issue , 2010, Pages 382-400

  Lyubashevsky, Vadim ^a   Palacio, Adriana ^b   Segev, Gil ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b BOWDOIN COLLEGE   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHIC PRIMITIVES; ENCRYPTION SCHEMES; OBLIVIOUS TRANSFER PROTOCOLS; POLYNOMIAL-TIME; PUBLIC KEYS; PUBLIC-KEY ENCRYPTION SCHEME; RANDOM INSTANCE; SUBSET SUM; SUBSET SUM PROBLEMS;

NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY; SET THEORY;

NETWORK SECURITY;

EID: 77949610972     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11799-2_23     Document Type: Conference Paper

References (35)

1. [ACPS09] Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 595-618. Springer, Heidelberg (2009)
2. [AD97] Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/averagecase equivalence. In: STOC (1997); An improved version is described in ECCC 2007
3. [AGV09] Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptography against memory attacks. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 474-495. Springer, Heidelberg (2009)
4. [Ale03] Alekhnovich, M.: More on average case vs approximation complexity. In: FOCS (2003)
5. [Cré87] Crépeau, C.: Equivalence between two flavours of oblivious transfers. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 350-354. Springer, Heidelberg (1988)
6. [DORS08] Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Computing 38(1) (2008)
7. [EGL82] Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. In: CRYPTO (1982)
8. [EGL85] Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM 28(6) (1985)
9. [FP05] Flaxman, A., Przydatek, B.: Solving medium-density subset sum problems in expected polynomial time. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 305-314. Springer, Heidelberg (2005)
10. [Fri86] Frieze, A.: On the Lagarias-Odlyzko algorithm for the subset sum problem. SIAM Journal on Computing 15 (1986)
11. [GKM+00] Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. In: FOCS (2000)
12. [GMW87] Goldreich,O.,Micali, S.,Wigderson,A.:Howto play a mental game - a completeness theorem for protocols with honest majority. In: STOC (1987)
13. [Gol04] Goldreich, O.: Foundations of Cryptography - Volume 2 (Basic Applications). Cambridge University Press, Cambridge (2004)
14. [GPV08] Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices, and new cryptographic constructions. In: STOC (2008)
15. [Hai08] Haitner, I.: Semi-honest to malicious oblivious transfer - The black-box way. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 412-426. Springer, Heidelberg (2008)
16. [Hoe63] Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301) (1963)
17. [HSH+08] Halderman, J.A., Schoen, S.D., Heninger, N., Clarkson, W., Paul, W., Calandrino, J.A., Feldman, A.J., Appelbaum, J., Felten, E.W.: Lest we remember: Cold boot attacks on encryption keys. In: USENIX Security (2008)
18. [IN96] Impagliazzo, R., Naor, M.: Efficient cryptographic schemes provably as secure as subset sum. Journal of Cryptology 9(4) (1996)
19. [Kil88] Kilian, J.: Founding cryptography on oblivious transfer. In: STOC (1988)
20. [LM09] Lyubashevsky, V., Micciancio, D.: On bounded distance decoding, unique shortest vectors, and the minimum distance problem. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 577-594. Springer, Heidelberg (2009)
21. [LO85] Lagarias, J.C., Odlyzko, A.M.: Solving low density subset sum problems. Journal of the ACM 32 (1985)
22. [LPS09] Lyubashevsky, V., Palacio, A., Segev, G.: Public-key cryptographic primitives provably as secure as subset sum. ePrint (2009)
23. [Lyu05] Lyubashevsky, V.: The parity problem in the presence of noise, decoding random linear codes, and the subset sum problem. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM2005. LNCS, vol. 3624, pp. 378-389. Springer, Heidelberg (2005)
24. [MH78] Merkle, R.C., Hellman, M.E.: Hiding information and signatures in trapdoor knapsacks. IEEE Trans. on Inf. Theory IT-24 (1978)
25. [NS09] Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 18-35. Springer, Heidelberg (2009)
26. [Odl90] Odlyzko, A.: The rise and fall of knapsack cryptosystems. In: Symposia of Applied Mathematics (1990)
27. [Pei09] Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem. In: STOC (2009)
28. [PVW08] Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554-571. Springer, Heidelberg (2008)
29. [PW08] Peikert, C.,Waters, B.: Lossy Trapdoor Functions and Their Applications. In: STOC (2008)
30. [Rab81] Rabin, M.O.: How to exchange secret keys by oblivious transfer. In: Technical Report TR-81. Harvard Aiken Computation Laboratory (1981)
31. [Reg03] Regev, O.: New lattice based cryptographic constructions. In: STOC (2003)
32. [Reg05] Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC (2005)
33. [Sha08] Shallue, A.: An improved multi-set algorithm for the dense subset sum problem. In: van der Poorten, A.J., Stein, A. (eds.) ANTS-VIII 2008. LNCS, vol. 5011, pp. 416-429. Springer, Heidelberg (2008)
34. [Sho97] Shor, P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5) (1997)
35. [Yao86] Yao, A.C.: How to generate and exchange secrets. In: FOCS (1986)