scientific article; zbMATH DE number 1302862
From MaRDI portal
Publication:4249347
zbMath0931.94009MaRDI QIDQ4249347
Publication date: 7 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (36)
Bringing Order to Chaos: The Case of Collision-Resistant Chameleon-Hashes ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ Composition with knowledge assumptions ⋮ Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ On the (In)Security of SNARKs in the Presence of Oracles ⋮ Interactive Oracle Proofs ⋮ The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures ⋮ The wonderful world of global random oracles ⋮ Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits ⋮ NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion ⋮ Certificateless message recovery signatures providing Girault's level-3 security ⋮ Succinct NP Proofs from an Extractability Assumption ⋮ Existence of 3-round zero-knowledge proof systems for NP ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash ⋮ Which languages have 4-round zero-knowledge proofs? ⋮ The hunting of the SNARK ⋮ Impossibilities in succinct arguments: black-box extraction and more ⋮ On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups ⋮ Random walks and concurrent zero-knowledge ⋮ Cryptography Using Captcha Puzzles ⋮ The Knowledge Complexity of Interactive Proof Systems ⋮ Lower bounds for non-black-box zero knowledge ⋮ The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model ⋮ Statistically Hiding Sets ⋮ Linearly-homomorphic signatures and scalable mix-nets ⋮ On the Existence of Extractable One-Way Functions ⋮ Efficient fully structure-preserving signatures and shrinking commitments ⋮ Efficient and Short Certificateless Signature ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier ⋮ SimS: a simplification of SiGamal ⋮ On instantiating the algebraic group model from falsifiable assumptions
This page was built for publication:
