• Information Technology
  • Human Resources
  • Careers
  • Giving
  • Library
  • Bookstore
  • Active Living
  • Continuing Education
  • Go Dinos
  • UCalgary Maps
  • UCalgary Directory
  • Academic Calendar
My UCalgary
Webmail
D2L
ARCHIBUS
IRISS
  • Faculty of Arts
  • Cumming School of Medicine
  • Faculty of Environmental Design
  • Faculty of Graduate Studies
  • Haskayne School of Business
  • Faculty of Kinesiology
  • Faculty of Law
  • Faculty of Nursing
  • Faculty of Nursing (Qatar)
  • Schulich School of Engineering
  • Faculty of Science
  • Faculty of Social Work
  • Faculty of Veterinary Medicine
  • Werklund School of Education
  • Information TechnologiesIT
  • Human ResourcesHR
  • Careers
  • Giving
  • Library
  • Bookstore
  • Active Living
  • Continuing Education
  • Go Dinos
  • UCalgary Maps
  • UCalgary Directory
  • Academic Calendar
  • Libraries and Cultural Resources
View Item 
  •   PRISM Home
  • Graduate Studies
  • The Vault: Electronic Theses and Dissertations
  • View Item
  •   PRISM Home
  • Graduate Studies
  • The Vault: Electronic Theses and Dissertations
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Point Games in Quantum Weak Coin Flipping Protocols

Thumbnail
Download
ucalgary_2013_pelchat_edouard.pdf (839.5Kb)
Advisor
Høyer, Peter
Author
Pelchat, Edouard
Accessioned
2013-08-16T17:38:33Z
Available
2013-11-12T08:00:11Z
Issued
2013-08-16
Submitted
2013
Other
quantum cryptography
secure two-party computation
coin flipping
weak
small bias
point games
binomials
Kitaev's formalism
Subject
Computer Science
Type
Thesis
Metadata
Show full item record

Abstract
Two parties, wishing to establish a shared random bit at a distance, must solve a problem known as coin flipping. Classical two-party secure computations such as coin flipping are impossible in the information theoretic setting. However quantum information allows for the possibility of unconditional security. Mochon defines a model of secure two-party computations, point games, to show the existence of optimal quantum weak coin flipping protocols in [29]. His ground-breaking result is widely accepted, but its proof is very complicated, has never been validated, and remains poorly understood despite the efforts of several researchers [12,25,35]. In this thesis we use analytical and mathematical methods to study point games. We discover several new primitives, and construct new building blocks to define a new family of point games. We present a new truncation technique that is simpler, more efficient, is more intuitive, and achieves better results than the best previously known. We provide concrete examples of these point games. We analyze Mochon's optimal point games, and we identify the key elements of their construction that are not specified. We also provide a new recursion technique that achieves better results than the one proposed by Mochon. Furthermore, we construct simple and elegant point games using binomial coefficients. Our point games are simpler than Mochon's, since his point games are constructed using techniques in mathematical analysis. Studying point games with new techniques may lead to a simpler formalism of two-party secure computations, and to more efficient protocols.
Corporate
University of Calgary
Faculty
Graduate Studies
Doi
http://dx.doi.org/10.11575/PRISM/27375
Uri
http://hdl.handle.net/11023/873
Collections
  • The Vault: Electronic Theses and Dissertations

Browse

All of PRISMCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors

  • Email
  • SMS
  • 403.220.8895
  • Live Chat

Energize: The Campaign for Eyes High

Privacy Policy
Website feedback

University of Calgary
2500 University Drive NW
Calgary, AB T2N 1N4
CANADA

Copyright © 2017