Florian Kerschbaum
ABSTRACT
Yao's garbled circuit technique is often used in outsourced computation. Current approaches divide the computation to two or more servers. The assumption is that the servers collaborate in offering the outsourced computation, but do not share data. This seems somewhat paradoxical in the current cloud economy. We therefore propose oblivious outsourcing where one server is unaware that other servers are involved. We present a garbled circuit generation outsourcing scheme built on lattice-based cryptography implementing this model. Our scheme does not increase the cost of circuit evaluation, but achieves a speed up of 98% (factor 55) for circuit generation.
- M. Ajtai. Generating Hard Instances of Lattice Problems (Extended Abstract). In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC), 1996. Google Scholar
Digital Library
- A. Banerjee, and C. Peikert. New and Improved Key-Homomorphic Pseudorandom Functions. In Advances in Cryptology (CRYPTO), 2014.Google ScholarCross Ref
- M. Bellare, V. Hoang, S. Keelveedhi, and P. Rogaway. Efficient Garbling from a Fixed-Key Blockcipher. In Proceedings of the 34th IEEE Symposium on Security and Privacy (SP), 2013 Google ScholarDigital Library
- M. Bellare, V. Hoang, and P. Rogaway. Foundations of Garbled Circuits. In Proceedings of the 19th ACM Conference on Computer and Communications Security (CCS), 2012. Google ScholarDigital Library
- D. Boneh, K. Lewi, H. Montgomery, and A. Raghunathan. Key Homomorphic PRFs and Their Applications. In Advances in Cryptology (CRYPTO), 2013.Google ScholarCross Ref
- S. Bugiel, S. Nürnberger, A. Sadeghi, and T. Schneider. Twin Clouds: An Architecture for Secure Cloud Computing. Workshop on Cryptography and Security in Clouds (CSC), 2011.Google Scholar
- H. Carter, C. Amrutkar, I. Dacosta, and P. Traynor. For Your Phone Only: Custom Protocols for Efficient Secure Function Evaluation on Mobile Devices. Journal of Security and Communication Networks (JSCN), 2013.Google Scholar
- H. Carter, B. Mood, P. Traynor, and K. Butler. Secure Outsourced Garbled Circuit Evaluation for Mobile Devices. In Proceedings of the 22nd USENIX Security Symposium (SECURITY), 2013. Google ScholarDigital Library
- H. Carter, C. Lever, and P. Traynor. Whitewash: Outsourcing Garbled Circuit Generation for Mobile Devices. In Proceedings of the 30th Annual Computer Security Applications Conference (ACSAC), 2014. Google ScholarDigital Library
- D. Chaum, E. van Heijst, and B. Pfitzmann. Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer. In Advances in Cryptology (CRYPTO), 1991. Google ScholarDigital Library
- U. Feige, J. Kilian, and M. Naor. A Minimal Model for Secure Computation (Extended Abstract). In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (STOC), 1994. Google ScholarDigital Library
- O. Goldreich. The Foundations of Cryptography - Volume 2. Cambridge University Press, 2004. Google ScholarCross Ref
- O. Goldreich, S. Goldwasser, and S. Halevi. Collision-Free Hashing from Lattice Problems. Technical Report TR96-056, Electronic Colloquium on Computational Complexity (ECCC), 1996.Google Scholar
- W. Henecka, and T. Schneider. Faster Secure Two-Party Computation with Less Memory. In Proceedings of the 8th ACM Symposium on Information, Computer and Communications Security (ASIACCS), 2013. Google ScholarDigital Library
- Y. Huang, P. Chapman, and D. Evans. Privacy-Preserving Applications on Smartphones. In Proceedings of the 6th USENIX Workshop on Hot Topics in Security (HotSec), 2011. Google ScholarDigital Library
- Y. Huang, D. Evans, J. Katz, and L. Malka. Faster Secure Two-Party Computation Using Garbled Circuits. In Proceedings of the 20th USENIX Security Symposium (SECURITY), 2011. Google ScholarDigital Library
- M. Jawurek, and F. Kerschbaum. Fault-Tolerant Privacy-Preserving Statistics. In Proceedings of the 12th Symposium on Privacy Enhancing Technologies (PETS), 2012. Google ScholarDigital Library
- M. Jawurek, F. Kerschbaum, and C. Orlandi. Zero-Knowledge Using Garbled Circuits: How To Prove Non-Algebraic Statements Efficiently. In Proceedings of the 20th ACM Conference on Computer and Communications Security (CCS), 2013. Google ScholarDigital Library
- S. Kamara, P. Mohassel, and B. Riva. Salus: A System for Server-Aided Secure Function Evaluation. In Proceedings of the 19th ACM Conference on Computer and Communications Security (CCS), 2012. Google ScholarDigital Library
- F. Kerschbaum. Building a Privacy-Preserving Benchmarking Enterprise System. Enterprise Information Systems 2 (4), 2008. Google ScholarDigital Library
- F. Kerschbaum, and O. Terzidis. Filtering for Private Collaborative Benchmarking. In Proceedings of the Conference on Emerging Trends in Information and Communication Security (ETRICS), 2006. Google ScholarDigital Library
- V. Kolesnikov, and T. Schneider. Improved Garbled Circuits: Free XOR Gates and Applications. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming, 2008. Google ScholarDigital Library
- B. Kreuter, A. Shelat, and C. Shen. Billion-Gate Secure Computation with Malicious Adversaries. In Proceedings of the 21st USENIX Security Symposium (SECURITY), 2012. Google ScholarDigital Library
- Y. Lindell, and B. Pinkas. A Proof of Yao's Protocol for Secure Two-Party Computation. Journal of Cryptology 22(2), 2009. Google ScholarDigital Library
- D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - A Secure Two-Party Computation System. In Proceedings of the 13th USENIX Security Symposium (SECURITY), 2004. Google ScholarDigital Library
- D. Mayer, D. Teubert, S. Wetzel, U. Meyer, and G. Neugebauer. appoint - A Distributed Privacy-Preserving iPhone Application. 3rd ACM Conference on Wireless Security (WISEC), Poster Session, 2010.Google Scholar
- D. Micciancio, and O. Regev. Lattice-based Cryptography. In D. Bernstein, and J. Buchmann (eds.), Post-quantum Cryptography, Springer, 2008.Google Scholar
- M. Naor, B. Pinkas, and R. Sumner. Privacy Preserving Auctions and Mechanism Design. In Proceedings of the 1st ACM Conference on Electronic Commerce (EC), 1999. Google ScholarDigital Library
- G. Neugebauer, L. Brutschy, U. Meyer, and S. Wetzel. Design and Implementation of Privacy-Preserving Reconciliation Protocols. In Proceedings of the 6th ACM International Workshop on Privacy and Anonymity in the Information Society (PAIS), 2013. Google ScholarDigital Library
- K. Pietrzak, and J. Sjödin. Weak Pseudorandom Functions in Minicrypt. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP), 2008. Google ScholarDigital Library
- B. Pinkas, T. Schneider, N. Smart, and S. Williams. Secure Two-Party Computation is Practical. In Advances in Cryptology (ASIACRYPT), 2009. Google ScholarDigital Library
- A. Yao. How to Generate and Exchange Secrets (Extended Abstract). In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (FOCS), 1986. Google ScholarDigital Library
Index Terms
- Oblivious outsourcing of garbled circuit generation
Recommendations
Foundations of garbled circuits
CCS '12: Proceedings of the 2012 ACM conference on Computer and communications securityGarbled circuits, a classical idea rooted in the work of Yao, have long been understood as a cryptographic technique, not a cryptographic goal. Here we cull out a primitive corresponding to this technique. We call it a garbling scheme. We provide a ...
Is the Classical GMW Paradigm Practical? The Case of Non-Interactive Actively Secure 2PC
CCS '20: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications SecurityOne of the most challenging aspects in secure computation is offering protection against active adversaries, who may arbitrarily alter the behavior of corrupted parties. A powerful paradigm due to Goldreich, Micali, and Wigderson (GMW), is to follow a ...
Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently
CCS '13: Proceedings of the 2013 ACM SIGSAC conference on Computer & communications securityZero-knowledge protocols are one of the fundamental concepts in modern cryptography and have countless applications. However, after more than 30 years from their introduction, there are only very few languages (essentially those with a group structure) ...
Comments