Certifying trapdoor permutations, revisited
From MaRDI portal
Publication:1629429
DOI10.1007/978-3-030-03807-6_18zbMath1443.94049OpenAlexW2728974496MaRDI QIDQ1629429
Publication date: 11 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_18
Related Items (13)
Enhancements are blackbox non-trivial: impossibility of enhanced trapdoor permutations from standard trapdoor permutations ⋮ Certifying trapdoor permutations, revisited ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ NIZK from SNARGs ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ New constructions of statistical NIZKs: dual-mode DV-NIZKs and more ⋮ Non-interactive zero knowledge from sub-exponential DDH
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- Certifying trapdoor permutations, revisited
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Enhancements of trapdoor permutations
- Perfect Structure on the Edge of Chaos
- Constrained Pseudorandom Functions and Their Applications
- On Black-Box Separations among Injective One-Way Functions
- Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the Art
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
- Perfect Non-interactive Zero Knowledge for NP
- Weak Verifiable Random Functions
- An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
- New directions in cryptography
- Noninteractive Zero-Knowledge
- A method for obtaining digital signatures and public-key cryptosystems
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Foundations of Cryptography
- How to use indistinguishability obfuscation
- New Techniques for Noninteractive Zero-Knowledge
- Functional Signatures and Pseudorandom Functions
- Zaps and Their Applications
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Computational Complexity
This page was built for publication: Certifying trapdoor permutations, revisited
