Abstract
We study the problem of secure communication tolerating generalized mixed adversaries across an underlying completely asynchronous incomplete network. We explore the interplay between the minimal network connectivity required and the degree of security attainable, and completely characterize the network requirements for attaining perfect and unconditional (with negligible error) security. We also consider networks with additional broadcast capabilities and prove that unconditionally secure communication can be achieved with much lesser connectivity if the network assures the broadcast primitive.
Financial support from Infosys Technologies Limited, India, is acknowledged.
Partially supported by DRDO collaborative project on Communication and Networking Technologies.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Beimel and Y. Ishai. On the power of nonlinear secret sharing. In 16th Annual IEEE Structure in Complexity Theory, pages 188–202, 2001.
M. Ben-Or, R. Canetti, and O. Goldreich. Asynchronous secure computations. In 25th ACM STOC, pages 52–61, 1993.
M. Ben-Or, B. Kelmer, and T. Rabin. Asynchronous secure computation with optimal resilience. In 13th ACM PODC, pages 183–192, 1994.
C. Blundo and D. R. Stinson. Anonymous secret sharing schemes. Discrete Applied Mathematics, 77:13–28, 1997.
D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. JACM, volume 40, number 1, pages 17–47, 1993.
M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty process. JACM, volume 32, number 2, pages 374–382, 1985.
M. Fitzi, M. Hirt, and U. Maurer. General adversaries in unconditional multiparty computation. In ASIACRYPT’99, volume 1716 of LNCS. Springer-Verlag, 1999.
M. Franklin and R. N. Wright. Secure communication in minimal connectivity models. Journal of Cryptology, 13(1):9–30, 2000.
M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31–60, April 2000. Preliminary version appeared in 16th ACM PODC, pages 25-34, August 1997.
M. Ito, A. Saito, and T. Nishizeki. Secret sharing scheme realizing general access structure. In IEEE Globecom 87, pages 99–102. IEEE, 1987.
M. Karchmer and A. Wigderson. On span programs. In 8th IEEE Structure in Complexity Theory, pages 102–111, 1993.
M.V.N. Ashwin Kumar, P.R. Goundan, K. Srinathan, and C.P. Rangan. On perfectly secure communication over arbitrary networks. In 21st ACM PODC, 2002.
H. Sayeed and H. Abu-Amara. Perfectly secure message transmission in asynchronous networks. In 7th IEEE Symposium on Parallel and Distributed Processing, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Srinathan, K., Kumar, M.V.N.A., Rangan, C.P. (2002). Asynchronous Secure Communication Tolerating Mixed Adversaries. In: Zheng, Y. (eds) Advances in Cryptology — ASIACRYPT 2002. ASIACRYPT 2002. Lecture Notes in Computer Science, vol 2501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36178-2_14
Download citation
DOI: https://doi.org/10.1007/3-540-36178-2_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00171-3
Online ISBN: 978-3-540-36178-7
eBook Packages: Springer Book Archive