scientific article; zbMATH DE number 1302862

zbMATH Open0931.94009MaRDI QIDQ4249347FDOQ4249347

Authors: Satoshi Hada, Toshiaki Tanaka 

Publication date: 7 March 2000

Title of this publication is not available (Why is that?)

Recommendations

• Existence of 3-round zero-knowledge proof systems for NP
• On the existence of three round zero-knowledge proofs
• Reduction zero-knowledge
• scientific article; zbMATH DE number 4191106
• Advances in Cryptology – CRYPTO 2004

zbMATH Keywords

zero-knowledgeinteractive proofDiffie-Hellman problemauxiliary-input nonuniform zero-knowledge

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (43)

• Weak zero-knowledge via the Goldreich-Levin theorem
• The Knowledge Complexity of Interactive Proof Systems
• Advances in Cryptology – CRYPTO 2004
• Certificateless message recovery signatures providing Girault's level-3 security
• Point obfuscation and 3-round zero-knowledge
• SimS: a simplification of SiGamal
• Random walks and concurrent zero-knowledge
• Weak zero-knowledge beyond the black-box barrier
• NIZKs with an untrusted CRS: security in the face of parameter subversion
• On the existence of three round zero-knowledge proofs
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
• Bringing order to chaos: the case of collision-resistant chameleon-hashes
• On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
• Succinct non-interactive arguments via linear interactive proofs
• Composition with knowledge assumptions
• Cryptography using \texttt{CAPTCHA} puzzles
• Efficient and Short Certificateless Signature
• On the (in)security of SNARKs in the presence of oracles
• The wonderful world of global random oracles
• Impossibilities in succinct arguments: black-box extraction and more
• The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model
• Interactive oracle proofs
• Three-round public-coin bounded-auxiliary-input zero-knowledge arguments of knowledge
• Constant-round leakage-resilient zero-knowledge argument for NP from the knowledge-of-exponent assumption
• 3-message zero knowledge against human ignorance
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• Linearly-homomorphic signatures and scalable mix-nets
• Succinct NP Proofs from an Extractability Assumption
• R3PO: reach-restricted reactive program obfuscation and its applications
• Lower bounds for non-black-box zero knowledge
• Existence of 3-round zero-knowledge proof systems for NP
• Weak Zero-Knowledge beyond the Black-Box Barrier
• On the classification of knowledge-of-exponent assumptions in cyclic groups
• Multikey fully homomorphic encryption and applications
• The hunting of the SNARK
• Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes
• On constant-round concurrent zero-knowledge from a knowledge assumption
• Efficient fully structure-preserving signatures and shrinking commitments
• On the existence of extractable one-way functions
• Which languages have 4-round zero-knowledge proofs?
• Statistically Hiding Sets
• On instantiating the algebraic group model from falsifiable assumptions
• Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash

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 Q4249347)