Strengthening zero-knowledge protocols using signatures
From MaRDI portal
Recommendations
Cited in
(32)- Hybrid commitments and their applications to zero-knowledge proof systems
- New approaches for deniable authentication
- Confidential and efficient asset proof for bitcoin exchanges
- All-but-many encryption
- Secure two-party computation via cut-and-choose oblivious transfer
- Traceable ring signatures: general framework and post-quantum security
- Signatures from sequential-OR proofs
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Novel \(\Omega\)-protocols for NP
- Strengthening zero-knowledge protocols using signatures
- Practical dynamic group signatures without knowledge extractors
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- Non-malleable vector commitments via local equivocability
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- New constructions of efficient simulation-sound commitments using encryption and their applications
- Zero-Knowledge Accumulators and Set Algebra
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
- Efficiency preserving transformations for concurrent non-malleable zero knowledge
- Perfect Non-interactive Zero Knowledge for NP
- Several cryptographic applications of -protocol
- Non-malleable vector commitments via local equivocability
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
- Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head}
- Adaptive UC NIZK for practical applications
- Straight-line knowledge extraction for multi-round protocols
- Commit-and-prove system for vectors and applications to threshold signing
- Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
- Non-malleable subvector commitments
- Linearly homomorphic structure-preserving signatures and their applications
This page was built for publication: Strengthening zero-knowledge protocols using signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4434875)
