Non-interactive zero knowledge from sub-exponential DDH
From MaRDI portal
Publication:2056667
DOI10.1007/978-3-030-77870-5_1zbMath1479.94194OpenAlexW3164947441MaRDI QIDQ2056667
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77870-5_1
Related Items (15)
Non-interactive batch arguments for NP from standard assumptions ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? ⋮ PPAD is as hard as LWE and iterated squaring ⋮ Universal ring signatures in the standard model ⋮ A framework for statistically sender private OT with optimal rate ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ On the impossibility of algebraic NIZK in pairing-free groups ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) ⋮ Statistical ZAPs from group-based assumptions ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Certifying trapdoor permutations, revisited
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Statistical witness indistinguishability (and more) in two messages
- Identity-based encryption from the Diffie-Hellman assumption
- From obfuscation to the security of Fiat-Shamir for proofs
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Statistical ZAPR arguments from bilinear maps
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Trapdoor hash functions and their applications
- Enhancements of trapdoor permutations
- On the Correlation Intractability of Obfuscated Pseudorandom Functions
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Functional Encryption: Definitions and Challenges
- The random oracle methodology, revisited
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
- Perfect Non-interactive Zero Knowledge for NP
- A Framework for Efficient and Composable Oblivious Transfer
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- A public key cryptosystem and a signature scheme based on discrete logarithms
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- On Threshold Circuits and Polynomial Computation
- The knowledge complexity of interactive proof-systems
- Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
- Parity helps to compute majority
- Fiat-Shamir: from practice to theory
- How to use indistinguishability obfuscation
- Fuzzy Identity-Based Encryption
- Advances in Cryptology - CRYPTO 2003
- Zaps and Their Applications
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Non-interactive Zaps and New Techniques for NIZK
- Theory of Cryptography
This page was built for publication: Non-interactive zero knowledge from sub-exponential DDH
