Efficient proofs of knowledge for threshold relations

DOI10.1007/978-3-031-17143-7_3zbMATH Open1527.94015OpenAlexW4296831703MaRDI QIDQ6109456FDOQ6109456

Authors: Gennaro Avitabile, Vincenzo Botta, Daniele Friolo, Ivan Visconti 

Publication date: 28 July 2023

Published in: Computer Security – ESORICS 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-17143-7_3

Recommendations

• Zero-knowledge proofs from secure multiparty computation
• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
• Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
• Zero knowledge with efficient provers
• scientific article; zbMATH DE number 883898

zbMATH Keywords

\(\varSigma\)-protocolscommunication efficiencythreshold relations

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Scalable zero knowledge with no trusted setup
• One-out-of-many proofs: or how to leak a secret and spend a coin
• Stronger notions and a more efficient construction of threshold ring signatures
• Online/offline OR composition of sigma protocols
• Threshold ring signatures: new definitions and post-quantum security
• Stacked garbling for disjunctive zero-knowledge proofs
• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
• Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
• Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation
• Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures

Cited In (7)

• Efficient rational proofs with strong utility-gap guarantees
• Title not available (Why is that?)
• Signatures of knowledge for Boolean circuits under standard assumptions
• CDS composition of multi-round protocols
• Compact proofs of partial knowledge for overlapping CNF formulae
• Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols
• Signatures of Knowledge for Boolean Circuits Under Standard Assumptions

This page was built for publication: Efficient proofs of knowledge for threshold relations

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