Skip to main content
SpringerLink
Log in

PrivC—A Framework for Efficient Secure Two-Party Computation

  • Conference paper
  • First Online:
Security and Privacy in Communication Networks (SecureComm 2019)

Abstract

Secure Multiparty Computation (SMC) allows mutually distrusted parties to jointly evaluate a function on their private inputs without revealing anything but the output of the function. SMC has been extensively studied for decades by the research community and significant progresses have been made, both in the directions of computing capability and performance improvement. In this work, we design and implement PrivC, an efficient framework for secure two-party computing. Our design was based on arithmetic sharing, oblivious transfer, and garbled circuits. We demonstrate the efficiency of our design and implementation using benchmark datasets and real world applications at our organization. Evaluations have shown that PrivC outperforms several other competitive two-party frameworks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We learnt this trick from [25].

  2. 2.

    We provide a class Bool to express 1-bit Yao sharing.

References

  1. EUGDPR - Information Portal. https://eugdpr.org/. Accessed 26 Mar 2019

  2. What is HIPAA (Health Insurance Portability and Accountability Act)? https://searchhealthit.techtarget.com/definition/HIPAA. Accessed 26 Mar 2019

  3. Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer and extensions for faster secure computation. In: ACM CCS, pp. 535–548 (2013)

    Google Scholar 

  4. Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420–432. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-46766-1_34

    Chapter  Google Scholar 

  5. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: STOC, pp. 503–513 (1990)

    Google Scholar 

  6. Bellare, M., Micali, S.: Non-interactive oblivious transfer and applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 547–557. Springer, New York (1990). https://doi.org/10.1007/0-387-34805-0_48

    Chapter  Google Scholar 

  7. Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: a system for secure multi-party computation. In: ACM CCS, pp. 257–266 (2008)

    Google Scholar 

  8. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC, pp. 1–10 (1988)

    Google Scholar 

  9. Bogdanov, D., Laur, S., Willemson, J.: Sharemind: a framework for fast privacy-preserving computations. In: ESORICS, pp. 192–206 (2008)

    Google Scholar 

  10. Bogetoft, P., et al.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325–343. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03549-4_20

    Chapter  Google Scholar 

  11. Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.A.: SEPIA: privacy-preserving aggregation of multi-domain network events and statistics. In: USENIX Security Symposium, pp. 223–240 (2010)

    Google Scholar 

  12. Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84–90 (1981)

    Article  Google Scholar 

  13. Damgård, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643–662. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32009-5_38

    Chapter  Google Scholar 

  14. Demmler, D., Schneider, T., Zohner, M.: ABY - a framework for efficient mixed-protocol secure two-party computation. In: NDSS (2015)

    Google Scholar 

  15. Dwork, C.: Differential privacy. In: ICALP (2), pp. 1–12 (2006)

    Google Scholar 

  16. Felt, A.P., Chin, E., Hanna, S., Song, D., Wagner, D.A.: Android permissions demystified. In: ACM CCS, pp. 627–638 (2011)

    Google Scholar 

  17. Gilboa, N.: Two party RSA key generation. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 116–129. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48405-1_8

    Chapter  Google Scholar 

  18. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: STOC, pp. 218–229 (1987)

    Google Scholar 

  19. Isaac, M., Frenkel, S.: Facebook security breach exposes accounts of 50 million users (2018). https://www.nytimes.com/2018/09/28/technology/facebook-hack-data-breach.html. Accessed 26 Mar 2019

  20. Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145–161. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45146-4_9

    Chapter  Google Scholar 

  21. Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious PRF with applications to private set intersection. In: ACM CCS, pp. 818–829 (2016)

    Google Scholar 

  22. Kolesnikov, V., Schneider, T.: Improved garbled circuit: free XOR gates and applications. In: ICALP (2), pp. 486–498 (2008)

    Google Scholar 

  23. LeCun, Y., Cortes, C., Burges, C.J.: MNIST handwritten digit database. http://yann.lecun.com/exdb/mnist/. Accessed 26 Mar 2019

  24. Malkhi, D., Nisan, N., Pinkas, B., Sella, Y., et al.: Fairplay - secure two-party computation system. In: USENIX Security Symposium, pp. 287–302 (2004)

    Google Scholar 

  25. Mohassel, P., Zhang, Y.: SecureML: a system for scalable privacy-preserving machine learning. In: IEEE Symposium on Security and Privacy, pp. 19–38 (2017)

    Google Scholar 

  26. Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA, pp. 448–457 (2001)

    Google Scholar 

  27. Rabin, M.O.: How to exchange secrets with oblivious transfer. In: Technical Report. vol. TR-81. Aiken Computation Lab, Harvard University (1981)

    Google Scholar 

  28. Samarati, P., Sweeney, L.: Generalizing data to provide anonymity when disclosing information. In: PODS, vol. 98, p. 188 (1998)

    Google Scholar 

  29. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  Google Scholar 

  30. Wang, X., Malozemoff, A.J., Katz, J.: EMP-toolkit: efficient MultiParty computation toolkit (2016). https://github.com/emp-toolkit

  31. Yao, A.C.C.: Protocols for secure computations. In: FOCS, pp. 160–164 (1982)

    Google Scholar 

  32. Zahur, S., Rosulek, M., Evans, D.: Two halves make a whole. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 220–250. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-46803-6_8

    Chapter  MATH  Google Scholar 

Download references

Acknowlegements

We thank Prof. Sheng Zhong, Yuan Zhang, and Jingyu Hua at Nanjing University for their insightful discussions with us on our work. We also thank Dr. Tao Wei, Chief Security Scientist, and Dr. Yueqiang Cheng, Staff Security Scientist at Baidu for their feedbacks and suggestions on our paper.

Author information

Authors and Affiliations

  1. Baidu Inc., Beijing, China

    Kai He, Liu Yang, Jue Hong, Jinghua Jiang, Jieming Wu, Xu Dong & Zhuxun Liang

Authors
  1. Kai He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liu Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jue Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jinghua Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jieming Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Xu Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Zhuxun Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liu Yang .

Editor information

Editors and Affiliations

  1. George Mason University, Fairfax, VA, USA

    Songqing Chen

  2. The University of Texas at San Antonio, San Antonio, TX, USA

    Kim-Kwang Raymond Choo

  3. Boston University, Lowell, MA, USA

    Xinwen Fu

  4. Virginia Tech, Blacksburg, VA, USA

    Wenjing Lou

  5. University of Central Florida, Orlando, FL, USA

    Aziz Mohaisen

Rights and permissions

Reprints and permissions

Copyright information

© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

He, K. et al. (2019). PrivC—A Framework for Efficient Secure Two-Party Computation. In: Chen, S., Choo, KK., Fu, X., Lou, W., Mohaisen, A. (eds) Security and Privacy in Communication Networks. SecureComm 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 305. Springer, Cham. https://doi.org/10.1007/978-3-030-37231-6_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-37231-6_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-37230-9

  • Online ISBN: 978-3-030-37231-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation