Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Some ideal secret sharing schemes
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Communications of the ACM
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks
Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Asynchronous Multiparty Computation: Theory and Implementation
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
IEEE Internet Computing
General secure multi-party computation from any linear secret-sharing scheme
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Secure protocols with asymmetric trust
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
SEPIA: privacy-preserving aggregation of multi-domain network events and statistics
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Cloud4Home -- Enhancing Data Services with @Home Clouds
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Harnessing the Cloud for Securely Solving Large-Scale Systems of Linear Equations
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Hi-index | 0.00 |
The increased processing power and storage capacity of inhome and mobile computing devices has motivated their inclusion in distributed and cloud computing systems. The resulting diverse environment creates a strong requirement for secure computations, which can be realised by Secure Multi-Party Computation (MPC). However, MPC most commonly assumes that parties performing the secure computation have the same characteristics and evenly distributes the computation load. In a heterogeneous environment, MPC using the same approach would result in poor performance. In this paper, we propose a mechanism for MPC share distribution in such an environment and present an analysis of the gain in robustness and the corresponding computational and communication complexity. Our results show that the uneven share distribution is a worthwhile approach in diverse computing systems.