Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness

DOI10.1007/978-3-030-90459-3_13MaRDI QIDQ2695641zbMATH OpenOpenAlexFDO

Authors Susumu Kiyoshima

Publication date 31 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90459-3_13

zbMATH Keywords

delayed-input settingdelayed-input verifiers

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Impossibility Results on Weakly Black-Box Hardness Amplification
• The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
• Weak zero-knowledge beyond the black-box barrier
• Weak Zero-Knowledge beyond the Black-Box Barrier
• Towards a unified approach to black-box constructions of zero-knowledge proofs
• Lower bounds for non-black-box zero knowledge
• Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
• A black-box approach to post-quantum zero-knowledge in constant rounds
• Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
• Zero-knowledge argument for polynomial evaluation with application to blacklists

Cites work

• scientific article; zbMATH DE number 176565 (Why is no real title available?)
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• Advances in Cryptology - CRYPTO 2003
• Barriers in cryptography with weak, correlated and leaky sources
• Definitions and properties of zero-knowledge proof systems
• Distinguisher-dependent simulation in two rounds and its applications
• Foundations of Cryptography
• From weak to strong zero-knowledge and applications
• Magic functions
• Minimum disclosure proofs of knowledge
• Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
• New techniques for noninteractive zero-knowledge
• Nonmalleable Cryptography
• On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
• On the existence of extractable one-way functions
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Statistical ZAP arguments
• Statistical ZAPR arguments from bilinear maps
• Statistical Zaps and new oblivious transfer protocols
• Statistical witness indistinguishability (and more) in two messages
• The Knowledge Complexity of Interactive Proof Systems
• Two-message witness indistinguishability and secure computation in the plain model from new assumptions
• Weak zero-knowledge beyond the black-box barrier
• Witness encryption and its applications
• Zaps and Their Applications

Cited in

(4)

• Weak zero-knowledge beyond the black-box barrier
• Distinguisher-dependent simulation in two rounds and its applications
• Knowledge encryption and its applications to simulatable protocols with low round-complexity
• Delayed-input cryptographic protocols

This page was built for publication: Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695641)