Batch proofs of partial knowledge

DOI10.1007/978-3-642-38980-1_32MaRDI QIDQ2873655zbMATH OpenOpenAlexFDO

Authors Ryan Henry, Ian Goldberg

Publication date 24 January 2014

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38980-1_32

zbMATH Keywords

batch proof and verificationcryptanalysisefficiencylattice-based attackszero-knowledge

Mathematics Subject Classification ID

Network protocols (68M12) Cryptography (94A60)

Recommendations

• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
• Batch ZK Proof and Verification of OR Logic
• Efficient batch zero-knowledge arguments for low degree polynomials
• Zero-knowledge proofs of knowledge for group homomorphisms
• Batch Processing of Interactive Proofs

Cited in

(8)

• Zero-knowledge argument for simultaneous discrete logarithms
• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
• Zero-knowledge argument for simultaneous discrete logarithms
• Batch Processing of Interactive Proofs
• Anonymous tokens with public metadata and applications to private contact tracing
• Resumable zero-knowledge for circuits from symmetric key primitives
• Rogue-instance security for batch knowledge proofs
• Strong batching for non-interactive statistical zero-knowledge

This page was built for publication: Batch proofs of partial knowledge

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