Self-Processing Private Sensor Data via Garbled Encryption

Nathan Manohar 1 , Abhishek Jain 2 ,  and Amit Sahai 3
  • 1 UCLA,
  • 2 John Hopkins University,
  • 3 UCLA,

Abstract

We introduce garbled encryption, a relaxation of secret-key multi-input functional encryption (MiFE) where a function key can be used to jointly compute upon only a particular subset of all possible tuples of ciphertexts. We construct garbled encryption for general functionalities based on one-way functions.

We show that garbled encryption can be used to build a self-processing private sensor data system where after a one-time trusted setup phase, sensors deployed in the field can periodically broadcast encrypted readings of private data that can be computed upon by anyone holding function keys to learn processed output, without any interaction. Such a system can be used to periodically check, e.g., whether a cluster of servers are in an “alarm” state.

We implement our garbled encryption scheme and find that it performs quite well, with function evaluations in the microseconds. The performance of our scheme was tested on a standard commodity laptop.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [1] [n.d.]. http://www.basel.int/

  • [2] [n.d.]. https://unfccc.int/process/the-kyoto-protocol

  • [3] Michel Abdalla, Romain Gay, Mariana Raykova, and Hoeteck Wee. 2017. Multi-input Inner-Product Functional Encryption from Pairings. In Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30 - May 4, 2017, Proceedings, Part I. 601–626.

  • [4] Prabhanjan Ananth and Abhishek Jain. 2015. Indistinguishability Obfuscation from Compact Functional Encryption. In Advances in Cryptology – CRYPTO 2015: 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part I, Rosario Gennaro and Matthew Robshaw (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 308–326. https://doi.org/10.1007/978-3-662-47989-6_15

  • [5] Ross J. Anderson. 2008. Security Engineering: A Guide to Building Dependable Distributed Systems (2 ed.). Wiley Publishing.

  • [6] BBC. [n.d.]. https://www.bbc.com/news/business-34324772

  • [7] BBC. [n.d.]. Iran nuclear deal: Key details. https://www.bbc.com/news/world-middle-east-33521655

  • [8] D. Beaver, S. Micali, and P. Rogaway. 1990. The Round Complexity of Secure Protocols. In Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing (STOC ’90). ACM, New York, NY, USA, 503–513. https://doi.org/10.1145/100216.100287

  • [9] Mihir Bellare, Viet Tung Hoang, Sriram Keelveedhi, and Phillip Rogaway. 2013. Efficient Garbling from a Fixed-Key Blockcipher. In Proceedings of the 2013 IEEE Symposium on Security and Privacy (SP ’13). IEEE Computer Society, Washington, DC, USA, 478–492. https://doi.org/10.1109/SP.2013.39

  • [10] Mihir Bellare, Viet Tung Hoang, and Phillip Rogaway. 2012. Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing. In Advances in Cryptology – ASIACRYPT 2012, Xiaoyun Wang and Kazue Sako (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 134–153.

  • [11] Mihir Bellare, Viet Tung Hoang, and Phillip Rogaway. 2012. Foundations of Garbled Circuits. In Proceedings of the 2012 ACM Conference on Computer and Communications Security (CCS ’12). ACM, New York, NY, USA, 784–796. https://doi.org/10.1145/2382196.2382279

  • [12] Dan Boneh, Kevin Lewi, Mariana Raykova, Amit Sahai, Mark Zhandry, and Joe Zimmerman. 2015. Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without Obfuscation. In Advances in Cryptology - EUROCRYPT 2015: 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II. Springer Berlin Heidelberg, Berlin, Heidelberg, 563–594. https://doi.org/10.1007/978-3-662-46803-6_19

  • [13] Dan Boneh, Amit Sahai, and Brent Waters. 2011. Functional Encryption: Definitions and Challenges. In Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings. 253–273.

  • [14] Zvika Brakerski, Ilan Komargodski, and Gil Segev. 2016. Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. In Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II. 852–880.

  • [15] Brent Carmer, Alex J. Malozemoff, and Mariana Raykova. 2017. 5Gen-C: Multi-input Functional Encryption and Program Obfuscation for Arithmetic Circuits. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30 - November 03, 2017. 747–764.

  • [16] Flaviu Cristian. 1989. Probabilistic Clock Synchronization. Distrib. Comput. 3, 3 (Sept. 1989), 146–158. https://doi.org/10.1007/BF01784024

  • [17] Ben Fisch, Dhinakaran Vinayagamurthy, Dan Boneh, and Sergey Gorbunov. 2017. IRON: Functional Encryption using Intel SGX. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30 - November 03, 2017. 765–782. https://doi.org/10.1145/3133956.3134106

  • [18] Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In STOC.

  • [19] Shafi Goldwasser, S. Dov Gordon, Vipul Goyal, Abhishek Jain, Jonathan Katz, Feng-Hao Liu, Amit Sahai, Elaine Shi, and Hong-Sheng Zhou. 2014. Multi-input Functional Encryption. In Advances in Cryptology – EUROCRYPT 2014: 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings. Springer Berlin Heidelberg, Berlin, Heidelberg, 578–602. https://doi.org/10.1007/978-3-642-55220-5_32

  • [20] Adam Groce, Alex Ledger, Alex J. Malozemoff, and Arkady Yerukhimovich. 2016. CompGC: Efficient Offline/Online Semi-honest Two-party Computation. Cryptology ePrint Archive, Report 2016/458. https://eprint.iacr.org/2016/458.

  • [21] Karthik A. Jagadeesh, David J. Wu, Johannes A. Birgmeier, Dan Boneh, and Gill Bejerano. 2017. Deriving genomic diagnoses without revealing patient genomes. Science 357, 6352 (2017), 692–695. https://doi.org/10.1126/science.aam9710arXiv:http://science.sciencemag.org/content/357/6352/692.full.pdf

  • [22] Vladimir Kolesnikov, Payman Mohassel, and Mike Rosulek. 2014. FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR. In Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part II. 440–457.

  • [23] Vladimir Kolesnikov, Ahmad-Reza Sadeghi, and Thomas Schneider. 2009. Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima. In Proceedings of the 8th International Conference on Cryptology and Network Security (CANS ’09). Springer-Verlag, Berlin, Heidelberg, 1–20. https://doi.org/10.1007/978-3-642-10433-6_1

  • [24] Vladimir Kolesnikov and Thomas Schneider. 2008. Improved Garbled Circuit: Free XOR Gates and Applications. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Part II (ICALP ’08). Springer-Verlag, Berlin, Heidelberg, 486–498. https://doi.org/10.1007/978-3-540-70583-3_40

  • [25] Kevin Lewi, Alex J. Malozemoff, Daniel Apon, Brent Carmer, Adam Foltzer, Daniel Wagner, David W. Archer, Dan Boneh, Jonathan Katz, and Mariana Raykova. 2016. 5Gen: A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (CCS ’16). ACM, New York, NY, USA, 981–992. https://doi.org/10.1145/2976749.2978314

  • [26] Yehuda Lindell and Benny Pinkas. 2009. A Proof of Security of Yao’s Protocol for Two-Party Computation. J. Cryptol. 22, 2 (April 2009), 161–188. https://doi.org/10.1007/s00145-008-9036-8

  • [27] Moni Naor, Benny Pinkas, and Reuban Sumner. 1999. Privacy Preserving Auctions and Mechanism Design. In Proceedings of the 1st ACM Conference on Electronic Commerce (EC ’99). ACM, New York, NY, USA, 129–139. https://doi.org/10.1145/336992.337028

  • [28] Muhammad Naveed, Shashank Agrawal, Manoj Prabhakaran, XiaoFeng Wang, Erman Ayday, Jean-Pierre Hubaux, and Carl Gunter. 2014. Controlled Functional Encryption. In Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security (CCS ’14). ACM, New York, NY, USA, 1280–1291. https://doi.org/10.1145/2660267.2660291

  • [29] Adam O’Neill. 2010. Definitional Issues in Functional Encryption. IACR Cryptology ePrint Archive 2010 (2010), 556. http://eprint.iacr.org/2010/556

  • [30] Benny Pinkas, Thomas Schneider, Nigel P. Smart, and Stephen C. Williams. 2009. Secure Two-Party Computation Is Practical. In Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology (ASIACRYPT ’09). Springer-Verlag, Berlin, Heidelberg, 250–267. https://doi.org/10.1007/978-3-642-10366-7_15

  • [31] Amit Sahai and Brent Waters. 2005. Fuzzy Identity-Based Encryption. In Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings. 457–473.

  • [32] Ebrahim M. Songhori, Siam U. Hussain, Ahmad-Reza Sadeghi, Thomas Schneider, and Farinaz Koushanfar. 2015. TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits. In Proceedings of the 2015 IEEE Symposium on Security and Privacy (SP ’15). IEEE Computer Society, Washington, DC, USA, 411–428. https://doi.org/10.1109/SP.2015.32

  • [33] Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science (SFCS ’86). IEEE Computer Society, Washington, DC, USA, 162–167. https://doi.org/10.1109/SFCS.1986.25

  • [34] Samee Zahur, Mike Rosulek, and David Evans. 2015. Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates. In Advances in Cryptology - EUROCRYPT 2015 - 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria, April 26-30, 2015, Proceedings, Part II. 220–250.

OPEN ACCESS

Journal + Issues

Search