Short non-interactive zero-knowledge proofs

DOI10.1007/978-3-642-17373-8_20MaRDI QIDQ3058665zbMATH OpenOpenAlexFDO

Authors Jens Groth

Publication date 7 December 2010

Published in Advances in Cryptology - ASIACRYPT 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17373-8_20

zbMATH Keywords

probabilistically checkable proofsnon-interactive zero-knowledge proofsadaptive soundnessNaccache-Stern encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Noninteractive Zero-Knowledge
• Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
• Short non-interactive cryptographic proofs
• An efficient noninteractive zero-knowledge proof system for NP with general assumptions
• Removing Interaction from Zero-Knowledge Proofs

Cited in

(24)

• From one-time to two-round reusable multi-signatures without nested forking
• Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
• A simple and efficient framework of proof systems for NP
• Non-Interactive Zero-Knowledge Proofs of Non-Membership
• Interactive PCP
• Efficient non-interactive zero-knowledge proofs in cross-domains without trusted setup
• Short pairing-based non-interactive zero-knowledge arguments
• Short discreet proofs
• Compact NIZKs from standard assumptions on bilinear maps
• scientific article; zbMATH DE number 7746256 (Why is no real title available?)
• Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
• scientific article; zbMATH DE number 1405650 (Why is no real title available?)
• Short non-interactive cryptographic proofs
• Unconditionally secure NIZK in the fine-grained setting
• A simple post-quantum non-interactive zero-knowledge proof from garbled circuits
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
• Compact designated verifier NIZKs from the CDH assumption without pairings
• Compact NIZKs from standard assumptions on bilinear maps
• New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
• Multi-theorem preprocessing NIZKs from lattices
• Fully homomorphic encryption with chosen-ciphertext security from LWE
• Non-interactive zero-knowledge proofs to multiple verifiers
• Efficient NIZK arguments via parallel verification of Beneš networks
• Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages

This page was built for publication: Short non-interactive zero-knowledge proofs

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