DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
From MaRDI portal
Publication:6132415
DOI10.1007/978-3-031-22966-4_12zbMath1519.94200OpenAlexW4320154833MaRDI QIDQ6132415
No author found.
Publication date: 16 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22966-4_12
directed acyclic graphdisjunctive normal formconjunctive normal formsigma protocolproof of partial knowledge
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Efficient signature generation by smart cards
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Signatures from sequential-OR proofs
- On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
- Round optimal secure multiparty computation from minimal assumptions
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Fully secure attribute-based encryption for \(t\)-CNF from LWE
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Improved OR-Composition of Sigma-Protocols
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
- Signatures Resilient to Continual Leakage on Memory and Computation
- Fully Secure Cipertext-Policy Hiding CP-ABE
- Perfect Non-interactive Zero Knowledge for NP
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- 1-out-of-n Signatures from a Variety of Keys
- Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Online/Offline OR Composition of Sigma Protocols
- On the complexity of \(k\)-SAT
