The Security of all bits using list decoding

Mostra el registre complet Registre parcial de l'ítem

• dc.contributor.author Morillo, Paz
• dc.contributor.author Ràfols, Carla
• dc.date.accessioned 2019-09-12T17:09:54Z
• dc.date.available 2019-09-12T17:09:54Z
• dc.date.issued 2009
• dc.description Comunicació presentada a: PKC 2009 12th International Conference on Practice and Theory in Public Key Cryptography, celebrada del 18 al 20 de març de 2009 a Irvine, Califòrnia, Estats Units d'Amèrica.ca
• dc.description.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(log logN) 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.en
• dc.format.mimetype application/pdf
• dc.identifier.citation Morillo P, Ràfols C. The Security of all bits using list decoding. In: Jarecki S, Tsudik G, editors. Public Key Cryptography – PKC 2009 12th International Conference on Practice and Theory in Public Key Cryptography Proceedings; 2009 March 18-20; Irvine, CA, USA. Berlin: Springer; 20009. p. 15-33. (LNCS; no. 5443). DOI: 10.1007/978-3-642-00468-1_29
• dc.identifier.doi http://dx.doi.org/10.1007/978-3-642-00468-1_29
• dc.identifier.uri http://hdl.handle.net/10230/42272
• dc.language.iso eng
• dc.publisher Springer
• dc.relation.ispartof Jarecki S, Tsudik G, editors. Public Key Cryptography – PKC 2009 12th International Conference on Practice and Theory in Public Key Cryptography Proceedings; 2009 March 18-20; Irvine, CA, USA. Berlin: Springer; 20009. p. 15-33. (LNCS; no. 5443).
• dc.rights © Springer The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-00468-1_29
• dc.rights.accessRights info:eu-repo/semantics/openAccess
• dc.subject.keyword Bit securityen
• dc.subject.keyword List decodingen
• dc.subject.keyword One-way functionen
• dc.title The Security of all bits using list decoding
• dc.type info:eu-repo/semantics/conferenceObject
• dc.type.version info:eu-repo/semantics/acceptedVersion