Dynamic multi-party computation forever for swarm and cloud computing and code obfuscation

Authors:
Shlomi Dolev
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel
Venue:
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Year:
2011

Citing 8
Cited 0

Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
How to share a secret

Communications of the ACM
Verifiable secret sharing and achieving simultaneity in the presence of faults

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Fully homomorphic encryption using ideal lattices

Proceedings of the forty-first annual ACM symposium on Theory of computing
Survey on Security Challenges for Swarm Robotics

ICAS '09 Proceedings of the 2009 Fifth International Conference on Autonomic and Autonomous Systems
Secret swarm unit: reactive k-secret sharing

INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Swarming secrets

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Intuitive and Basic Description of Secure Multi-party Computation. Secure multi-party computation [1,3] schemes allow participants to calculate a function of their inputs, such that the inputs of the participants are not revealed to each other.