Acyclicity programming for sigma-protocols
From MaRDI portal
Publication:2695643
DOI10.1007/978-3-030-90459-3_15OpenAlexW3214685808MaRDI QIDQ2695643
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Updatable and universal common reference strings with applications to zk-SNARKs
- Traceable ring signatures with post-quantum security
- Pairings for cryptographers
- Lower bounds on monotone complexity of the logical permanent
- The monotone circuit complexity of Boolean functions
- Security arguments for digital signatures and blind signatures
- Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
- Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
- The gap between monotone and non-monotone circuit complexity is exponential
- Superpolynomial lower bounds for monotone span programs
- Signatures from sequential-OR proofs
- Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability
- New code-based privacy-preserving cryptographic constructions
- Aurora: transparent succinct arguments for R1CS
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Improved OR-Composition of Sigma-Protocols
- A new paradigm for public key identification
- Trapdoors for hard lattices and new cryptographic constructions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- 1-out-of-n Signatures from a Variety of Keys
- How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
- Short Accountable Ring Signatures Based on DDH
- 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
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- On the Size of Pairing-Based Non-interactive Arguments
This page was built for publication: Acyclicity programming for sigma-protocols