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.
Partially supported by the US Air-Force, Israel Science Foundation (grant number 428/11), and Rita Altura Trust Chair in Computer Sciences.
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
References
Ben-OR, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC, pp. 1–10 (1988)
Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In: FOCS, pp. 383–395 (1985)
Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11–19 (1988)
Dolev, S., Garay, J., Gilboa, N., Kolesnikov, V.: Swarming secrets. In: 47th Annual Allerton Conference on Communication, Control, and Computing (2009)
Dolev, S., Lahiani, L., Yung, M.: Secret Swarm Unit Reactive k-Secret Sharing. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 123–137. Springer, Heidelberg (2007)
Dolev, S., Garay, J., Gilboa, N., Kolesnikov, V.: Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation. In: Innovations in Computer Science (ICS) (January 2011); Also Private and Parennial Distributed Computation. In: Workshop on Cryptography and Security in Clouds (CSC) (2011)
Gentry, C.: Fully Homomorphic Encryption Using Ideal Lattices. In: STOC, pp. 169–178 (2009)
Higgins, F., Tomlinson, A., Martin, K.: Survey on Security Challenges for Swarm Robotics. In: ICAS 2009, pp. 307–312 (2009)
Krohn, K.R., Rhodes, J.L.: Algebraic theory of machines (1962)
Krohn, K.R., Rhodes, J.L.: Algebraic theory of machines i: prime decomposition theorems for finite semigroups and machines. Transactions of the American Mathematical Society 116, 450–464 (1965)
Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)
Weiser, M.: The Computer for the 21th Century. Scientific American (September 1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dolev, S. (2012). Dynamic Multi-party Computation Forever for Swarm and Cloud Computing and Code Obfuscation. In: Erlebach, T., Nikoletseas, S., Orponen, P. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2011. Lecture Notes in Computer Science, vol 7111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28209-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-28209-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28208-9
Online ISBN: 978-3-642-28209-6
eBook Packages: Computer ScienceComputer Science (R0)