Correlation intractability and SNARGs from sub-exponential DDH
From MaRDI portal
Publication:6190125
DOI10.1007/978-3-031-38551-3_20OpenAlexW4385654459MaRDI QIDQ6190125
Abhishek Jain, Jiaheng Zhang, Zhengzhong Jin, Sanjam Garg, Arka Rai Choudhuri
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_20
Cites Work
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Identity-based encryption from the Diffie-Hellman assumption
- From obfuscation to the security of Fiat-Shamir for proofs
- The hunting of the SNARK
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Non-interactive zero knowledge from sub-exponential DDH
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Transparent error correcting in a computationally bounded world
- Does Fiat-Shamir require a cryptographic hash function?
- Non-interactive batch arguments for NP from standard assumptions
- SNARGs for P from sub-exponential DDH and QR
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Trapdoor hash functions and their applications
- Somewhere statistical soundness, post-quantum security, and SNARGs
- On the Correlation Intractability of Obfuscated Pseudorandom Functions
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
- The Magic of ELFs
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- The random oracle methodology, revisited
- Perfect Non-interactive Zero Knowledge for NP
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Fiat-Shamir: from practice to theory
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- How to delegate computations publicly
- How to delegate computations
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Delegation for bounded space
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Parallelizable delegation from LWE
