



@article {3154,
	title = {Lattice-Based Quantum Advantage from Rotated Measurements},
	year = {2022},
	month = {10/18/2022},
	abstract = {<p>Trapdoor claw-free functions (TCFs) are immensely valuable in cryptographic interactions between a classical client and a quantum server. Typically, a protocol has the quantum server prepare a superposition of two-bit strings of a claw and then measure it using Pauli-X or Z measurements. In this paper, we demonstrate a new technique that uses the entire range of qubit measurements from the XY-plane. We show the advantage of this approach in two applications. First, building on (Brakerski et al. 2018, Kalai et al. 2022), we show an optimized two-round proof of quantumness whose security can be expressed directly in terms of the hardness of the LWE (learning with errors) problem. Second, we construct a one-round protocol for blind remote preparation of an arbitrary state on the XY-plane up to a Pauli-Z correction.</p>},
	keywords = {Cryptography and Security (cs.CR), Emerging Technologies (cs.ET), FOS: Computer and information sciences, FOS: Physical sciences, Quantum Physics (quant-ph)},
	doi = {10.48550/ARXIV.2210.10143},
	url = {https://arxiv.org/abs/2210.10143},
	author = {Yusuf Alnawakhtha and Mantri, Atul and Carl Miller and Wang, Daochen}
}
@article {2222,
	title = {Local randomness: Examples and application},
	journal = {Phys. Rev. A},
	year = {2018},
	month = {03/2018},
	pages = {032324},
	abstract = {<p>When two players achieve a superclassical score at a nonlocal game, their outputs must contain intrinsic randomness. This fact has many useful implications for quantum cryptography. Recently it has been observed [C. Miller and Y. Shi, Quantum Inf. Computat. 17, 0595 (2017)] that such scores also imply the existence of local randomness\&mdash;that is, randomness known to one player but not to the other. This has potential implications for cryptographic tasks between two cooperating but mistrustful players. In the current paper we bring this notion toward practical realization, by offering near-optimal bounds on local randomness for the CHSH game, and also proving the security of a cryptographic application of local randomness (single-bit certified deletion).</p>},
	doi = {https://doi.org/10.1103/PhysRevA.97.032324},
	url = {https://arxiv.org/abs/1708.04338},
	author = {Honghao Fu and Carl Miller}
}
