From weak to strong zero-knowledge and applications

DOI10.1007/978-3-662-46494-6_4MaRDI QIDQ5261624zbMATHOpenAlexFDO

Authors Kai-Min Chung, Edward Lui, Rafael Pass

Publication date 6 July 2015

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46494-6_4

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Weak zero-knowledge beyond the black-box barrier
• An Unconditional Study of Computational Zero Knowledge
• Reduction zero-knowledge
• scientific article; zbMATH DE number 177820
• Zero-knowledge proofs from secure multiparty computation

Cited in

(17)

• Weak zero-knowledge beyond the black-box barrier
• On publicly-accountable zero-knowledge and small shuffle arguments
• Weak Zero-Knowledge beyond the Black-Box Barrier
• A black-box approach to post-quantum zero-knowledge in constant rounds
• Simulating auxiliary inputs, revisited
• A Weakness in Some Oblivious Transfer and Zero-Knowledge Protocols
• Low error efficient computational extractors in the CRS model
• Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
• Magic adversaries versus individual reduction: science wins either way
• Improved computational extractors and their applications
• Knowledge encryption and its applications to simulatable protocols with low round-complexity
• Theory of Cryptography
• What security can we achieve within 4 rounds?
• Individual simulations
• Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
• On expected polynomial runtime in cryptography
• Weak zero-knowledge via the Goldreich-Levin theorem

This page was built for publication: From weak to strong zero-knowledge and applications

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