Efficient proofs of knowledge for threshold relations
From MaRDI portal
Publication:6109456
DOI10.1007/978-3-031-17143-7_3zbMath1527.94015OpenAlexW4296831703MaRDI QIDQ6109456
Ivan Visconti, Vincenzo Botta, Daniele Friolo, Gennaro Avitabile
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
Cites Work
- Unnamed Item
- Unnamed Item
- Stacked garbling for disjunctive zero-knowledge proofs
- Threshold ring signatures: new definitions and post-quantum security
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Stronger notions and a more efficient construction of threshold ring signatures
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Scalable zero knowledge with no trusted setup
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
- Online/Offline OR Composition of Sigma Protocols
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation
