Acyclicity programming for sigma-protocols
From MaRDI portal
Publication:2695643
DOI10.1007/978-3-030-90459-3_15OpenAlexW3214685808MaRDI QIDQ2695643FDOQ2695643
Miyako Ohkubo, Miguel Ambrona, Alon Rosen, Masayuki Abe, Andrej Bogdanov
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90459-3_15
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
- Security arguments for digital signatures and blind signatures
- Trapdoors for hard lattices and new cryptographic constructions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pairings for cryptographers
- The monotone circuit complexity of Boolean functions
- Superpolynomial lower bounds for monotone span programs
- A new paradigm for public key identification
- Title not available (Why is that?)
- Title not available (Why is that?)
- 1-out-of-n Signatures from a Variety of Keys
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lower bounds on monotone complexity of the logical permanent
- The gap between monotone and non-monotone circuit complexity is exponential
- Title not available (Why is that?)
- Updatable and universal common reference strings with applications to zk-SNARKs
- Traceable ring signatures with post-quantum security
- Aurora: transparent succinct arguments for R1CS
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
- Lifting Nullstellensatz to monotone span programs over any field
- An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
- Improved OR-Composition of Sigma-Protocols
- On the Size of Pairing-Based Non-interactive Arguments
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- Signatures from sequential-OR proofs
- Short Accountable Ring Signatures Based on DDH
- New code-based privacy-preserving cryptographic constructions
- Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability
- Non-interactive composition of sigma-protocols via Share-then-Hash
Cited In (6)
- Sigma protocols from verifiable secret sharing and their applications
- Title not available (Why is that?)
- 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
Uses Software
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)
