Lossy functions do not amplify well

DOI10.1007/978-3-642-28914-9_26MaRDI QIDQ2891500zbMATH OpenOpenAlexFDO

Authors Krzysztof Pietrzak, Alon Rosen, Gil Segev

Publication date 15 June 2012

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28914-9_26

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Theory of Cryptography
• Security Amplification for Interactive Cryptographic Primitives
• Input locality and hardness amplification
• Query complexity in errorless hardness amplification
• Input locality and hardness amplification

Cited in

(7)

• The magic of ELFs
• The Magic of ELFs
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• Searching for ELFs in the cryptographic forest
• Compact selective opening security from LWE
• Lossy cryptography from code-based assumptions
• Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK

This page was built for publication: Lossy functions do not amplify well

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