DAG- : a DAG-based sigma protocol for relations in CNF

DOI10.1007/978-3-031-22966-4_12MaRDI QIDQ6132415zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

directed acyclic graphdisjunctive normal formconjunctive normal formsigma protocolproof of partial knowledge

Mathematics Subject Classification ID

Cryptography (94A60)

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^ .
• Top-down algorithms for constructing structured DNNF: theoretical and practical implications
• Combining relational calculus and the Dijkstra-Gries method for deriving relational programs

Cites work

• scientific article; zbMATH DE number 1030975 (Why is no real title available?)
• scientific article; zbMATH DE number 2081086 (Why is no real title available?)
• scientific article; zbMATH DE number 1406779 (Why is no real title available?)
• 1-out-of-n Signatures from a Variety of Keys
• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
• Constant-size structure-preserving signatures: generic constructions and simple assumptions
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient signature generation by smart cards
• Fully secure attribute-based encryption for \(t\)-CNF from LWE
• Fully secure cipertext-policy hiding CP-ABE
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Improved OR-composition of sigma-protocols
• Non-interactive composition of sigma-protocols via Share-then-Hash
• On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
• On the complexity of \(k\)-SAT
• One-out-of-many proofs: or how to leak a secret and spend a coin
• Online/offline OR composition of sigma protocols
• Perfect Non-interactive Zero Knowledge for NP
• Round optimal secure multiparty computation from minimal assumptions
• Shorter quasi-adaptive NIZK proofs for linear subspaces
• Signatures from sequential-OR proofs
• Signatures resilient to continual leakage on memory and computation
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
• Stretching Groth-Sahai: NIZK proofs of partial satisfiability

Cited in

(5)

• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
• CDS composition of multi-round protocols
• Compact proofs of partial knowledge for overlapping CNF formulae
• Acyclicity programming for sigma-protocols
• Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions

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)