Statistical ZAPs from group-based assumptions

DOI10.1007/978-3-030-90459-3_16MaRDI QIDQ2695645zbMATH OpenOpenAlexFDO

Authors Geoffroy Couteau, Shuichi Katsumata, Elahe Sadeghi, Bogdan Ursu

Publication date 31 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90459-3_16

zbMATH Keywords

non-interactive zero-knowledge proofsstatistical NIZK arguments

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Statistical ZAPR arguments from bilinear maps
• Statistical ZAP arguments
• Non-interactive Zaps and New Techniques for NIZK
• Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
• Non-interactive zero knowledge from sub-exponential DDH

Cites work

• Advances in Cryptology - CRYPTO 2003
• An algebraic framework for Diffie-Hellman assumptions
• Definitions and properties of zero-knowledge proof systems
• Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
• Designated-verifier pseudorandom generators, and their applications
• Distinguisher-dependent simulation in two rounds and its applications
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Fiat-Shamir and correlation intractability from strong KDM-secure encryption
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
• Non-interactive Zaps and New Techniques for NIZK
• Non-interactive zero knowledge from sub-exponential DDH
• Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
• On non-black-box simulation and the impossibility of approximate obfuscation
• Perfect Non-interactive Zero Knowledge for NP
• Quasi-adaptive NIZK for linear subspaces revisited
• Reusable designated-verifier NIZKs for all NP from CDH
• Secure Hybrid Encryption from Weakened Key Encapsulation
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• Statistical witness indistinguishability (and more) in two messages
• Statistical ZAP arguments
• Statistical ZAPR arguments from bilinear maps
• Statistical Zaps and new oblivious transfer protocols
• The Knowledge Complexity of Interactive Proof Systems
• Two-message witness indistinguishability and secure computation in the plain model from new assumptions
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Zaps and Their Applications

Cited in

(4)

• Statistical ZAPR arguments from bilinear maps
• scientific article; zbMATH DE number 1014888 (Why is no real title available?)
• A note on non-interactive zero-knowledge from CDH
• A hidden-bits approach to statistical ZAPs from LWE

This page was built for publication: Statistical ZAPs from group-based assumptions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695645)