MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Dominic Mayers" – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 14 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • The Trouble with Quantum Bit Commitment  
  • by Dominic Mayers — 1999 — Computing Research Repository (CoRR
  • …In a recent paper, Lo and Chau explain how to break a family of quantum bit commitment schemes, and they claim that their attack applies to the 1993 protocol of Brassard, Cr'epeau, Jozsa and Langlois (BCJL). The intuition behind their attack is correct, and indeed they expose a weakness common t…
  • Cited by 9 (1 self)Add To MetaCart
  • On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols  
  • by Dominic Mayers — 1995 — Advances in Cryptology --- Proceedings of Crypto '95
  • …. No quantum key distribution (QKD) protocol has been proved fully secure. A remaining problem is the eavesdropper's ability to make coherent measurements on the joint properties of large composite systems. This problem has been recently solved by Yao in the case of the security of a quantum oblivio…
  • Cited by 9 (3 self)Add To MetaCart
  • Quantum Oblivious Transfer is Secure Against Individual Measurements  
  • by Dominic Mayers, Louis Salvail — 1994 — Proceedings of the Third Workshop on Physics and Computation --- PhysComp '94
  • …. In this paper we show that the BBCS-protocol implementing one of the most important cryptographic primitives oblivious transfer, is secure against any individual measurement allowed by quantum mechanics. We analyze the common situation where successive measurements on the same photon could be used…
  • Cited by 12 (8 self)Add To MetaCart
  • The Security of Quantum Bit Commitment Schemes  
  • by Gilles Brassard, Claude Crepeau, Dominic Mayers, Louis Salvail
  • …Can quantum mechanics be harnessed to provide unconditionally secure bit commitment schemes and other cryptographic primitives beyond key distribution? We review the general impossibility proof of Mayers and illustrate it by showing how to break some recent attempts to bypass it. In particular, s…
  • Cited by 1 (0 self)Add To MetaCart
  • Computational Collapse of Quantum State with Application to Oblivious Transfer  
  • by Claude Crépeau, Paul Dumais, Dominic Mayers, Louis Salvail — 2004 — IN ADVANCES IN CRYPTOLOGY – TCC 04, LECTURE NOTES IN COMPUTER SCIENCE
  • … Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2 quantum oblivious transfer. This reduction proposed by Crépeau and Kilian was proved secure against any receiver by Yao, …
  • Cited by 3 (0 self)Add To MetaCart
  • Defeating Classical Bit Commitments With a Quantum Computer  
  • by Gilles Brassard, Claude Crépeau , Dominic Mayers, Louis Salvail — 1998
  • …It has been recently shown by Mayers that no bit commitment is secure if the participants have unlimited computational power and technology. However it was noticed that a secure protocol could be obtained by forcing the cheater to execute a measurement. Similar situations had been encountered previo…
  • Cited by 7 (2 self)Add To MetaCart
  • A brief review on the impossibility of quantum bit commitment  
  • by Gilles Brassard, Claude Crépeau, Dominic Mayers, Louis Salvail — 1997
  • …The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the first time thirteen years ago. Bit commitment is sufficient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment…
  • Cited by 3 (2 self)Add To MetaCart
  • Self-testing of quantum circuits  
  • by Frédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier — 2006 — In Proceedings of 33rd ICALP, Lecture Notes in Computer Science
  • …Abstract. We prove that a quantum circuit together with measurement apparatuses and EPR sources can be self-tested, i.e. fully verified without any reference to some trusted set of quantum devices. To achieve our goal we define the notions of simulation and equivalence. Using these two concepts, we …
  • Cited by 2 (1 self)Add To MetaCart
  • PHYSICAL REVIEW A 69, 052326 (2004) Superselection rules and quantum protocols  
  • by Alexei Kitaev, Dominic Mayers, John Preskill — 2004
  • …We show that superselection rules do not enhance the information-theoretic security of quantum cryptographic protocols. Our analysis employs two quite different methods. The first method uses the concept of a reference system—in a world subject to a superselection rule, unrestricted operations can b…
  • Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB