scientific article; zbMATH DE number 2009955
From MaRDI portal
Publication:4434875
zbMATH Open1037.68741MaRDI QIDQ4434875FDOQ4434875
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
Title of this publication is not available (Why is that?)
Recommendations
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cited In (27)
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
- Confidential and efficient asset proof for bitcoin exchanges
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- All-but-many encryption
- Perfect Non-interactive Zero Knowledge for NP
- Hybrid commitments and their applications to zero-knowledge proof systems
- Novel \(\Omega\)-protocols for NP
- Secure two-party computation via cut-and-choose oblivious transfer
- Linearly homomorphic structure-preserving signatures and their applications
- Several cryptographic applications of \(\Sigma\)-protocol
- Traceable ring signatures: general framework and post-quantum security
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Signatures from sequential-OR proofs
- Efficiency preserving transformations for concurrent non-malleable zero knowledge
- New constructions of efficient simulation-sound commitments using encryption and their applications
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Practical dynamic group signatures without knowledge extractors
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- New approaches for deniable authentication
- Strengthening zero-knowledge protocols using signatures
- Zero-Knowledge Accumulators and Set Algebra
- Non-malleable vector commitments via local equivocability
- 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}
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)
