Rate-1 statistical non-interactive zero-knowledge

DOI10.1007/978-3-032-01907-3_17MaRDI QIDQ6862524zbMATH OpenFDO

Authors Pedro Branco, Nico Döttling, Akshayaram Srinivasan

Publication date 6 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01907-3_17

zbMATH Keywords

fully homomorphic encryptionsecure function evaluationminimizing communicationhybrid encryptionnon-interactive zero-knowledge proofs

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 2009960 (Why is no real title available?)
• A framework for statistically sender private OT with optimal rate
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• Batch-OT with optimal rate
• Boosting batch arguments and RAM delegation
• Compact NIZKs from standard assumptions on bilinear maps
• Correlation intractability and SNARGs from sub-exponential DDH
• Definitions and properties of zero-knowledge proof systems
• Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Fiat-Shamir: from practice to theory
• Fully homomorphic encryption using ideal lattices
• Impossibilities in succinct arguments: black-box extraction and more
• Incrementally verifiable computation via rate-1 batch arguments
• Minimum disclosure proofs of knowledge
• NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
• New techniques for noninteractive zero-knowledge
• Non-interactive batch arguments for NP from standard assumptions
• Non-interactive zero knowledge from sub-exponential DDH
• Non-interactive zero-knowledge from LPN and MQ
• Noninteractive Zero-Knowledge
• Noninteractive zero knowledge for NP from (Plain) Learning With Errors
• On interactive proofs with a laconic prover
• On the complexity of interactive proofs with bounded communication
• Probabilistically checkable arguments for all NP
• Rate-1 non-interactive arguments for batch-NP and applications
• SNARGs for P from sub-exponential DDH and QR
• SNARGs for \(\mathcal{P}\) from LWE
• The knowledge complexity of interactive proof-systems
• Trapdoor hash functions and their applications
• Unprovable security of perfect NIZK and non-interactive non-malleable commitments
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs

Cited in

(1)

• Pairing-based batch arguments for NP with a linear-size CRS

This page was built for publication: Rate-1 statistical non-interactive zero-knowledge

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