Towards Efficient Private Distributed Computation on Unbounded Input Streams

(Extended Abstract)
  • Shlomi Dolev
  • Juan Garay
  • Niv Gilboa
  • Vladimir Kolesnikov
  • Yelena Yuditsky
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7954)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. 20th STOC, pp. 1–10 (1988)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: Proc. 20th STOC, pp. 11–19 (1988)Google Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Dolev, S., Garay, J., Gilboa, N., Kolesnikov, V.: Swarming Secrets. In: 47th Annual Allerton Conference on Communication, Control, and Computing (2009)Google Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Dolev, S., Garay, J., Gilboa, N., Kolesnikov, V., Yuditsky, Y.: Towards Efficient Private Distributed Computation on Unbounded Input Streams, Cryptology ePrint Archive, Report 2013/220Google Scholar
  10. 10.
    Dolev, S., Kopeetsky, M., Shamir, A.: RFID Authentication Efficient Proactive Information Security within Computational Security. Theory Comput. Syst. 48(1), 132–149 (2011)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Dolev, S., Lahiani, L., Yung, M.: Secret Swarm Unit Reactive k-Secret Sharing. Ad Hoc Networks 10(7), 1291–1305 (2012)CrossRefGoogle Scholar
  12. 12.
    Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proc. 41st STOC, pp. 169–178 (2009)Google Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Goldreich, O.: Foundations of Cryptography: Basic Tools. Cambridge University Press (2000)Google Scholar
  15. 15.
    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)CrossRefGoogle Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    Shamir, A.: How to Share a Secret. Communications of the ACM 22(11), 612–613 (1979)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Shlomi Dolev
    • 1
  • Juan Garay
    • 2
  • Niv Gilboa
    • 3
  • Vladimir Kolesnikov
    • 4
  • Yelena Yuditsky
    • 1
  1. 1.Department of Computer ScienceBen Gurion University of the NegevIsrael
  2. 2.AT&T Labs – ResearchFlorham ParkUSA
  3. 3.Deptartment of Communication Systems EngineeringBen-Gurion University of the NegevBeer-ShevaIsrael
  4. 4.Bell LaboratoriesMurray HillUSA

Personalised recommendations