The Security of All Bits Using List Decoding

DOI10.1007/978-3-642-00468-1_2MaRDI QIDQ3617510zbMATH OpenOpenAlexFDO

Authors Carla Ràfols, Paz Morillo

Publication date 24 March 2009

Published in Public Key Cryptography – PKC 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00468-1_2

zbMATH Keywords

bit securitylist decodingone-way function

Mathematics Subject Classification ID

Cryptography (94A60) Decoding (94B35)

Recommendations

• Proving the security of all bits of ax+b p using list decoding
• The security of all RSA and discrete log bits
• scientific article; zbMATH DE number 1839461
• A new hard-core predicate of Paillier's trapdoor function
• Paillier's trapdoor function hides \(\Theta(n)\) bits

Cited in

(8)

• On sets of large Fourier transform under changes in domain
• The security of all private-key bits in isogeny-based schemes
• Bit Security of the CDH Problems over Finite Fields
• Proving the security of all bits of ax+b p using list decoding
• The multivariate hidden number problem
• Applications of list decoding to tracing traitors
• scientific article; zbMATH DE number 1839461 (Why is no real title available?)
• The security of all RSA and discrete log bits

This page was built for publication: The Security of All Bits Using List Decoding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617510)