-
1
-
-
0005033357
-
-
University of California, Berkeley, CA
-
Blum, Manuel. “Three applications of the oblivious transfer: Part I: Coin flipping by telephone; Part II: How to exchange secrets; Part III: How to send certified electronic mail”, Department of EECS, University of California, Berkeley, CA, 1981.
-
(1981)
Three Applications of the Oblivious Transfer: Part I: Coin Flipping by Telephone; Part II: How to Exchange Secrets; Part III: How to Send Certified Electronic Mail, Department of EECS
-
-
Blum, M.1
-
2
-
-
84910735846
-
-
(revised versíon), Technical Report PM-R8710, Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands
-
Brassard, Gilles, David Chaum, and Claude Crépeau. “Minimum disclosure proofs of knowledge” (revised versíon), Technical Report PM-R8710, Centre for Mathematics and Computer Science (CWI), Amsterdam, The Netherlands, 1987.
-
(1987)
Minimum Disclosure Proofs of Knowledge
-
-
Brassard, G.1
Chaum, D.2
Crépeau, C.3
-
4
-
-
0022864717
-
Information Theoretic Reductions Among Disclosure Problems
-
Brassard, Gilles, Claude Crépeau, and Jean-Marc Robert. “Information Theoretic Reductions Among Disclosure Problems,” Proceedings of the 27th FOCS, IEEE, 1986, 168-173.
-
(1986)
Proceedings of the 27Th FOCS, IEEE
, pp. 168-173
-
-
Brassard, G.1
Crépeau, C.2
Robert, J.-M.3
-
5
-
-
85031785922
-
Equivalence Between Two Flavours of Oblivious Transfer
-
Springer-Verlag
-
Crépeau Claude, “Equivalence Between Two Flavours of Oblivious Transfer”, Proceedings of Crypto 87, 1988, Springer-Verlag.
-
(1988)
Proceedings of Crypto 87
-
-
Claude, C.1
-
6
-
-
84864708144
-
Multiparty computations ensuring privacy of each partys input and correctness of the result”
-
Chaum David, Ivan Damgård, and Jeroen Van de Graaf, “Multiparty computations ensuring privacy of each party’s input and correctness of the result”, Advances in Cryptology CRYPTO’87 Proceedings, Springer-Verlag, 1988, 87-119.
-
(1988)
Advances in Cryptology CRYPTO’87 Proceedings, Springer-Verlag
, pp. 87-119
-
-
David, C.1
Damgård, I.2
Graaf, J.V.D.3
-
7
-
-
0023545076
-
How to play any mental game, or: A completeness theorem for protocols with honest majority
-
Goldreich, Oded, Silvio Micali, and Avi Wigderson. “How to play any mental game, or: A completeness theorem for protocols with honest majority”, Proceedings of the 19th ACM Symposium on Theory of Computing, 1987, 218-229.
-
(1987)
Proceedings of the 19Th ACM Symposium on Theory of Computing
, pp. 218-229
-
-
Goldreich, O.1
Micali, S.2
Wigderson, A.3
-
10
-
-
0020889143
-
How to Simultaneously Exchange a Secret Bit by flipping Assymetrically Biased coins
-
Micali, Silvio, Charles Rackoff, Mike Luby, “How to Simultaneously Exchange a Secret Bit by flipping Assymetrically Biased coins”, Proceedings of the 24th FOCS, IEEE, 1983, 11-21.
-
(1983)
Proceedings of the 24Th FOCS, IEEE
, pp. 11-21
-
-
Micali, S.1
Rackoff, C.2
Luby, M.3
-
11
-
-
0003462641
-
-
Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University
-
Rabin, Michael, “How to exchange secrets by oblivious transfer,” Tech. Memo TR-81, Aiken Computation Laboratory, Harvard University, 1981.
-
(1981)
How to Exchange Secrets by Oblivious Transfer
-
-
Rabin, M.1
|