Variable-bias coin tossing

Colbeck, Roger; Kent, Adrian

doi:10.1103/physreva.73.032320

Cited by 30 publications

(51 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, if they do, there is a non-zero probability that the other will detect their cheating' [8]. When the probability of detecting the cheating is one, the protocol may also be referred to as cheat-evident [5]. The security of our protocol is cheat-sensitive, as is rigorously described and quantified in the following claim.…”

Section: Protocol and Securitymentioning

confidence: 77%

Blind Quantum Computation

Arrighi

Salvail

2006

Int. J. Quantum Inform.

128

122

View full text Add to dashboard Cite

We investigate the possibility of having someone carry out the work of executing a function for you, but without letting him learn anything about your input. Say Alice wants Bob to compute some known function f upon her input x, but wants to prevent Bob from learning anything about x. The situation arises for instance if client Alice has limited computational resources in comparison with mistrusted server Bob, or if x is an inherently mobile piece of data. Could there be a protocol whereby Bob is forced to compute ,f(x)blindly, i.e. without observing x? We provide such a blind computation protocol for the class of functions which admit an efficient procedure to generate random input–output pairs, e.g. factorization. The cheat-sensitive security achieved relies only upon quantum theory being true. The security analysis carried out assumes the eavesdropper performs individual attacks.

show abstract

Section: Protocol and Securitymentioning

confidence: 77%

Blind Quantum Computation

Arrighi

Salvail

2006

Int. J. Quantum Inform.

128

122

View full text Add to dashboard Cite

show abstract

“…One crypto-task that requires a conjunction of both properties of relativity and quantum mechanics is variable-bias coin toss [301], in which a random bit is shared by flipping a coin whose bias, within a predetermined range, is covertly fixed by one of the players, while the other player only learns the random outcome bit of the toss. While one player is able to influence the outcome, the other can save face by attributing a negative outcome to bad luck.…”

Section: Relativistic Quantum Cryptographymentioning

confidence: 99%

Quantum Cryptography: Key Distribution and Beyond

Pathak

Srikanth

2017

Quanta

View full text Add to dashboard Cite

show abstract

“…We also discuss two further protocols which are conjectured to be unconditionally secure for any bias. Most of the work covered by this chapter has appeared in [2].…”

Section: Variable Bias Coin Tossingmentioning

confidence: 99%

“…1 The view of one party is their complete set of quantum states and classical values. 2 The ideals we give are phrased for general computations, but can easily be specialized to the single-function case.…”

Section: Definition 42 (Universally Composable Security)mentioning

confidence: 99%

Quantum Randomness

Aaronson¹

2014

Amer. Scientist

View full text Add to dashboard Cite

DeclarationThis thesis is the result of my own work and includes nothing which is the outcome of work done in collaboration with others, except where specifically indicated in the text.To my parents, Lorelei and John. 5689@AB7BA@9865 AcknowledgementsThe work comprising this thesis was carried out over the course of three years at the Centre For Quantum Computation, DAMTP, Cambridge, under the supervision of Adrian Kent. I am indebted to him for support and guidance. Discussions with Adrian are always a pleasure and his eagerness to find loopholes in any new proposal is second to none. His clear thinking and attention to detail have had huge impact on my work, and indeed my philosophy towards research.It is with great pleasure that I thank the members of the quantum information group for an enjoyable three years. Particular thanks go to Matthias Christandl, Robert König, Graeme Mitchison and Renato Renner for numerous useful discussions from which my work has undoubtedly benefited, and to Jiannis Pachos for his constant encouragement and support.My two office co-inhabitants deserve special mention here, not least for putting up with me! Alastair Kay for withstanding (and almost always answering) a battering of questions on forgotten physics, L A T E X, linux and much more besides, and Roberta Rodriquez for providing unrelenting emotional support on all matters from physics to life itself. I am very grateful to the Engineering and Physical Sciences ResearchCouncil for a research studentship and to Trinity College, Cambridge for a research scholarship and travel money. A junior research fellowship from Homerton College, Cambridge has provided financial support during the final stages of writing this thesis.Finally I would like to thank my examiners Robert Spekkens and Andreas Winter for their thorough analysis of this thesis. AbstractSecure multi-party computation is a task whereby mistrustful parties attempt to compute some joint function of their private data in such a way as to reveal as little as possible about it. It encompasses many cryptographic primitives, including coin tossing and oblivious transfer. Ideally, one would like to generate either a protocol or a no-go theorem for any such task.Very few computations of this kind are known to be possible with unconditional security. However, relatively little investigation into exploiting the cryptographic power of a relativistic theory has been carried out. In this thesis, we extend the range of known results regarding secure multi-party computations. We focus on two-party computations, and consider protocols whose security is guaranteed by the laws of physics. Specifically, the properties of quantum systems, and the impossibility of faster-than-light signalling will be used to guarantee security.After a general introduction, the thesis is divided into four parts. In the first, we discuss the task of coin tossing, principally in order to highlight the effect different physical theories have on security in a straightforward manner, but, also, to introduce a new...

show abstract

Variable-bias coin tossing

Cited by 30 publications

References 25 publications

Blind Quantum Computation

Blind Quantum Computation

Quantum Cryptography: Key Distribution and Beyond

Quantum Randomness

Contact Info

Product

Resources

About