Improved OR-composition of sigma-protocols
From MaRDI portal
Recommendations
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Signatures from sequential-OR proofs
- BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
- Universally composable -protocols in the global random-oracle model
Cites work
- scientific article; zbMATH DE number 1808214 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 4101089 (Why is no real title available?)
- scientific article; zbMATH DE number 1302863 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 1162684 (Why is no real title available?)
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
- Automata, Languages and Programming
- Automata, Languages and Programming
- Efficiency preserving transformations for concurrent non-malleable zero knowledge
- Efficient Zero Knowledge on the Internet
- Extractable Perfectly One-Way Functions
- Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
- Hybrid commitments and their applications to zero-knowledge proof systems
- Making Sigma-protocols non-interactive without random oracles
- Non-interactive and reusable non-malleable commitment schemes
- On round-optimal zero knowledge in the bare public-key model
- On selective-opening attacks against encryption schemes
- 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
- Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
- Resettable zero-knowledge (extended abstract)
- Security proofs for signature schemes
- Strengthening zero-knowledge protocols using signatures
- Theory of Cryptography
- Unifying Zero-Knowledge Proofs of Knowledge
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
- Zaps and Their Applications
- Zero-knowledge proofs of knowledge for group homomorphisms
Cited in
(38)- DAG-\( \Sigma \): a DAG-based sigma protocol for relations in CNF
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Delayed-input cryptographic protocols
- Indistinguishable proofs of work or knowledge
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- Security of hedged Fiat-Shamir signatures under fault attacks
- Efficient NIZK arguments with straight-line simulation and extraction
- Fiat-Shamir for highly sound protocols is instantiable
- Concurrent non-malleable commitments (and more) in 3 rounds
- Fiat-Shamir for highly sound protocols is instantiable
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol
- Cryptographic reverse firewalls for interactive proof systems
- Improved straight-line extraction in the random oracle model with applications to signature aggregation
- Novel \(\Omega\)-protocols for NP
- Four-round statistical non-malleable zero-knowledge
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- Short-lived zero-knowledge proofs and signatures
- On the Power of Secure Two-Party Computation
- Cryptographic reverse firewalls for interactive proof systems
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Optimally sound sigma protocols under DCRA
- Signatures from sequential-OR proofs
- Stacked garbling for disjunctive zero-knowledge proofs
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
- On the formalisation of -protocols and commitment schemes
- Secure Stern Signatures in Quantum Random Oracle Model
- CDS composition of multi-round protocols
- Compact proofs of partial knowledge for overlapping CNF formulae
- On the power of secure two-party computation
- Hybrid zero-knowledge from garbled circuits and circuit-based composition of -protocols
- Acyclicity programming for sigma-protocols
- Hybrid zero-knowledge from garbled circuits
- Multi-theorem Fiat-Shamir transform from correlation-intractable hash functions
- Four-round black-box non-malleable schemes from one-way permutations
- An introduction to the use of zk-SNARKs in blockchains
This page was built for publication: Improved OR-composition of sigma-protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799092)
