2 citations · 2 across the 1 of their papers we have counts for
Showing quant-phShow all
2 papers · 1 filter
quant-ph2022★ 2 cited
Constructive Post-Quantum Reductions
Nir Bitansky, Zvika Brakerski, Yael Tauman Kalai
Is it possible to convert classical cryptographic reductions into post-quantum ones? It is customary to argue that while this is problematic in the interactive setting, non-interac…
quant-ph2019
Post-quantum Zero Knowledge in Constant Rounds
Nir Bitansky, Omri Shmueli
We construct a constant-round zero-knowledge classical argument for NP secure against quantum attacks. We assume the existence of Quantum Fully-Homomorphic Encryption and other sta…