Quantum And Relativistic Protocols For Secure Multi-Party Computation

摘要: After a general introduction, the thesis is divided into four parts. In first, we discuss task of coin tossing, principally in order to highlight effect different physical theories have on security straightforward manner, but, also, introduce new protocol for non-relativistic strong tossing. This matches best known date while using conceptually approach achieve task. In second part variable bias tossing introduced. variant which one party secretly chooses two biased coins toss. It shown that this can be achieved with unconditional specified range biases, and cheat-evident any bias. We also further protocols are conjectured unconditionally secure The third section looks at other two-party computations which, prior our work, no-go theorems were unknown. model such computations, show that, within model, wide functions impossible compute securely. give explicit cheating attacks functions. final chapter expanding private random string, dropping usual assumption protocol's user trusts her devices. Instead assume all quantum devices supplied by an arbitrarily malicious adversary. conjecture securely perform The first allows string expanded finite amount, generates large expansion string.