Towards non-black-box lower bounds in cryptography

DOI10.1007/978-3-642-19571-6_35MaRDI QIDQ3000565zbMATH OpenOpenAlexFDO

Authors Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam

Publication date 19 May 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-19571-6_35

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Bounds on the Efficiency of Generic Cryptographic Constructions
• Theory of Cryptography
• The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
• Theory of Cryptography
• Bounds on the efficiency of black-box commitment schemes

Cited in

(12)

• Bounds on the Efficiency of Generic Cryptographic Constructions
• On constructing one-way permutations from indistinguishability obfuscation
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
• Theory of Cryptography
• On constructing one-way permutations from indistinguishability obfuscation
• Adaptive One-Way Functions and Applications
• Limits of provable security from standard assumptions
• Towards non-black-box separations of public key encryption and one way function
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
• Lower bounds on the degree of block ciphers

This page was built for publication: Towards non-black-box lower bounds in cryptography

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