research-article

Oblivious outsourcing of garbled circuit generation

Author:

Florian KerschbaumAuthors Info & Claims

SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied Computing

Pages 2134 - 2140

https://doi.org/10.1145/2695664.2695665

Published: 13 April 2015 Publication History

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.

References

[1]

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.

Digital Library

[2]

A. Banerjee, and C. Peikert. New and Improved Key-Homomorphic Pseudorandom Functions. In Advances in Cryptology (CRYPTO), 2014.

[3]

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

Digital Library

[4]

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.

Digital Library

[5]

D. Boneh, K. Lewi, H. Montgomery, and A. Raghunathan. Key Homomorphic PRFs and Their Applications. In Advances in Cryptology (CRYPTO), 2013.

[6]

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.

[7]

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.

[8]

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.

Digital Library

[9]

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.

Digital Library

[10]

D. Chaum, E. van Heijst, and B. Pfitzmann. Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer. In Advances in Cryptology (CRYPTO), 1991.

Digital Library

[11]

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.

Digital Library

[12]

O. Goldreich. The Foundations of Cryptography - Volume 2. Cambridge University Press, 2004.

[13]

O. Goldreich, S. Goldwasser, and S. Halevi. Collision-Free Hashing from Lattice Problems. Technical Report TR96-056, Electronic Colloquium on Computational Complexity (ECCC), 1996.

[14]

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.

Digital Library

[15]

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.

Digital Library

[16]

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.

Digital Library

[17]

M. Jawurek, and F. Kerschbaum. Fault-Tolerant Privacy-Preserving Statistics. In Proceedings of the 12th Symposium on Privacy Enhancing Technologies (PETS), 2012.

Digital Library

[18]

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.

Digital Library

[19]

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.

Digital Library

[20]

F. Kerschbaum. Building a Privacy-Preserving Benchmarking Enterprise System. Enterprise Information Systems 2 (4), 2008.

Digital Library

[21]

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.

Digital Library

[22]

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.

Digital Library

[23]

B. Kreuter, A. Shelat, and C. Shen. Billion-Gate Secure Computation with Malicious Adversaries. In Proceedings of the 21st USENIX Security Symposium (SECURITY), 2012.

Digital Library

[24]

Y. Lindell, and B. Pinkas. A Proof of Yao's Protocol for Secure Two-Party Computation. Journal of Cryptology 22(2), 2009.

Digital Library

[25]

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.

Digital Library

[26]

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.

[27]

D. Micciancio, and O. Regev. Lattice-based Cryptography. In D. Bernstein, and J. Buchmann (eds.), Post-quantum Cryptography, Springer, 2008.

[28]

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.

Digital Library

[29]

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.

Digital Library

[30]

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.

Digital Library

[31]

B. Pinkas, T. Schneider, N. Smart, and S. Williams. Secure Two-Party Computation is Practical. In Advances in Cryptology (ASIACRYPT), 2009.

Digital Library

[32]

A. Yao. How to Generate and Exchange Secrets (Extended Abstract). In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (FOCS), 1986.

Digital Library

Cited By

Li XWang HLi ZWu LWei XSu YLu R(2024)Publicly Verifiable Secure Multi-Party Computation Framework Based on Bulletin BoardIEEE Transactions on Services Computing10.1109/TSC.2024.338025817:4(1698-1711)Online publication date: Jul-2024
https://doi.org/10.1109/TSC.2024.3380258
Zhong HSang YZhang YXi Z(2020)Secure Multi-Party Computation on Blockchain: An OverviewParallel Architectures, Algorithms and Programming10.1007/978-981-15-2767-8_40(452-460)Online publication date: 26-Jan-2020
https://doi.org/10.1007/978-981-15-2767-8_40
Shan ZRen KBlanton MWang C(2018)Practical Secure Computation OutsourcingACM Computing Surveys10.1145/315836351:2(1-40)Online publication date: 20-Feb-2018
https://dl.acm.org/doi/10.1145/3158363
Show More Cited By

Index Terms

Oblivious outsourcing of garbled circuit generation
1. Security and privacy
  1. Cryptography
  2. Systems security
    1. Operating systems security

Recommendations

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 Security

One 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 security

Zero-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) ...
Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model
Abstract
We consider the problem of constant-round secure two-party computation in the presence of active (malicious) adversaries. We present the first protocol that has only a constant multiplicative communication overhead compared to Yao’s protocol for ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied Computing

April 2015

2418 pages

ISBN:9781450331968

DOI:10.1145/2695664

Conference Chairs:
Roger L. Wainwright
University of Tulsa
,
Juan Manuel Corchado
University of Salamanca, Spain
,
Program Chairs:
Alessio Bechini
University of Pisa, Italy
,
Jiman Hong
Soongsil University, South Korea

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 April 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SAC 2015

Sponsor:

SIGAPP

SAC 2015: Symposium on Applied Computing

April 13 - 17, 2015

Salamanca, Spain

Acceptance Rates

SAC '15 Paper Acceptance Rate 291 of 1,211 submissions, 24%;

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
137
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Li XWang HLi ZWu LWei XSu YLu R(2024)Publicly Verifiable Secure Multi-Party Computation Framework Based on Bulletin BoardIEEE Transactions on Services Computing10.1109/TSC.2024.338025817:4(1698-1711)Online publication date: Jul-2024
https://doi.org/10.1109/TSC.2024.3380258
Zhong HSang YZhang YXi Z(2020)Secure Multi-Party Computation on Blockchain: An OverviewParallel Architectures, Algorithms and Programming10.1007/978-981-15-2767-8_40(452-460)Online publication date: 26-Jan-2020
https://doi.org/10.1007/978-981-15-2767-8_40
Shan ZRen KBlanton MWang C(2018)Practical Secure Computation OutsourcingACM Computing Surveys10.1145/315836351:2(1-40)Online publication date: 20-Feb-2018
https://dl.acm.org/doi/10.1145/3158363
Zhang SLi HDai YHe MLu R(2017)EPP-DMM: An Efficient and Privacy-Protected Delegation Scheme for Matrix MultiplicationGLOBECOM 2017 - 2017 IEEE Global Communications Conference10.1109/GLOCOM.2017.8254988(1-6)Online publication date: Dec-2017
https://doi.org/10.1109/GLOCOM.2017.8254988
Deshmukh SCarter HHernandez GTraynor PButler K(2016)Efficient and secure template blinding for biometric authentication2016 IEEE Conference on Communications and Network Security (CNS)10.1109/CNS.2016.7860539(480-488)Online publication date: Oct-2016
https://doi.org/10.1109/CNS.2016.7860539

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten