Secure protocols with asymmetric trust

Authors:
Ivan Damgård;Yvo Desmedt;Matthias Fitzi;Jesper Buus Nielsen
Affiliations:
Aarhus University, Dept. of Computer Science, Aarhus N, Denmark;University College London, Dept. of Computer Science, London, United Kingdom;ETH Zürich, Dept. of Computer Science, Zürich, Switzerland;Aarhus University, Dept. of Computer Science, Aarhus N, Denmark
Venue:
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Year:
2007

Citing 16
Cited 1

Limits on the security of coin flips when half the processors are faulty

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Unconditional Byzantine agreement with good majority

STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
How to share a secret

Communications of the ACM
Universally composable two-party and multi-party secure computation

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Detectable byzantine agreement secure against faulty majorities

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Universally Composable Protocols with Relaxed Set-Up Assumptions

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Verifiable secret sharing and achieving simultaneity in the presence of faults

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Efficient multiparty computations secure against an adaptive adversary

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Secure multi-party computation made simple

SCN'02 Proceedings of the 3rd international conference on Security in communication networks

Heterogeneous secure multi-party computation

IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We introduce a more general model, the asymmetric-trust model, wherein every party is allowed to trust in a different, personally customized adversary structure. We have two main contributions. First, we present non-trivial lower and upper bounds for broadcast, verifiable secret sharing, and general multi-party computation in different variations of this new model. The obtained bounds demonstrate that the new model is strictly more powerful than the standard general-adversary model. Second, we propose a framework for expressing and analyzing asymmetric trust in the usual simulation paradigm for defining security of protocols, and in particular show a general composition theorem for protocols with asymmetric trust.