Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
From MaRDI portal
Publication:2055663
DOI10.1007/978-3-030-45727-3_15zbMath1479.94148OpenAlexW3022089689MaRDI QIDQ2055663
Bogdan Ursu, Shuichi Katsumata, Geoffroy Couteau
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_15
Related Items
Does Fiat-Shamir require a cryptographic hash function? ⋮ Non-interactive batch arguments for NP from standard assumptions ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ NIZK from SNARGs ⋮ PPAD is as hard as LWE and iterated squaring ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ A note on non-interactive zero-knowledge from CDH ⋮ Statistical ZAPs from group-based assumptions ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Non-interactive zero knowledge from sub-exponential DDH
Cites Work
- Unnamed Item
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- From obfuscation to the security of Fiat-Shamir for proofs
- On the concrete security of Goldreich's pseudorandom generator
- Impossibility of strong KDM security with auxiliary input
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- 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
- Tightly-Secure Signatures from Lossy Identification Schemes
- The random oracle methodology, revisited
- Candidate One-Way Functions Based on Expander Graphs
- Diffie-Hellman Oracles
- 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
- A monte carlo method for factorization
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Why “Fiat-Shamir for Proofs” Lacks a Proof
- Fiat-Shamir: from practice to theory
- How to use indistinguishability obfuscation
- An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
- Algebraic attacks against random local functions and their countermeasures
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Zaps and Their Applications
- Efficient Non-interactive Proof Systems for Bilinear Groups
- One-Shot Verifiable Encryption from Lattices
- Public Key Cryptography – PKC 2004
