DAG- : a DAG-based sigma protocol for relations in CNF
From MaRDI portal
Publication:6132415
DOI10.1007/978-3-031-22966-4_12zbMATH Open1519.94200OpenAlexW4320154833MaRDI QIDQ6132415FDOQ6132415
Author name not available (Why is that?)
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
Recommendations
- A Datalog recognizer for almost affine \(\lambda \)-CFGs
- scientific article; zbMATH DE number 1149441
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- On compiling CNFs into structured deterministic DNNFs
- Recent advances in Datalog\(^\pm \)
- On the relation between structured \(d\)-DNNFs and SDDs
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\).
- Top-down algorithms for constructing structured DNNF: theoretical and practical implications
- Combining relational calculus and the Dijkstra-Gries method for deriving relational programs
directed acyclic graphdisjunctive normal formconjunctive normal formsigma protocolproof of partial knowledge
Cites Work
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- On the complexity of \(k\)-SAT
- Efficient signature generation by smart cards
- Title not available (Why is that?)
- Signatures Resilient to Continual Leakage on Memory and Computation
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Title not available (Why is that?)
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- 1-out-of-n Signatures from a Variety of Keys
- Perfect Non-interactive Zero Knowledge for NP
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Improved OR-Composition of Sigma-Protocols
- Online/Offline OR Composition of Sigma Protocols
- Round optimal secure multiparty computation from minimal assumptions
- Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
- Signatures from sequential-OR proofs
- Fully secure attribute-based encryption for \(t\)-CNF from LWE
- On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Fully Secure Cipertext-Policy Hiding CP-ABE
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132415)
