Efficient zero-knowledge proofs. (Abstract)

DOI10.1007/978-3-642-21969-6_24MaRDI QIDQ3011928zbMATH OpenOpenAlexFDO

Authors Jens Groth

Publication date 29 June 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21969-6_24

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient zero-knowledge proof systems
• Zero‐Knowledge Proofs
• Zero-knowledge proofs from secure multiparty computation
• scientific article; zbMATH DE number 3999326
• Efficient 4-round zero-knowledge proof system for NP

Cited in

(16)

• On Efficient Zero-Knowledge PCPs
• New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust
• scientific article; zbMATH DE number 1952907 (Why is no real title available?)
• scientific article; zbMATH DE number 4211485 (Why is no real title available?)
• Zero-knowledge proofs for set membership: efficient, succinct, modular
• Efficient Proofs of Secure Erasure
• Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
• Precise zero-knowledge arguments with poly-logarithmic efficiency
• Physical zero-knowledge proofs of physical properties
• Zero-Knowledge Proofs with Witness Elimination
• Efficient zero-knowledge proof systems
• On zero-knowledge proofs (extended abstract)
• Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
• Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
• Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions

This page was built for publication: Efficient zero-knowledge proofs. (Abstract)

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