Asymptotic theory of finite dimensional normed spaces
Asymptotic theory of finite dimensional normed spaces
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Communication complexity
Tiny families of functions with random properties: a quality-size trade-off for hashing
Proceedings of the workshop on Randomized algorithms and computation
Randomness-optimal oblivious sampling
Proceedings of the workshop on Randomized algorithms and computation
Extracting all the randomness and reducing the error in Trevisan's extractors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Modern computer algebra
Lectures on Discrete Geometry
How to Fool an Unbounded Adversary with a Short Key
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Cryptography In the Bounded Quantum-Storage Model
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Journal of the ACM (JACM)
Uncertainty principles, extractors, and explicit embeddings of l2 into l1
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The unified theory of pseudorandomness: guest column
ACM SIGACT News
Almost Euclidean subspaces of ℓN1 via expander codes
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective
Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
Journal of the ACM (JACM)
Entropic security in quantum cryptography
Quantum Information Processing
Random Measurement Bases, Quantum State Distinction and Applications to the Hidden Subgroup Problem
Algorithmica - Special Issue: Quantum Computation; Guest Editors: Frédéric Magniez and Ashwin Nayak
A tight high-order entropic quantum uncertainty relation with applications
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Quantum entropic security and approximate quantum encryption
IEEE Transactions on Information Theory
Limitations of quantum coset states for graph isomorphism
Journal of the ACM (JACM)
Almost-Euclidean subspaces of l1Nvia tensor products: a simple approach to randomness reduction
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Limits on entropic uncertainty relations for 3 and more MUBs
Quantum Information & Computation
Quantum and classical message protect identification via quantum channels
Quantum Information & Computation
Entropic security and the encryption of high entropy messages
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
A quantum cipher with near optimal key-recycling
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
IEEE Transactions on Information Theory
On quasi-orthogonal signatures for CDMA systems
IEEE Transactions on Information Theory
Unconditional Security From Noisy Quantum Storage
IEEE Transactions on Information Theory
Hi-index | 0.00 |
The existence of quantum uncertainty relations is the essential reason that some classically unrealizable cryptographic primitives become realizable when quantum communication is allowed. One operational manifestation of these uncertainty relations is a purely quantum effect referred to as information locking [DiVincenzo et al. 2004]. A locking scheme can be viewed as a cryptographic protocol in which a uniformly random n-bit message is encoded in a quantum system using a classical key of size much smaller than n. Without the key, no measurement of this quantum state can extract more than a negligible amount of information about the message, in which case the message is said to be “locked”. Furthermore, knowing the key, it is possible to recover, that is “unlock”, the message. In this article, we make the following contributions by exploiting a connection between uncertainty relations and low-distortion embeddings of Euclidean spaces into slightly larger spaces endowed with the ℓ1 norm. We introduce the notion of a metric uncertainty relation and connect it to low-distortion embeddings of ℓ2 into ℓ1. A metric uncertainty relation also implies an entropic uncertainty relation. We prove that random bases satisfy uncertainty relations with a stronger definition and better parameters than previously known. Our proof is also considerably simpler than earlier proofs. We then apply this result to show the existence of locking schemes with key size independent of the message length. Moreover, we give efficient constructions of bases satisfying metric uncertainty relations. The bases defining these metric uncertainty relations are computable by quantum circuits of almost linear size. This leads to the first explicit construction of a strong information locking scheme. These constructions are obtained by adapting an explicit norm embedding due to Indyk [2007] and an extractor construction of Guruswami et al. [2009]. We apply our metric uncertainty relations to exhibit communication protocols that perform equality testing of n-qubit states. We prove that this task can be performed by a single message protocol using O(log2 n) qubits and n bits of communication, where the computation of the sender is efficient.