A note on non-interactive zero-knowledge from CDH
From MaRDI portal
Publication:6190128
DOI10.1007/978-3-031-38551-3_23OpenAlexW4385654212MaRDI QIDQ6190128
Geoffroy Couteau, Willy Quach, Zhengzhong Jin, Abhishek Jain
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38551-3_23
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Certifying trapdoor permutations, revisited
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- On distributional collision resistant hashing
- Trapdoor functions from the computational Diffie-Hellman assumption
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- Non-interactive zero knowledge from sub-exponential DDH
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Two-round oblivious transfer from CDH or LPN
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Quantum lightning never strikes the same state twice
- Designated-verifier pseudorandom generators, and their applications
- Reusable designated-verifier NIZKs for all NP from CDH
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- Trapdoor hash functions and their applications
- New constructions of reusable designated-verifier NIZKs
- Enhancements of trapdoor permutations
- Statistical ZAPs from group-based assumptions
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
- Algorithms for Black-Box Fields and their Application to Cryptography
- Lossy trapdoor functions and their applications
- Perfect Non-interactive Zero Knowledge for NP
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The knowledge complexity of interactive proof-systems
- Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
- Fiat-Shamir: from practice to theory
- How to use indistinguishability obfuscation
- Zaps and Their Applications
- The Twin Diffie-Hellman Problem and Applications
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way
- Non-interactive Zaps and New Techniques for NIZK
- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
- Theory of Cryptography
- Theory of Cryptography
- Collision-resistance from multi-collision-resistance
- Sublinear secure computation from new assumptions
This page was built for publication: A note on non-interactive zero-knowledge from CDH
