Abstract
We study a distributed adversarial model of computation in which the faults are non-stationary and can move through the network (like viruses) as well as non-threshold (there is no specific bound on the number of corrupted players at any given time). We show how to construct multiparty protocols that are perfectly secure against such generalized mobile adversaries. The key element in our solution is devising non-threshold proactive verifiable secret sharing schemes that generalize the secret sharing schemes known in the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Akers and T. Robbins. Logical design with three-input majority gates. Computer Design, pp. 12–27, March 1963. 133
M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In 20th ACM STOC, pp. 1–10, 1988. 131, 141
M. Fitzi. Erweiterte zugriffstrukturen in multiparty computation, 1996. Student’s Project. 133
M. Fitzi and U. Maurer. Efficient Byzantine agreement secure against general adversaries. In DISC’ 98, vol. 1499 of LNCS, pp. 134–148. Springer-Verlag, 1998. 131
R. Gennaro, M. O. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In 17th ACM PODC, 1998. 141
A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung. Proactive secret sharing. In CRYPTO 95, vol. 963 of LNCS, pp. 339–352. Springer-Verlag, 1995. 135
M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multiparty computation. In 16th ACM PODC, pp. 25–34, August 1997. 131, 133, 141
M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31–60, April 2000. 131, 133, 133, 141, 141, 141
R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In 10th ACM PODC, pp. 51–61, 1991. 135, 141
A. Shamir. How to share a secret. CACM, 22:612–613, 1979. 133
K. Srinathan and C. Pandu Rangan. Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation. Technical Report, Dept. CSE, Indian Institute of Technology, Madras, August 2000. 135, 136
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Srinathan, K., Pandu Rangan, C. (2000). Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation. In: Roy, B., Okamoto, E. (eds) Progress in Cryptology —INDOCRYPT 2000. INDOCRYPT 2000. Lecture Notes in Computer Science, vol 1977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44495-5_12
Download citation
DOI: https://doi.org/10.1007/3-540-44495-5_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41452-0
Online ISBN: 978-3-540-44495-4
eBook Packages: Springer Book Archive