Learn More
  • R Feynman, Quan, +23 authors U Vazi-Rani
  • 1994
Are there interactive protocols for co-NP languages? " Inform. book contains reprints of the articles that were critical in the development of the fastest known factoring algorithm. A rigorous time bound for factoring integers, " J. Amer. Math. Soc. An improved algorithm for computing discrete logarithms over GF(p) and its cryptographic significance, " IEEE(More)
In loving memory of Asher Peres, we discuss a most important and influential paper written in 1935 by his thesis supervisor and men-tor Nathan Rosen, together with Albert Einstein and Boris Podolsky. In that paper, the trio known as EPR questioned the completeness of quantum mechanics. The authors argued that the then-new theory should not be considered(More)
An unknown quantum state ji can be disassembled into, then later reconstructed from, purely classical information and purely nonclassical EPR correlations. To do so the sender, \Alice," and the receiver, \Bob," must prearrange the sharing of an EPR-correlated pair of particles. Alice makes a joint measurement on her EPR particle and the unknown quantum(More)
Consider a Boolean function χ : X → {0, 1} that partitions set X between its good and bad elements, where x is good if χ(x) = 1 and bad otherwise. Consider also a quantum algorithm A such that A|0 = x∈X αx|x is a quantum superposition of the elements of X, and let a denote the probability that a good element is produced if A|0 is measured. If we repeat the(More)
~ This paper provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard and Robert [l] for a special scenario. The results have applications to unconditionally-secure secret-key agreement protocols , quantum cryptography and to a non-asymptotic and constructive treatment of the secrecy capacity of(More)
Recently a great deal of attention has been focused on quantum computation following a sequence of results [Bernstein and Vazirani, in Proc. suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the extraction of discrete logarithms are both solvable in quantum polynomial time,(More)
Protocols are given for allowing a " prover " to convince a " verifier " that the prover knows some verifiable secret information, without allowing the verifier to learn anything about the secret. The secret can be probabilistically or deterministically verifiable, and only one of the prover or the verifier need have constrained resources. This paper(More)
We describe results from an apparatus and protocol designed to implement quantum key distribution, by which two users, who share no secret information initially: (1) exchange a random quantum transmission, consisting of very faint flashes of polarized light; (2) by subsequent public discussion of the sent and received versions of this transmission estimate(More)