Sciweavers

7486 search results - page 17 / 1498
» The Limits of Quantum Computers
Sort
View
CORR
2010
Springer
225views Education» more  CORR 2010»
13 years 7 months ago
Analysis of the Security of BB84 by Model Checking
Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols. When it was note...
Mohamed Elboukhari, Mostafa Azizi, Abdelmalek Aziz...
FOCS
1999
IEEE
13 years 12 months ago
PSPACE Has Constant-Round Quantum Interactive Proof Systems
In this paper we introduce quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange qu...
John Watrous
EUROCRYPT
2000
Springer
13 years 11 months ago
Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
Paul Dumais, Dominic Mayers, Louis Salvail
STOC
2002
ACM
130views Algorithms» more  STOC 2002»
14 years 7 months ago
Secure multi-party quantum computation
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation...
Claude Crépeau, Daniel Gottesman, Adam Smit...
ENTCS
2011
131views more  ENTCS 2011»
13 years 2 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
Ed Blakey