Perennial secure multi-party computation of universal Turing machine

Abstract Consider a user who needs to perform computation over an initially unbounded stream of input. The user would like to compute functions of the input that change dynamically due to external events. The focus of this work is outsourcing such computation to a set of agents. The outsourcing must meet several constraints. Any large enough subset of agents must correctly emulate the user's computation on the unbounded stream of input. Any small subset of agents must obtain as little information as possible on the user's data, including the computed functions and any initial input. This privacy assurance must be maintained in an information-theoretic sense. Finally, the set of agents is dynamic with agents joining and leaving the set and different sets of agents being merged, cloned or split. In this work, we show how to securely outsource such perennial computation. The user's required computation is modeled as programs for a universal Turing machine. The only information that the agents obtain on the user's secrets is an upper bound on the space complexity required to perform the computation. Each state transition of the user's Turing machine requires computation and communication that are linear in the Turing machine's space complexity and polynomial in the number of agents performing the computation for every round of computation. The communication and computational complexity for an agent joining or leaving the set of computing agents in a transition round are linear in the space complexity of the Turing machine and polynomial in the number of agents. Some of the tools we develop may be of independent interest. We construct a strongly oblivious Turing machine, in which the tape head moves only as a function of its current location. We also show how to securely share the description of a Turing machine among several agents and how to securely compute each Turing machine's transition in a constant number of communication rounds.

[1]  Ran Canetti,et al.  Practical delegation of computation using multiple servers , 2011, CCS '11.

[2]  Jennifer L. Welch,et al.  Self-Stabilizing Clock Synchronization in the Presence of ByzantineFaults ( Preliminary Version ) Shlomi Dolevy , 1995 .

[3]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[4]  Ran Canetti,et al.  Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[5]  Yihua Zhang,et al.  Secure and Verifiable Outsourcing of Large-Scale Biometric Computations , 2011, SocialCom/PASSAT.

[6]  Horst F. Wedde,et al.  BeeHiveGuard: A Step Towards Secure Nature Inspired Routing Algorithms , 2006, EvoWorkshops.

[7]  Shlomi Dolev,et al.  Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation , 2011, ICS.

[8]  Michael J. Fischer,et al.  Relations Among Complexity Measures , 1979, JACM.

[9]  Yuval Ishai,et al.  The round complexity of verifiable secret sharing and secure multicast , 2001, STOC '01.

[10]  Vladimir A. Oleshchuk,et al.  Privacy Preserving Monitoring and Surveillance in Sensor Networks , 2007, ISPA Workshops.

[11]  Marina Blanton,et al.  Secure outsourced computation of iris matching , 2012, J. Comput. Secur..

[12]  Douglas R. Stinson.  Universal Hashing and Authentication Codes , 1991, CRYPTO.

[13]  Denise Demirel,et al.  Dynamic and Verifiable Hierarchical Secret Sharing , 2016, ICITS.

[14]  Ahmad-Reza Sadeghi,et al.  Twin Clouds: Secure Cloud Computing with Low Latency - (Full Version) , 2011, Communications and Multimedia Security.

[15]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[16]  Shlomi Dolev.  Dynamic Multi-party Computation Forever for Swarm and Cloud Computing and Code Obfuscation , 2011, ALGOSENSORS.

[17]  Rafail Ostrovsky,et al.  Communication-Optimal Proactive Secret Sharing for Dynamic Groups , 2015, ACNS.

[18]  Silvio Micali,et al.  An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement , 1997, SIAM J. Comput..

[19]  Cong Wang,et al.  Secure and practical outsourcing of linear programming in cloud computing , 2011, 2011 Proceedings IEEE INFOCOM.

[20]  Jennifer L. Welch,et al.  Autonomous virtual mobile nodes , 2005, SPAA.

[21]  Radha Poovendran,et al.  SeRLoc: secure range-independent localization for wireless sensor networks , 2004, WiSe '04.

[22]  Mariana Raykova,et al.  Outsourcing Multi-Party Computation , 2011, IACR Cryptol. ePrint Arch..

[23]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[24]  Craig Gentry,et al.  Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.

[25]  Baruch Awerbuch,et al.  Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[26]  Adrian N Phillips,et al.  A Secure Group Communication Architecture for a Swarm of Autonomous Unmanned Aerial Vehicles , 2012 .

[27]  Shlomi Dolev,et al.  Swarming secrets , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[28]  Yehuda Lindell,et al.  Information-theoretically secure protocols and security under composition , 2006, STOC '06.

[29]  Xing Li,et al.  Secure Data Aggregation with Fully Homomorphic Encryption in Large-Scale Wireless Sensor Networks , 2015, Sensors.

[30]  Anish Arora,et al.  Maintaining Digital Clocks in Step , 1991, Parallel Process. Lett..

[31]  Moti Yung,et al.  Perfectly Secure Key Distribution for Dynamic Conferences , 1998, Inf. Comput..

[32]  Gene Tsudik,et al.  QUEST Software and , 2022 .

[33]  Andrew Chi-Chih Yao,et al.  How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[34]  David Chaum,et al.  Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.

[35]  Mikhail J. Atallah,et al.  Securely outsourcing linear algebra computations , 2010, ASIACCS '10.

[36]  Alfredo De Santis,et al.  Fully Dynamic Secret Sharing Schemes , 1996, Theor. Comput. Sci..

[37]  Srdjan Capkun,et al.  Secure positioning of wireless devices with application to sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[38]  Andrew Chi-Chih Yao,et al.  Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.

[39]  Hugo Krawczyk,et al.  Proactive Secret Sharing Or: How to Cope With Perpetual Leakage , 1995, CRYPTO.

[40]  F. MacWilliams,et al.  Codes which detect deception , 1974 .

[41]  K. Srinathan,et al.  Round-Optimal and Efficient Verifiable Secret Sharing , 2006, TCC.

[42]  Xue Liu,et al.  PDA: Privacy-Preserving Data Aggregation in Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[43]  Vinod Vaikuntanathan,et al.  Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE , 2012, EUROCRYPT.

[44]  Lingxuan Hu,et al.  Secure aggregation for wireless networks , 2003, 2003 Symposium on Applications and the Internet Workshops, 2003. Proceedings..

[45]  Suman Nath,et al.  Secure outsourced aggregation via one-way chains , 2009, SIGMOD Conference.

[46]  Moti Yung,et al.  Secret Swarm UnitReactive k-Secret Sharing , 2007, INDOCRYPT.

[47]  Michael N. Vrahatis,et al.  Recent approaches to global optimization problems through Particle Swarm Optimization , 2002, Natural Computing.

[48]  Manuel Koschuch,et al.  Applicability of multiparty computation schemes for Wireless Sensor Networks , 2010, 2010 International Conference on Data Communication Networking (DCNET).

[49]  Shlomi Dolev,et al.  Brief announcement: swarming secrets , 2010, PODC '10.

[50]  Danny Dolev,et al.  Fast self-stabilizing byzantine tolerant digital clock synchronization , 2008, PODC '08.

[51]  Frederik Armknecht,et al.  A Guide to Fully Homomorphic Encryption , 2015, IACR Cryptol. ePrint Arch..

[52]  Marina Blanton,et al.  Secure Outsourcing of DNA Searching via Finite Automata , 2010, DBSec.

[53]  Xiao Li,et al.  A Protocol of Member-Join in a Secret Sharing Scheme , 2006, ISPEC.