Codes and cryptography
Quantum computation and quantum information
Quantum computation and quantum information
Quantum Bit Commitment from a Physical Assumption
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
ACM SIGACT News - A special issue on cryptography
Large deviations for sums of partly dependent random variables
Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part I
Cryptography In the Bounded Quantum-Storage Model
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Concentration of Measure for the Analysis of Randomized Algorithms
Concentration of Measure for the Analysis of Randomized Algorithms
Public-Key Cryptosystems Resilient to Key Leakage
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Secure identification and QKD in the bounded-quantum-storage model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
A tight high-order entropic quantum uncertainty relation with applications
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Founding cryptography on tamper-proof hardware tokens
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Coding theorem and strong converse for quantum channels
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
The Bounded-Storage Model in the Presence of a Quantum Adversary
IEEE Transactions on Information Theory
Adaptively secure garbling with applications to one-time programs and secure outsourcing
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Hi-index | 0.00 |
One-time memories (OTM's) are simple tamper-resistant cryptographic devices, which can be used to implement one-time programs, a very general form of software protection and program obfuscation. Here we investigate the possibility of building OTM's using quantum mechanical devices. It is known that OTM's cannot exist in a fully-quantum world or in a fully-classical world. Instead, we propose a new model based on isolated qubits - qubits that can only be accessed using local operations and classical communication (LOCC). This model combines a quantum resource (single-qubit measurements) with a classical restriction (on communication between qubits), and can be implemented using current technologies, such as nitrogen vacancy centers in diamond. In this model, we construct OTM's that are information-theoretically secure against one-pass LOCC adversaries that use 2-outcome measurements. Our construction resembles Wiesner's old idea of quantum conjugate coding, implemented using random error-correcting codes; our proof of security uses entropy chaining to bound the supremum of a suitable empirical process. In addition, we conjecture that our random codes can be replaced by some class of efficiently-decodable codes, to get computationally-efficient OTM's that are secure against computationally-bounded LOCC adversaries. In addition, we construct data-hiding states, which allow an LOCC sender to encode an (n-O(1))-bit messsage into n qubits, such that at most half of the message can be extracted by a one-pass LOCC receiver, but the whole message can be extracted by a general quantum receiver.