scientific article; zbMATH DE number 1302862
From MaRDI portal
Publication:4249347
Recommendations
Cited in
(44)- Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- The Knowledge Complexity of Interactive Proof Systems
- Weak zero-knowledge via the Goldreich-Levin theorem
- Certificateless message recovery signatures providing Girault's level-3 security
- Advances in Cryptology – CRYPTO 2004
- Point obfuscation and 3-round zero-knowledge
- SimS: a simplification of SiGamal
- Random walks and concurrent zero-knowledge
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Weak zero-knowledge beyond the black-box barrier
- 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
- On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
- Succinct non-interactive arguments via linear interactive proofs
- Bringing order to chaos: the case of collision-resistant chameleon-hashes
- Composition with knowledge assumptions
- Cryptography using \texttt{CAPTCHA} puzzles
- On the (in)security of SNARKs in the presence of oracles
- The wonderful world of global random oracles
- Efficient and Short Certificateless Signature
- 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
- Linearly-homomorphic signatures and scalable mix-nets
- Succinct NP Proofs from an Extractability Assumption
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- Lower bounds for non-black-box zero knowledge
- R3PO: reach-restricted reactive program obfuscation and its applications
- Existence of 3-round zero-knowledge proof systems for NP
- Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- 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
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)
