From Weak to Strong Zero-Knowledge and Applications

DOI10.1007/978-3-662-46494-6_4zbMath1354.94026OpenAlexW1522899817MaRDI QIDQ5261624

Edward Lui, Rafael Pass, Kai-Min Chung

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)

Related Items

A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ Improved computational extractors and their applications ⋮ Simulating Auxiliary Inputs, Revisited ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Individual simulations ⋮ Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness ⋮ On expected polynomial runtime in cryptography ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ What security can we achieve within 4 rounds? ⋮ Low error efficient computational extractors in the CRS model ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ On publicly-accountable zero-knowledge and small shuffle arguments ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier