Compressing proofs of \(k\)-out-of-\(n\) partial knowledge

DOI10.1007/978-3-030-84259-8_3zbMath1489.94086OpenAlexW3037569478MaRDI QIDQ2139628

Ronald Cramer, Thomas Attema, Serge Fehr

Publication date: 18 May 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_3

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

A compressed \(\varSigma \)-protocol theory for lattices ⋮ Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions ⋮ ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ Extendable threshold ring signatures with enhanced anonymity ⋮ End-to-end secure messaging with traceability only for illegal content ⋮ Ring signatures with user-controlled linkability ⋮ Efficient proofs of knowledge for threshold relations ⋮ DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF ⋮ Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structure-preserving signatures and commitments to group elements
• Parallel coin-tossing and constant-round secure two-party computation
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Zether: towards privacy in a smart contract world
• One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Group Signatures
• The knowledge complexity of interactive proof-systems
• Short Accountable Ring Signatures Based on DDH
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

This page was built for publication: Compressing proofs of \(k\)-out-of-\(n\) partial knowledge