Signatures from sequential-OR proofs
From MaRDI portal
Publication:2055653
Recommendations
- BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
- Compact Group Signatures Without Random Oracles
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Batch ZK Proof and Verification of OR Logic
Cites work
- 1-out-of-n Signatures from a Variety of Keys
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
- An improved compression technique for signatures based on learning with errors
- Black-box separations of hash-and-sign signatures in the non-programmable random oracle model
- Black-box separations on Fiat-Shamir-type signatures in the non-programmable random oracle model
- Breaking RSA may not be equivalent to factoring
- Designated verifier proofs and their applications
- Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
- Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
- Efficient signature generation by smart cards
- Group Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 2009955 (Why is no real title available?)
- scientific article; zbMATH DE number 2081086 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 2086722 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- Impossibility on the provable security of the Fiat-Shamir-type signatures in the non-programmable random oracle model
- Improved OR-composition of sigma-protocols
- Information Security and Privacy
- Lattice signatures without trapdoors
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Limitations of the meta-reduction technique: the case of Schnorr signatures
- Online/offline OR composition of sigma protocols
- Practical and tightly-secure digital signatures and authenticated key exchange
- Quantum computation and quantum information. 10th anniversary edition
- Random oracles in a quantum world
- Random oracles with(out) programmability
- Revisiting post-quantum Fiat-Shamir
- Revisiting TESLA in the quantum random oracle model
- Secure identity-based encryption in the quantum random oracle model
- Security arguments for digital signatures and blind signatures
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- The Fiat-Shamir transformation in a quantum world
- The wonderful world of global random oracles
- Tightly Secure Signatures and Public-Key Encryption
- Tightly secure signatures from lossy identification schemes
- Tightly-secure authenticated key exchange
- Towards practical lattice-based one-time linkable ring signatures
- Universally Composable Security with Global Setup
Cited in
(22)- Impossibility on tamper-resilient cryptography with uniqueness properties
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance
- More efficient digital signatures with tight multi-user security
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Practical dynamic group signatures without knowledge extractors
- Acyclicity programming for sigma-protocols
- Improved OR-composition of sigma-protocols
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- A generic transform from multi-round interactive proof to NIZK
- Resumable zero-knowledge for circuits from symmetric key primitives
- Lattice-based signatures with tight adaptive corruptions and more
- Improved straight-line extraction in the random oracle model with applications to signature aggregation
- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
- Generalized iterated-sums signatures
- CDS composition of multi-round protocols
- Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
- On the limits of non-interactive blind signatures
This page was built for publication: Signatures from sequential-OR proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055653)
