Compact proofs of partial knowledge for overlapping CNF formulae
From MaRDI portal
Publication:6655872
DOI10.1007/S00145-024-09532-3MaRDI QIDQ6655872FDOQ6655872
Authors: Gennaro Avitabile, Vincenzo Botta, Daniele Friolo, D. Venturi, Ivan Visconti 
Publication date: 27 December 2024
Published in: Journal of Cryptology (Search for Journal in Brave)
Recommendations
Cites Work
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- The knowledge complexity of interactive proof-systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- 1-out-of-n Signatures from a Variety of Keys
- Designated verifier proofs and their applications
- On converting CNF to DNF
- Aurora: transparent succinct arguments for R1CS
- One-out-of-many proofs: or how to leak a secret and spend a coin
- Efficient proofs of knowledge for threshold relations
- Improved OR-composition of sigma-protocols
- Online/offline OR composition of sigma protocols
- On the size of pairing-based non-interactive arguments
- Stacked garbling for disjunctive zero-knowledge proofs
- Fully secure attribute-based encryption for \(t\)-CNF from LWE
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation
- Acyclicity programming for sigma-protocols
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
This page was built for publication: Compact proofs of partial knowledge for overlapping CNF formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655872)
