Results 1  10
of
50
Universally Composable Privacy Amplification against Quantum Adversaries
, 2004
"... Privacy amplification is the art of shrinking a partially secret string Z to a highly secret key S. We introduce a universally composable security definition for secret keys in a context where an adversary holds quantum information and show that privacy amplification by twouniversal hashing is secu ..."
Abstract

Cited by 70 (12 self)
 Add to MetaCart
(Show Context)
Privacy amplification is the art of shrinking a partially secret string Z to a highly secret key S. We introduce a universally composable security definition for secret keys in a context where an adversary holds quantum information and show that privacy amplification by twouniversal hashing is secure with respect to this definition. Additionally, we give an asymptotically optimal lower bound on the length of the extractable key S in terms of the adversary's (quantum) knowledge about Z.
General security definition and composability for quantum & classical protocols
, 2004
"... Abstract. We generalize the universally composable definition of Canetti to the Quantum World. The basic idea is the same as in the classical world. However, we unfold the result in a new model which is adapted to quantum protocols, and also simplify some aspects of the classical case. ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
(Show Context)
Abstract. We generalize the universally composable definition of Canetti to the Quantum World. The basic idea is the same as in the classical world. However, we unfold the result in a new model which is adapted to quantum protocols, and also simplify some aspects of the classical case.
Quantum and Relativistic Protocols for Secure MultiParty Computation
, 2007
"... iv ..."
(Show Context)
Unconditional security from noisy quantum storage
, 2009
"... We consider the implementation of twoparty cryptographic primitives based on the sole assumption that no largescale reliable quantum storage is available to the cheating party. We construct novel protocols for oblivious transfer and bit commitment, and prove that realistic noise levels provide sec ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
(Show Context)
We consider the implementation of twoparty cryptographic primitives based on the sole assumption that no largescale reliable quantum storage is available to the cheating party. We construct novel protocols for oblivious transfer and bit commitment, and prove that realistic noise levels provide security even against the most general attack. Such unconditional results were previously only known in the socalled boundedstorage model which is a special case of our setting. Our protocols can be implemented with presentday hardware used for quantum key distribution. In particular, no quantum storage is required for the honest parties.
The boundedstorage model in the presence of a quantum adversary
 IEEE Transactions on Information Theory
, 2008
"... Abstract—An extractor is a function that is used to extract randomness. Given an imperfect random sourceX and a uniform seedY, the output (X; Y) is close to uniform. We study properties of such functions in the presence of prior quantum information about X, with a particular focus on cryptographic a ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
(Show Context)
Abstract—An extractor is a function that is used to extract randomness. Given an imperfect random sourceX and a uniform seedY, the output (X; Y) is close to uniform. We study properties of such functions in the presence of prior quantum information about X, with a particular focus on cryptographic applications. We prove that certain extractors are suitable for key expansion in the boundedstorage model where the adversary has a limited amount of quantum memory. For extractors with onebit output we show that the extracted bit is essentially equally secure as in the case where the adversary has classical resources. We prove the security of certain constructions that output multiple bits in the boundedstorage model. Index Terms—Boundedstorage model, cryptography, extractors, locking, privacy amplification, quantum information theory, quantum key distribution, quantum memory, security proofs, universal composability. I.
Universally composable quantum multiparty computation
 In Advances in Cryptology – Proc. EUROCRYPT 2010, LNCS
, 2010
"... ar ..."
Simulatable security for quantum protocols
"... Abstract. The notion of simulatable security (reactive simulatability, universal composability) is a powerful tool for allowing the modular design of cryptographic protocols (composition of protocols) and showing the security of a given protocol embedded in a larger one. Recently, these methods have ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Abstract. The notion of simulatable security (reactive simulatability, universal composability) is a powerful tool for allowing the modular design of cryptographic protocols (composition of protocols) and showing the security of a given protocol embedded in a larger one. Recently, these methods have received much attention in the quantum cryptographic community (e.g. [RK04,BOHL + 04]). We give a short introduction to simulatable security in general and proceed by sketching the many different definitional choices together with their advantages and disadvantages. Based on the reactive simulatability modelling of Backes, Pfitzmann and Waidner [BPW04b] we then develop a quantum security model. By following the BPW modelling as closely as possible, we show that composable quantum security definitions for quantum protocols can strongly profit from their classical counterparts, since most of the definitional choices in the modelling are independent of the underlying machine model. In particular, we give a proof sketch for the simple composition theorem in our framework.
2005b, General paradigm for distilling classical key from quantum states, eprint quantph/0506189
"... states ..."
(Show Context)
C.: PositionBased Quantum Cryptography: Impossibility and Constructions. Full version of this paper
, 2010
"... Copyright It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content licence (like ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Copyright It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content licence (like