Subscribe
Issue No.04 - July-Aug. (2013 vol.10)
pp: 225-238
Y. Brun , Sch. of Comput. Sci., Univ. of Massachusetts, Amherst, MA, USA
N. Medvidovic , Comput. Sci. Dept., Univ. of Southern California, Los Angeles, CA, USA
ABSTRACT
We present sTile, a technique for distributing trust-needing computation onto insecure networks, while providing probabilistic guarantees that malicious agents that compromise parts of the network cannot learn private data. With sTile, we explore the fundamental cost of achieving privacy through data distribution and bound how much less efficient a privacy-preserving system is than a nonprivate one. This paper focuses specifically on NP-complete problems and demonstrates how sTile-based systems can solve important real-world problems, such as protein folding, image recognition, and resource allocation. We present the algorithms involved in sTile and formally prove that sTile-based systems preserve privacy. We develop a reference sTile-based implementation and empirically evaluate it on several physical networks of varying sizes, including the globally distributed PlanetLab testbed. Our analysis demonstrates sTile's scalability and ability to handle varying network delay, as well as verifies that problems requiring privacy-preservation can be solved using sTile orders of magnitude faster than using today's state-of-the-art alternatives.
INDEX TERMS
Assembly, Crystals, Privacy, NP-complete problem, Computational modeling, Data privacy,tile assembly model, Privacy, trusted computing, untrusted networks, distributed computation, PlanetLab, sTile
CITATION
Y. Brun, N. Medvidovic, "Entrusting Private Computation and Data to Untrusted Networks", IEEE Transactions on Dependable and Secure Computing, vol.10, no. 4, pp. 225-238, July-Aug. 2013, doi:10.1109/TDSC.2013.13
REFERENCES
 [1] L. Adleman, J. Kari, L. Kari, and D. Reishus, "On the Decidability of Self-Assembly of Infinite Ribbons," Proc. 43rd Ann. IEEE Symp. Foundations of Computer Science (FOCS '02), pp. 530-537, Nov. 2002. [2] D.P. Anderson, "BOINC: A System for Public-Resource Computing and Storage," Proc. Fifth IEEE/ACM Int'l Workshop Grid Computing (GRID '04), pp. 4-10, 2004. [3] G. Ateniese, K. Fu, M. Green, and S. Hohenberger, "Improved Proxy Re-Encryption Schemes with Applications to Secure Distributed Storage," ACM Trans. Information and System Security, vol. 9, no. 1, pp. 1-30, Feb. 2006. [4] D. Baker, "Foldit," http:/fold.it, 2009. [5] A. Balint, M. Henn, and O. Gableske, "A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem," Proc. 12th Int'l Conf. Theory and Applications of Satisfiability Testing (SAT '09), pp. 284-297, 2009. [6] R. Berger, The Undecidability of the Domino Problem, no. 66. Am. Math. Soc., 1966. [7] F. Berman, R. Wolski, H. Casanova, W. Cirne, H. Dail, M. Faerman, S. Figueira, J. Hayes, G. Obertelli, J. Schopf, G. Shao, S. Smallen, N. Spring, A. Su, and D. Zagorodnov, "Adaptive Computing on the Grid Using AppLeS," IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 4, pp. 369-382, Apr. 2003. [8] Y. Brun, "Arithmetic Computation in the Tile Assembly Model: Addition and Multiplication," Theoretical Computer Science, vol. 378, no. 1, pp. 17-31, June 2007. [9] Y. Brun, "Nondeterministic Polynomial Time Factoring in the Tile Assembly Model," Theoretical Computer Science, vol. 395, no. 1, pp. 3-23, Apr. 2008. [10] Y. Brun, "Solving NP-Complete Problems in the Tile Assembly Model," Theoretical Computer Science, vol. 395, no. 1, pp. 31-46, Apr. 2008. [11] Y. Brun, "Solving Satisfiability in the Tile Assembly Model with a Constant-Size Tileset," J. Algorithms, vol. 63, no. 4, pp. 151-166, 2008. [12] Y. Brun, "Efficient 3-SAT Algorithms in the Tile Assembly Model," Natural Computing, vol. 11, no. 2, pp. 209-229, 2012. [13] Y. Brun, G. Edwards, J. Young Bang, and N. Medvidovic, "Smart Redundancy for Distributed Computation," Proc. 31st Int'l Conf. Distributed Computing Systems (ICDCS '11), pp. 665-676, June 2011. [14] Y. Brun and N. Medvidovic, "Mahjong: A sTile Framework for Distributing NP-Complete Computations Onto Untrusted Networks in a Trustworthy Manner," http://www.cs.umass.edu/brunMahjong, 2013. [15] Y. Brun and N. Medvidovic, "Fault and Adversary Tolerance as an Emergent Property of Distributed Systems' Software Architectures," Proc. Second Int'l Workshop Eng. Fault Tolerant Systems (EFTS '07), pp. 38-43, Sept. 2007. [16] Y. Brun and N. Medvidovic, "Keeping Data Private While Computing in the Cloud," Proc. Fifth Int'l Conf. Cloud Computing (CLOUD '12), pp. 285-294, June 2012. [17] M. Chaisson, P. Pevzner, and H. Tang, "Fragment Assembly with Short Reads," Bioinformatics, vol. 20, no. 13, pp. 2067-2074, 2004. [18] A.J. Chakravarti and G. Baumgartner, "The Organic Grid: Self-Organizing Computation on a Peer-To-Peer Network," Proc. First Int'l Conf. Autonomic Computing (ICAC '04), pp. 96-103, 2004. [19] A.M. Childs, "Secure Assisted Quantum Computation," Quantum Information and Computation, vol. 5, no. 456, pp. 456-466, 2005. [20] D. Dagon, G. Gu, C. Lee, and W. Lee, "A Taxonomy of Botnet Structures," Proc. 23rd Ann. Computer Security Applications Conf. (ACSAC '07), pp. 325-339, Dec. 2007. [21] J. Dean and S. Ghemawat, "MapReduce: Simplified Data Processing on Large Clusters," Proc. Sixth Symp. Operating System Design and Implementation (OSDI '04), Dec. 2004. [22] J. Duerig, R. Ricci, J. Zhang, D. Gebhardt, S. Kasera, and J. Lepreau, "Flexlab: A Realistic, Controlled, and Friendly Environment for Evaluating Networked Systems," Proc. Fifth Workshop Hot Topics in Networks (HotNets V), pp. 103-108, Nov. 2006. [23] S. Floyd and V. Paxson, "Difficulties in Simulating the Internet," IEEE/ACM Trans. Networking, vol. 9, no. 4, pp. 392-403, Aug. 2001. [24] I. Foster, C. Kesselman, and S. Tuecke, "The Anatomy of the Grid: Enabling Scalable Virtual Organizations," Int'l J. High Performance Computing Applications, vol. 15, no. 3, pp. 200-222, 2001. [25] C. Gentry, "Fully Homomorphic Encryption Using Ideal Lattices," Proc. 41st Ann. ACM Symp. Theory of Computing (STOC '09), pp. 169-178, 2009. [26] A. Greenberg, "IBM's Blindfolded Calculator," Forbes Magazine, July 2009. [27] A.S. Grimshaw, W.A. Wulf, and the Legion Team, "The Legion Vision of a Worldwide Virtual Computer," Comm. ACM, vol. 40, no. 1, pp. 39-45, 1997. [28] "High Performance Computing and Communications," http://www.usc.eduhpcc, 2013. [29] Javelin Strategy & Research "2010 Identity Fraud Survey Report," http://www.marketresearch.com/productdisplay. asp?productid=2592343 , 2010. [30] E. Korpela, D. Werthimer, D. Anderson, J. Cobb, and M. Lebofsky, "SETI@home—Massively Distributed Computing for SETI," Computing in Science and Eng., vol. 3, no. 1, pp. 78-83, Jan./Feb. 1996. [31] O. Kullmann, "New Methods for 3-SAT Decisions and Worst-Case Analysis," Theoretical Computer Science, vol. 223, pp. 1-72, 1999. [32] S.M. Larson, C.D. Snow, M.R. Shirts, and V.S. Pande, Folding@Home and Genome@Home: Using Distributed Computing to Tackle Previously Intractable Problems in Computational Biology. Horizon Press, 2002. [33] S. Malek, M. Mikic-Rakic, and N. Medvidovic, "A Style-Aware Architectural Middleware for Resource-Constrained, Distributed Systems," IEEE Trans. Software Eng., vol. 31, no. 3, pp. 256-272, Mar. 2005. [34] R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge Univ. Press, 1995. [35] A. Nakano, R.K. Kalia, P. Vashishta, T.J. Campbell, S. Ogata, F. Shimojo, and S. Saini, "Scalable Atomistic Simulation Algorithms for Materials Research," Scientific Programming, vol. 10, no. 4, pp. 263-270, 2002. [36] L. Peterson, T. Anderson, D. Culler, and T. Roscoe, "A Blueprint for Introducing Disruptive Technology into the Internet," ACM SIGCOMM Computer Comm. Rev., vol. 33, no. 1, pp. 59-64, 2003. [37] R.M. Robinson, "Undecidability and Nonperiodicity for Tilings of the Plane," Inventiones Math., vol. 12, no. 3, pp. 177-209, 1971. [38] S.M. Rubin, Computer Aids for VLSI Design. Addison-Wesley, 1994. [39] M. Sipser, Introduction to the Theory of Computation. PWS Publishing, 1997. [40] R.N. Taylor, N. Medvidovic, and E.M. Dashofy, Software Architecture: Foundations, Theory, and Practice. John Wiley & Sons, 2009. [41] H. Wang, "Proving Theorems by Pattern Recognition," II. Bell System Technical J., vol. 40, pp. 1-42, 1961. [42] Q. Wang, C. Wang, K. Ren, W. Lou, and J. Li, "Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing," IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 5, pp. 847-859, May 2011. [43] Wikipedia, "SETI@home," http://en.wikipedia.org/wiki SETI@home, 2008. [44] E. Winfree, "Simulations of Computing by Self-Assembly of DNA," Technical Report CS-TR:1998:22, California Inst. of Technology, Pasadena, CA, 1998. [45] G.J. Woeginger, "Exact Algorithms for NP-Hard Problems: A Survey," Combinatorial Optimization - Eureka, You Shrink!, vol. 2570/2003, pp. 185-207, 2003. [46] Z. Yang, S. Yu, W. Lou, and C. Liu, "$P^2$ : Privacy-Preserving Communication and Precise Reward Architecture for V2G Networks in Smart Grid," IEEE Trans. Smart Grid, vol. 2, no. 4, pp. 697-706, Dec. 2011. [47] A.C.-C. Yao, "How to Generate and Exchange Secrets," Proc. 27th Ann. IEEE Symp. Foundations of Computer Science (FOCS '86), pp. 162-167, Oct. 1986. [48] S. Yu, C. Wang, K. Ren, and W. Lou, "Achieving Secure, Scalable, and Fine-Grained Data Access Control in Cloud Computing," Proc. IEEE INFOCOM, pp. 534-542, 2010.