450 citations · 519 across the 27 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.CR2016★ 19 cited
A Note on Quantum-Secure PRPs
Mark Zhandry
We show how to construct pseudorandom permutations (PRPs) that remain secure even if the adversary can query the permutation, both in the forward and reverse directions, on a quant…
cs.CR2016
Strong Hardness of Privacy from Weak Traitor Tracing
Lucas Kowalczyk, Tal Malkin, Jonathan Ullman +1
Despite much study, the computational complexity of differential privacy remains poorly understood. In this paper we consider the computational complexity of accurately answering a…
cs.CR2016★ 5 cited
New security notions and feasibility results for authentication of quantum data
Sumegha Garg, Henry Yuen, Mark Zhandry
We give a new class of security definitions for authentication in the quantum setting. These definitions capture and strengthen existing definitions of security against quantum adv…