Acyclicity programming for sigma-protocols

DOI10.1007/978-3-030-90459-3_15MaRDI QIDQ2695643zbMATH OpenOpenAlexFDO

Authors Masayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen

Publication date 31 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90459-3_15

zbMATH Keywords

random oracleszero-knowledge proofssigma-protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Non-interactive composition of sigma-protocols via Share-then-Hash
• Improved OR-composition of sigma-protocols
• Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
• DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
• Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions

Cites work

• scientific article; zbMATH DE number 4191102 (Why is no real title available?)
• scientific article; zbMATH DE number 176869 (Why is no real title available?)
• scientific article; zbMATH DE number 1162684 (Why is no real title available?)
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• scientific article; zbMATH DE number 1942438 (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?)
• scientific article; zbMATH DE number 1440068 (Why is no real title available?)
• 1-out-of-n Signatures from a Variety of Keys
• A new paradigm for public key identification
• An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
• Aurora: transparent succinct arguments for R1CS
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios
• Improved OR-composition of sigma-protocols
• Lifting Nullstellensatz to monotone span programs over any field
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
• Lower bounds on monotone complexity of the logical permanent
• New code-based privacy-preserving cryptographic constructions
• Non-interactive composition of sigma-protocols via Share-then-Hash
• On the size of pairing-based non-interactive arguments
• Pairings for cryptographers
• Security arguments for digital signatures and blind signatures
• Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability
• Short accountable ring signatures based on DDH
• Signatures from sequential-OR proofs
• Superpolynomial lower bounds for monotone span programs
• The gap between monotone and non-monotone circuit complexity is exponential
• The monotone circuit complexity of Boolean functions
• Traceable ring signatures with post-quantum security
• Trapdoors for hard lattices and new cryptographic constructions
• Updatable and universal common reference strings with applications to zk-SNARKs
• Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors

Cited in

(6)

• Sigma protocols from verifiable secret sharing and their applications
• scientific article; zbMATH DE number 25189 (Why is no real title available?)
• Pairing-free blind signatures from standard assumptions in the ROM
• CDS composition of multi-round protocols
• Compact proofs of partial knowledge for overlapping CNF formulae
• Hybrid zero-knowledge from garbled circuits and circuit-based composition of \(\Sigma \)-protocols

Describes a project that uses

Uses Software

• Ligero

This page was built for publication: Acyclicity programming for sigma-protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695643)