scientific article; zbMATH DE number 2009955

MaRDI QIDQ4434875zbMATH OpenFDO

Authors Juan Garay, Ke Yang, Philip MacKenzie

Publication date 26 November 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2656/26560177.htm

zbMATH Keywords

zero-knowledge protocolssignature scheme

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Strengthening zero-knowledge protocols using signatures
• Unifying Zero-Knowledge Proofs of Knowledge
• On the amortized complexity of zero-knowledge protocols
• scientific article; zbMATH DE number 503350
• scientific article; zbMATH DE number 1304087

Cited in

(27)

• Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
• Secure two-party computation via cut-and-choose oblivious transfer
• Several cryptographic applications of \(\Sigma\)-protocol
• New approaches for deniable authentication
• Linearly homomorphic structure-preserving signatures and their applications
• Strengthening zero-knowledge protocols using signatures
• Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
• TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
• Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head}
• A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
• Signatures from sequential-OR proofs
• Efficiency preserving transformations for concurrent non-malleable zero knowledge
• Zero-Knowledge Accumulators and Set Algebra
• Perfect Non-interactive Zero Knowledge for NP
• Confidential and efficient asset proof for bitcoin exchanges
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• Hybrid commitments and their applications to zero-knowledge proof systems
• Non-malleable vector commitments via local equivocability
• All-but-many encryption
• Non-malleable vector commitments via local equivocability
• Traceable ring signatures: general framework and post-quantum security
• Novel \(\Omega\)-protocols for NP
• Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
• Practical dynamic group signatures without knowledge extractors
• Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
• New constructions of efficient simulation-sound commitments using encryption and their applications
• Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4434875)