Result 101 to 120 of 127 total
On Byzantine agreement over $(2,3)$-uniform hypergraphs. (English)
Guerraoui, Rachid (ed.), Distributed computing. 18th international conference, DISC 2004, Amsterdam, The Netherlands, October 4‒7, 2004. Proceedings. Berlin: Springer (ISBN 3-540-23306-7/pbk). Lecture Notes in Computer Science 3274, 450-464 (2004).
101
On byzantine agreement over (2, 3)-uniform hypergraphs (English)
DISC, 450-464 (2004).
102
Brief announcement: on the round complexity of distributed consensus over synchronous networks (English)
PODC, 397 (2004).
103
Optimal perfectly secure message transmission (English)
CRYPTO, 545-561 (2004).
104
On the power of computational secret sharing. (English)
Johansson, Thomas (ed.) et al., Progress in cryptology ‒ INDOCRYPT 2003. 4th international conference on cryptology in India, New Delhi, India, December 8‒10, 2003. Proceedings. Berlin: Springer (ISBN 3-540-20609-4/pbk). Lect. Notes Comput. Sci. 2904, 162-176 (2003).
105
Trading players for efficiency in unconditional multiparty computation. (English)
Cimato, Stelvio (ed.) et al., Security in communication networks. Third international conference, SCN 2002, Amalfi, Italy, September 11-13, 2002. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2576, 342-353 (2003).
106
Distributed consensus in the presence of sectional faults (English)
PODC, 202-210 (2003).
107
Brief announcement: efficient perfectly secure communication over synchronous networks (English)
PODC, 252 (2003).
108
On the power of computational secret sharing (English)
INDOCRYPT, 162-176 (2003).
109
Theory of equal-flows in networks. (English)
Ibarra, Oscar H. (ed.) et al., Computing and combinatorics. 8th annual international conference, COCOON 2002, Singapore, August 15‒17, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43996-X). Lect. Notes Comput. Sci. 2387, 514-524 (2002).
110
Non-perfect secret sharing over general access structures. (English)
Menezes, Alfred (ed.) et al., Progress in cryptology ‒ INDOCRYPT 2002. Third international conference on cryptology in India, Hyderabad, India, December 16‒18, 2002. Proceedings. Berlin: Springer (ISBN 3-540-00263-4/pbk). Lect. Notes Comput. Sci. 2551, 409-421 (2002).
111
Asynchronous unconditionally secure computation: An efficiency improvement. (English)
Menezes, Alfred (ed.) et al., Progress in cryptology ‒ INDOCRYPT 2002. Third international conference on cryptology in India, Hyderabad, India, December 16‒18, 2002. Proceedings. Berlin: Springer (ISBN 3-540-00263-4/pbk). Lect. Notes Comput. Sci. 2551, 93-107 (2002).
112
Asynchronous perfectly secure computation tolerating generalized adversaries. (English)
Batten, Lynn (ed.) et al., Information security and privacy. 7th Australasian conference, ACISP 2002, Melbourne, Australia, July 3-5, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2384, 497-511 (2002).
113
Asynchronous secure communication tolerating mixed adversaries. (English)
Zheng, Yuliang (ed.), Advances in cryptology - ASIACRYPT 2002. 8th international conference on the theory and application of cryptology and information security, Queenstown, New Zealand, December 1‒5, 2002. Proceedings. Berlin: Springer (ISBN 3-540-00171-9). Lect. Notes Comput. Sci. 2501, 224-242 (2002).
114
Asynchronous perfectly secure computation tolerating generalized adversaries (English)
ACISP, 497-512 (2002).
115
Trading players for efficiency in unconditional multiparty computation (English)
SCN, 342-353 (2002).
116
Asynchronous secure communication tolerating mixed adversaries (English)
ASIACRYPT, 224-242 (2002).
117
On perfectly secure cmmunication over arbitrary networks (English)
PODC, 193-202 (2002).
118
Theory of equal-flows in networks (English)
COCOON, 514-524 (2002).
119
Asynchronous unconditionally secure computation: an efficiency improvement (English)
INDOCRYPT, 93-107 (2002).
120
Result 101 to 120 of 127 total
Start
Contact
Print
General Help
