Enhancements of trapdoor permutations
From MaRDI portal
Publication:2392094
DOI10.1007/S00145-012-9131-8zbMATH Open1372.94427OpenAlexW1970127883MaRDI QIDQ2392094FDOQ2392094
Authors: Oded Goldreich, Ron D. Rothblum 
Publication date: 1 August 2013
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-012-9131-8
Recommendations
- Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations
- Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: the state of the art
- Certifying trapdoor permutations, revisited
- Oblivious transfer from trapdoor permutations in minimal rounds
- Theory of Cryptography
Permutations, words, matrices (05A05) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)
Cites Work
- Probabilistic encryption
- A method for obtaining digital signatures and public-key cryptosystems
- New directions in cryptography
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Foundations of Cryptography
- Foundations of Cryptography
- Computational Complexity
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- The Knowledge Complexity of Interactive Proof Systems
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- RSA and Rabin Functions: Certain Parts are as Hard as the Whole
- Noninteractive Zero-Knowledge
- Title not available (Why is that?)
- Theory of Cryptography
- A uniform-complexity treatment of encryption and zero-knowledge
- Basing non-interactive zero-knowledge on (enhanced) trapdoor permutations: the state of the art
Cited In (21)
- Use of trapdoor structures in cryptography
- Weak zero-knowledge via the Goldreich-Levin theorem
- Zero-knowledge proofs of proximity
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- Triply adaptive UC NIZK
- Verifiable random functions from non-interactive witness-indistinguishable proofs
- On the gold standard for security of universal steganography
- Non-interactive zero-knowledge from non-interactive batch arguments
- A note on non-interactive zero-knowledge from CDH
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Certifying trapdoor permutations, revisited
- Multi-theorem preprocessing NIZKs from lattices
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- Non-interactive zero knowledge from sub-exponential DDH
- Oblivious transfer from trapdoor permutations in minimal rounds
- Non-interactive zero-knowledge from LPN and MQ
- NIZK from SNARGs
This page was built for publication: Enhancements of trapdoor permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392094)
