5 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.CR2022
On the Feasibility of Unclonable Encryption, and More
Prabhanjan Ananth, Fatih Kaleoglu, Xingjian Li +2
Unclonable encryption, first introduced by Broadbent and Lord (TQC'20), is a one-time encryption scheme with the following security guarantee: any non-local adversary (A, B, C) can…
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…