scientific article; zbMATH DE number 2009955

Juan A. Garay, Ke Yang, Philip D. MacKenzie

Publication date: 26 November 2003

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

zero-knowledge protocols signature scheme

Mathematics Subject Classification ID

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

Related Items

Confidential and efficient asset proof for bitcoin exchanges, New Constructions of Efficient Simulation-Sound Commitments Using Encryption and Their Applications, Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions, Secure two-party computation via cut-and-choose oblivious transfer, Linearly homomorphic structure-preserving signatures and their applications, Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge, Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions, Zero-Knowledge Accumulators and Set Algebra, 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, Several cryptographic applications of \(\Sigma\)-protocol, All-but-many encryption, Novel \(\Omega\)-protocols for NP, Perfect Non-interactive Zero Knowledge for NP, Non-malleable vector commitments via local equivocability, Traceable ring signatures: general framework and post-quantum security, A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles, Signatures from sequential-OR proofs, Hybrid commitments and their applications to zero-knowledge proof systems, Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model, Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings, New approaches for deniable authentication, Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge