Weak zero-knowledge beyond the black-box barrier

DOI10.1145/3313276.3316382zbMath1434.94059OpenAlexW2950535453MaRDI QIDQ5212849

Nir Bitansky, Dakshita Khurana, Omer Paneth

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3313276.3316382

zbMATH Keywords

zero-knowledgewitness hidinghomomorphic trapdoornon black-box simulation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (12)

A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash ⋮ Statistically sender-private OT from LPN and derandomization ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Individual simulations ⋮ Post-quantum resettably-sound zero knowledge ⋮ The round complexity of quantum zero-knowledge ⋮ Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness ⋮ Post-quantum multi-party computation ⋮ Secure software leasing ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments

This page was built for publication: Weak zero-knowledge beyond the black-box barrier