More Constructions of Lossy and Correlation-Secure Trapdoor Functions
- 579 Downloads
Lossy trapdoor functions based on the quadratic residuosity assumption. Our construction relies on modular squaring, and whereas previous such constructions were based on seemingly stronger assumptions, we present the first construction that is based solely on the quadratic residuosity assumption. We also present a generalization to higher-order power residues.
Lossy trapdoor functions based on the composite residuosity assumption. Our construction guarantees essentially any required amount of lossiness, where at the same time the functions are more efficient than the matrix-based approach of Peikert and Waters.
Lossy trapdoor functions based on the d-Linear assumption. Our construction both simplifies the DDH-based construction of Peikert and Waters and admits a generalization to the whole family of d-Linear assumptions without any loss of efficiency.
Correlation-secure trapdoor functions related to the hardness of syndrome decoding.
Key wordsPublic-key encryption Lossy trapdoor functions Correlation-secure trapdoor functions
Unable to display preview. Download preview PDF.
- D.J. Bernstein, List decoding for binary goppa codes, in International Workshop on Coding and Cryptology—IWCC 2011. LNCS, vol. 6639 (Springer, Berlin, 2011), pp. 62–80 Google Scholar
- M. Blum, P. Feldman, S. Micali, Non-interactive zero-knowledge and its applications, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (1988), pp. 103–112 Google Scholar
- D. Boneh, J. Horwitz, Weak trapdoors from the rth-power-residue symbol. Unpublished manuscript (2002) Google Scholar
- C. Cachin, S. Micali, M. Stadler, Computationally private information retrieval with polylogarithmic communication, in Advances in Cryptology—EUROCRYPT 1999. LNCS, vol. 1592 (Springer, Berlin, 1999), pp. 402–414 Google Scholar
- I. Damgård, M. Jurik, A generalisation, a simplification and some applications of Paillier’s probabilistic public-key system, in Public Key Cryptography—PKC 2001. LNCS, vol. 1992 (Springer, Berlin, 2001), pp. 119–136. Full version (with additional co-author J.B. Nielsen) available at http://www.daimi.au.dk/~ivan/GenPaillier_finaljour.ps CrossRefGoogle Scholar
- J.-B. Fischer, J. Stern, An efficient pseudo-random generator provably as secure as syndrome decoding, in Advances in Cryptology—EUROCRYPT 1996. LNCS, vol. 1070 (Springer, Berlin, 1996), pp. 245–255 Google Scholar
- S. Goldwasser, V. Vaikuntanathan, New constructions of correlation-secure trapdoor functions and CCA-secure encryption schemes. Manuscript (2008) Google Scholar
- B. Hemenway, R. Ostrovsky, Lossy trapdoor functions from smooth homomorphic hash proof systems. Electronic Colloquium on Computational Complexity, Report TR09-127 (2009) Google Scholar
- J. Horwitz, Applications of Cayley graphs, bilinearity, and higher-order residues to cryptology. Ph.D. thesis, Stanford University (2004). Available at http://math.scu.edu/~jhorwitz/pubs/horwitz-phd.pdf
- F.J. MacWilliams, N.J.A. Sloane, The Theory of Error-Correcting Codes (North-Holland, Amsterdam, 1983) Google Scholar
- R.J. McEliece, A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep., Jet Prop. Lab., pp. 114–116, Jan 1978 Google Scholar
- P. Paillier, Public-key cryptosystems based on composite degree residuosity classes, in Advances in Cryptology—EUROCRYPT 1999. LNCS, vol. 1592 (Springer, Berlin, 1999), pp. 223–238 Google Scholar
- M. Rabin, Digitalized signatures and public-key functions as intractable as factorization. Technical Report MIT/LCS/TR-212, MIT Laboratory for Computer Science (1979) Google Scholar
- A. Rosen, G. Segev, Chosen-ciphertext security via correlated products, in Theory of Cryptography Conference—TCC 2009. LNCS, vol. 5444 (Springer, Berlin, 2009), pp. 419–436 Google Scholar
- H. Shacham, A Cramer-Shoup encryption scheme from the Linear assumption and from progressively weaker Linear variants. Cryptology ePrint Archive, Report 2007/074 (2007). Available at http://eprint.iacr.org/2007/074
- D. Squirrel, Computing reciprocity symbols in number fields. Undergraduate thesis, Reed College (1997) Google Scholar