Cryptography Reference
In-Depth Information
2. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-
cryptographic fault-tolerant distributed computation. In: Proceedings of the Twen-
tieth Annual ACM Symposium on Theory of Computing - STOC 1988, pp. 1-10.
ACM, New York (1988)
3. Blundo, C., D'Arco, P., Santis, A.D., Stinson, D.R.: New results on unconditionally
secure distributed oblivious transfer. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002.
LNCS, vol. 2595, pp. 291-309. Springer, Heidelberg (2003)
4. Blundo, C., D'Arco, P., Santis, A.D., Stinson, D.R.: On unconditionally secure
distributed oblivious transfer. J. Cryptology 20(3), 323-373 (2007)
5. Brassard, G., Crepeau, C., Robert, J.M.: All-or-nothing disclosure of secrets. In:
Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 234-238. Springer, Hei-
delberg (1987)
6. Desmedt, Y.G., Jajodia, S.: Redistributing secret shares to new access structures
and its applications. Technical report, George Mason University (1997)
7. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts.
Communications of the ACM 28, 637-647 (1985)
8. Naor, M., Pinkas, B.: Distributed oblivious transfer. In: Okamoto, T. (ed.)
ASIACRYPT 2000. LNCS, vol. 1976, pp. 205-219. Springer, Heidelberg (2000)
9. Nikov, V., Nikova, S., Preneel, B., Vandewalle, J.: On unconditionally secure dis-
tributed oblivious transfer. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002.
LNCS, vol. 2551, pp. 395-408. Springer, Heidelberg (2002)
10. Rabin, M.O.: How to exchange secrets with oblivious transfer. Technical report,
Aiken Computation Lab, Harvard University (1981)
11. Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612-613
(1979)
Search WWH ::
Custom Search