Abstract
In the problem of private “swarm” computing, n agents wish to securely and distributively perform a computation on common inputs, in such a way that even if the entire memory contents of some of them are exposed, no information is revealed about the state of the computation. Recently, Dolev, Garay, Gilboa and Kolesnikov [ICS 2011] considered this problem in the setting of information-theoretic security, showing how to perform such computations on input streams of unbounded length. The cost of their solution, however, is exponential in the size of the Finite State Automaton (FSA) computing the function.
In this work we are interested in efficient (i.e., polynomial time) computation in the above model, at the expense of minimal additional assumptions. Relying on the existence of one-way functions, we show how to process unbounded inputs (but of course, polynomial in the security parameter) at a cost linear in m, the number of FSA states. In particular, our algorithms achieve the following:
-
In the case of (n,n)-reconstruction (i.e., in which all n agents participate in the reconstruction of the distributed computation) and at most n − 1 agents are corrupted, the agent storage, the time required to process each input symbol, and the time complexity for reconstruction are all O(mn).
-
In the case of (n − t,n)-reconstruction (where only n − t agents take part in the reconstruction) and at most t agents are corrupted, the agents’ storage and time required to process each input symbol are \(O(m{n-1 \choose n-t})\). The complexity of reconstruction is O(mt).
We achieve the above through a carefully orchestrated use of pseudo-random generators and secret-sharing, and in particular a novel share re-randomization technique which might be of independent interest.
This research has been supported by the Israeli Ministry of Science and Technology (MOST), the Institute for Future Defense Technologies Research named for the Medvedi, Shwartzman and Gensler Families, the Israel Internet Association (ISOC-IL), the Lynne and William Frankel Center for Computer Science at Ben-Gurion University, Rita Altura Trust Chair in Computer Science, Israel Science Foundation (grant number 428/11), Cabarnit Cyber Security MAGNET Consortium, MAFAT and Deutsche Telekom Labs at BGU.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ben-Shahar, O., Dolev, S., Dolgin, A., Segal, M.: Direction Election in Flocking Swarms. In: Proc. of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, pp. 73–80 (2010)
Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. 20th STOC, pp. 1–10 (1988)
Bamberger Jr., R., Watson, D., Scheidt, D., Moore, K.: Flight Demonstrations of Unmanned Aerial Vehicle Swarming Concepts. Johns Hopkins APL Technical Digest 27(1), 41–55 (2006)
Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: Proc. 20th STOC, pp. 11–19 (1988)
Cramer, R., Damgård, I., Ishai, Y.: Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 342–362. Springer, Heidelberg (2005)
Dolev, S., Gilboa, N., Kopeetsky, M., Persiano, G., Spirakis, P.: Information Security for Sensors by Overwhelming Random Sequences and Permutations. In: Proc. of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing (2010)
Dolev, S., Garay, J., Gilboa, N., Kolesnikov, V.: Swarming Secrets. In: 47th Annual Allerton Conference on Communication, Control, and Computing (2009)
Dolev, S., Garay, J., Gilboa, N., Kolesnikov, V.: Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation. In: Innovations in Computer Science (ICS), pp. 32–44 (2011)
Dolev, S., Garay, J., Gilboa, N., Kolesnikov, V., Yuditsky, Y.: Towards Efficient Private Distributed Computation on Unbounded Input Streams, Cryptology ePrint Archive, Report 2013/220
Dolev, S., Kopeetsky, M., Shamir, A.: RFID Authentication Efficient Proactive Information Security within Computational Security. Theory Comput. Syst. 48(1), 132–149 (2011)
Dolev, S., Lahiani, L., Yung, M.: Secret Swarm Unit Reactive k-Secret Sharing. Ad Hoc Networks 10(7), 1291–1305 (2012)
Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proc. 41st STOC, pp. 169–178 (2009)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Proc. 19th STOC, pp. 218–229 (1987)
Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press (2000)
Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)
Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: Proc. of the 7th ACM conference on Computer and Communications Security (CCS), pp. 245–254 (2000)
Shamir, A.: How to Share a Secret. Communications of the ACM 22(11), 612–613 (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dolev, S., Garay, J., Gilboa, N., Kolesnikov, V., Yuditsky, Y. (2013). Towards Efficient Private Distributed Computation on Unbounded Input Streams. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds) Applied Cryptography and Network Security. ACNS 2013. Lecture Notes in Computer Science, vol 7954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38980-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-38980-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38979-5
Online ISBN: 978-3-642-38980-1
eBook Packages: Computer ScienceComputer Science (R0)