|
520
|
Quantum cryptography: Public key distribution and coin tossing
– C H Bennett, G Brassard
- 1984
|
|
66
|
Practical Quantum Oblivious Transfer
– Charles Bennett, Gilles Brassard
- 1992
|
|
162
|
Privacy amplification by public discussion
– C H Bennett, G Brassard, J-M Robert
- 1988
|
|
35
|
Quantum Bit Commitment and Coin Tossing Protocols
– Gilles Brassard
- 1991
|
|
70
|
Quantum cryptography without Bell’s theorem
– C H Bennett, G Brassard, N D Mermin
- 1992
|
|
179
|
Elementary Gates for Quantum Computation
– Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John Smolin, Harald Weinfurter
- 1995
|
|
264
|
Minimum Disclosure Proofs of Knowledge
– G Brassard, D Chaum, C Crépeau
- 1988
|
|
40
|
Quantum cryptography, or unforgeable subway tokens
– Charles H Bennett, Gilles Brassard, S Breidbart, Stephen J Wiesner
- 1982
|
|
284
|
New Hash Functions and their Use in Authentication and Set Equality
– M N Wegman, J L Carter
- 1981
|
|
98
|
Achieving Oblivious Transfer Using Weakened Security Assumptions (Extended Abstract)
– Claude Crépeau, Joe Kilian
- 1988
|
|
1606
|
The Theory of Error Correcting Codes
– F J MacWilliams, N J A Sloane
- 1986
|
|
221
|
Broadcast Channels with Confidential Messages
– I Csiszar, J Korner
- 1978
|
|
312
|
Rapid solutions of problems by quantum computation
– D Deutsch, R Jozsa
- 1992
|
|
2292
|
New Directions in Cryptography
– Whitfield Diffie, Martin E. Hellman
- 1976
|
|
713
|
Algorithms for Quantum Computation: Discrete Logarithms and Factoring
– Peter W. Shor
- 1994
|
|
756
|
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
– Peter W. Shor
- 1997
|
|
584
|
Quantum theory, the Church-Turing principle and the universal quantum computer
– David Deutsch
- 1985
|
|
407
|
A randomized protocol for signing contracts
– S Even, O Goldreich, A Lempel
- 1985
|
|
258
|
How to exchange secrets by oblivious transfer
– M Rabin
- 1981
|
