E-Business@Print

König, Anja

doi:10.1007/978-3-642-18591-5

Cited by 4 publications

(86 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is in stark contrast to the classical world, but enables us to solve cryptographic problems such as key distribution [1,2] or two-party computation in the noisy-storage model [3,4]. Nevertheless, it is often possible to gain partial knowledge about the state.…”

Section: Introductionmentioning

confidence: 99%

“…The task of state discrimination with postmeasurement information (and no memory) for Bob is to * deepthi@caltech.edu † wehner@nus.edu.sg identify the string x, using the encoding b and his classical measurement outcome k, where we are again interested in maximizing Bob's average probability of success over all measurements he may perform. 1 In [3] it was shown how bounds on this success probability can be used to prove security in the noisy-storage model. Naturally, from a cryptographic standpoint it would be useful to know how much the additional information b can actually help Bob.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Using postmeasurement information in state discrimination

Gopal

Wehner

2010

Phys. Rev. A

View full text Add to dashboard Cite

We consider a special form of state discrimination in which after the measurement we are given additional information that may help us identify the state. This task plays a central role in the analysis of quantum cryptographic protocols in the noisy-storage model, where the identity of the state corresponds to a certain bit string, and the additional information is typically a choice of encoding that is initially unknown to the cheating party. We first provide simple optimality conditions for measurements for any such problem and show upper and lower bounds on the success probability. For a certain class of problems, we furthermore provide tight bounds on how useful postmeasurement information can be. In particular, we show that for this class finding the optimal measurement for the task of state discrimination with postmeasurement information does in fact reduce to solving a different problem of state discrimination without such information. However, we show that for the corresponding classical state discrimination problems with postmeasurement information such a reduction is impossible, by relating the success probability to the violation of Bell inequalities. This suggests the usefulness of postmeasurement information as another feature that distinguishes the classical from a quantum world.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Using postmeasurement information in state discrimination

Gopal

Wehner

2010

Phys. Rev. A

View full text Add to dashboard Cite

show abstract

“…The most general storage attacks were first mentioned in [20], but addressed only recently by König, Wehner, and Wullschleger [25]. In this most general model, the adversary can for example try to use a quantum error-correcting code in order to protect himself from storage errors.…”

Section: A Bounded-vs Noisy-quantum-storage Modelmentioning

confidence: 99%

“…In more detail, [25] introduces the conceptual novelty of splitting the security analysis of protocols for oblivious transfer and bit commitment in two phases. In the first phase, the players use the well-known BB84 quantum coding scheme to achieve a (quantum) primitive which the authors call weak string erasure.…”

Section: A Bounded-vs Noisy-quantum-storage Modelmentioning

confidence: 99%

“…Concretely, he is allowed to first perform an arbitrary perfect "encoding attack" on the incoming quantum state, then he uses his (noisy) quantum-storage device together with unlimited classical memory and finally, he can again perform perfect quantum computations. 1 The authors of [25] show how the security of protocols in this general model can be related to the maximal rate of classical information that can be transmitted over the noisy storage channel.…”

Section: A Bounded-vs Noisy-quantum-storage Modelmentioning

confidence: 99%

See 1 more Smart Citation

Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model

Schaffner

2010

Phys. Rev. A

View full text Add to dashboard Cite

We present simple protocols for oblivious transfer and password-based identification which are secure against general attacks in the noisy-quantum-storage model as defined in R. König, S. Wehner, and J. Wullschleger [e-print arXiv:0906.1030]. We argue that a technical tool from König et al. suffices to prove security of the known protocols. Whereas the more involved protocol for oblivious transfer from König et al. requires less noise in storage to achieve security, our "canonical" protocols have the advantage of being simpler to implement and the security error is easier control. Therefore, our protocols yield higher OT rates for many realistic noise parameters. Furthermore, a proof of security of a direct protocol for password-based identification against general noisy-quantum-storage attacks is given.

show abstract

Implementation of two-party protocols in the noisy-storage model

et al. 2010

View full text Add to dashboard Cite

The noisy-storage model allows the implementation of secure two-party protocols under the sole assumption that no large-scale reliable quantum storage is available to the cheating party. No quantum storage is thereby required for the honest parties. Examples of such protocols include bit commitment, oblivious transfer, and secure identification. Here, we provide a guideline for the practical implementation of such protocols. In particular, we analyze security in a practical setting where the honest parties themselves are unable to perform perfect operations and need to deal with practical problems such as errors during transmission and detector inefficiencies. We provide explicit security parameters for two different experimental setups using weak coherent, and parametric down-conversion sources. In addition, we analyze a modification of the protocols based on decoy states.

show abstract

E-Business@Print

Cited by 4 publications

References 0 publications

Using postmeasurement information in state discrimination

Using postmeasurement information in state discrimination

Simple protocols for oblivious transfer and secure identification in the noisy-quantum-storage model

Implementation of two-party protocols in the noisy-storage model

Contact Info

Product

Resources

About