Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations
From MaRDI portal
Publication:1629427
DOI10.1007/978-3-030-03807-6_17zbMath1443.94060OpenAlexW2894487403MaRDI QIDQ1629427
Publication date: 11 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_17
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Certifying trapdoor permutations, revisited
- Enhancements of trapdoor permutations
- Perfect Structure on the Edge of Chaos
- Notions of Black-Box Reductions, Revisited
- Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations
- Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs
- A method for obtaining digital signatures and public-key cryptosystems
- Foundations of Cryptography
- Certifying RSA
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- Advances in Cryptology – CRYPTO 2004
- Theory of Cryptography
- Theory of Cryptography
This page was built for publication: Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations
