Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation

Authors:
K. Srinathan;C. Pandu Rangan
Affiliations:
-;-
Venue:
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Year:
2000

Citing 7
Cited 0

Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
How to withstand mobile virus attacks (extended abstract)

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
How to share a secret

Communications of the ACM
Efficient Byzantine Agreement Secure Against General Adversaries

DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

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.