Abstract
The relation between list decoding and hard-core predicates has provided a clean and easy methodology to prove the hardness of certain predicates. So far this methodology has only been used to prove that the O(loglogN) least and most significant bits of any function with multiplicative access —which include the most common number theoretic trapdoor permutations— are secure. In this paper we show that the method applies to all bits of any function defined on a cyclic group of order N with multiplicative access for cryptographically interesting N. As a result, in this paper we reprove the security of all bits of RSA, the discrete logarithm in a group of prime order or the Paillier encryption scheme.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-642-00468-1_29
Chapter PDF
Similar content being viewed by others
References
Akavia, A., Goldwasser, S., Safra, S.: Proving Hard-Core Predicates Using List Decoding. In: Proc. of the 44th Symposium on Foundations of Computer Science (2003)
Alexi, W., Chor, B., Goldreich, O., Schnorr, C.P.: RSA and Rabin functions: certain parts are as hard as the whole. SIAM J.Comp. 17(2) (1988)
Catalano, D., Gennaro, R., Howgrave-Graham, N.: Paillier’s Trapdoor Function Hides up to O(n) Bits. J.Cryptology 15(4) (2002)
Kushilevitz, E., Mansour, Y.: Learning Decision Trees Using the Fourier Spectrum. In: Proc. of the 23rd Annual ACM Symposium on Theory of Computing (1991)
Gilbert, A.C., Muthukrishnan, S., Strauss, M.: Improved time bounds for near-optimal sparse Fourier representation via sampling. In: Proc. of SPIE Wavelets XI (2005)
Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: Proc. of the 21st Annual ACM Symposium on Theory of Computing (1989)
Goldreich, O., Rubinfeld, R., Sudan, M.: Learning Polynomials with Queries: The Highly Noisy Case. SIAM J. Discrete Math. 13(4) (2000)
Håstad, J., Näslund, M.: The security of all RSA and discrete log bits. J. ACM 51(2) (2004)
Näslund, M.: All Bits ax+b mod p are Hard. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 114–128. Springer, Heidelberg (1996)
Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morillo, P., Ràfols, C. (2009). The Security of All Bits Using List Decoding. In: Jarecki, S., Tsudik, G. (eds) Public Key Cryptography – PKC 2009. PKC 2009. Lecture Notes in Computer Science, vol 5443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00468-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-00468-1_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00467-4
Online ISBN: 978-3-642-00468-1
eBook Packages: Computer ScienceComputer Science (R0)