Bandwidth-Optimized Secure Two-Party Computation of Minima

  • Jan Henrik ZiegeldorfEmail author
  • Jens Hiller
  • Martin Henze
  • Hanno Wirtz
  • Klaus Wehrle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9476)


Secure Two-Party Computation (STC) allows two mutually untrusting parties to securely evaluate a function on their private inputs. While tremendous progress has been made towards reducing processing overheads, STC still incurs significant communication overhead that is in fact prohibitive when no high-speed network connection is available, e.g., when applications are run over a cellular network. In this paper, we consider the fundamental problem of securely computing a minimum and its argument, which is a basic building block in a wide range of applications that have been proposed as STCs, e.g., Nearest Neighbor Search, Auctions, and Biometric Matchings. We first comprehensively analyze and compare the communication overhead of implementations of the three major STC concepts, i.e., Yao’s Garbled Circuits, the Goldreich-Micali-Wigderson protocol, and Homomorphic Encryption. We then propose an algorithm for securely computing minima in the semi-honest model that, compared to current state-of-the-art, reduces communication overheads by 18 % to 98 %. Lower communication overheads result in faster runtimes in constrained networks and lower direct costs for users.

Supplementary material


  1. 1.
    Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer and extensions for faster secure computation. In: ACM CCS. ACM (2013)Google Scholar
  2. 2.
    Barker, E., Barker, W., Burr, W., Polk, W., Smid, M.: Nist special publication 800–57. NIST Special Publication 800(57), 1–142 (2007)Google Scholar
  3. 3.
    Bellare, M., Hoang, V.T., Keelveedhi, S., Rogaway, P.: Efficient garbling from a fixed-key blockcipher. In: IEEE SP, pp. 478–492. IEEE (2013)Google Scholar
  4. 4.
    Carter, H., Amrutkar, C., Dacosta, I., Traynor, P.: For your phone only: custom protocols for efficient secure function evaluation on mobile devices. SCN 7(7), 1165–1176 (2014)Google Scholar
  5. 5.
    Carter, H., Lever, C., Traynor, P.: Whitewash: Outsourcing garbled circuit generation for mobile devices. In: ACSAC, pp. 266–275. ACM (2014)Google Scholar
  6. 6.
    Carter, H., Mood, B., Traynor, P., Butler, K.: Secure outsourced garbled circuit evaluation for mobile devices. In: USENIX Security. USENIX (2013)Google Scholar
  7. 7.
    Costantino, G., Martinelli, F., Santi, P., Amoruso, D.: An implementation of secure two-party computation for smartphones with application to privacy-preserving interest-cast. In: PST, pp. 9–16 (2012)Google Scholar
  8. 8.
    Damgard, I., Geisler, M., Kroigard, M.: Homomorphic encryption and secure comparison. Int. J. Appl. Crypt. 1(1), 22–31 (2008)zbMATHMathSciNetCrossRefGoogle Scholar
  9. 9.
    De Cristofaro, E., Faber, S., Gasti, P., Tsudik, G.: Genodroid: are privacy-preserving genomic tests ready for prime time? In: ACM WPES. ACM (2012)Google Scholar
  10. 10.
    Demmler, D., Schneider, T., Zohner, M.: Ad-hoc secure two-party computation on mobile devices using hardware tokens. In: USENIX Security (2014)Google Scholar
  11. 11.
    Demmler, D., Schneider, T., Zohner, M.: ABY - a framework for efficient mixed-protocol secure two-party computation. In: NDSS (2015)Google Scholar
  12. 12.
    Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I., Toft, T.: Privacy-preserving face recognition. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol. 5672, pp. 235–253. Springer, Heidelberg (2009) CrossRefGoogle Scholar
  13. 13.
    Erkin, Z., Veugen, T., Toft, T., Lagendijk, R.L.: Privacy-preserving user clustering in a social network. In: IEEE WIFS, pp. 96–100. IEEE (2009)Google Scholar
  14. 14.
    Erkin, Z., Veugen, T., Toft, T., Lagendijk, R.L.: Generating private recommendations efficiently using homomorphic encryption and data packing. IEEE Trans. Inf. Forensics Secur. 7(3), 1053–1066 (2012)CrossRefGoogle Scholar
  15. 15.
    Franz, M., Deiseroth, B., Hamacher, K., Jha, S., Katzenbeisser, S., Schröder, H.: Towards secure bioinformatics services (Short Paper). In: Danezis, G. (ed.) FC 2011. LNCS, vol. 7035, pp. 276–283. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  16. 16.
    Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: ACM STOC, pp. 218–229. ACM (1987)Google Scholar
  17. 17.
    Huang, Y., Evans, D., Katz, J., Malka, L.: Efficient privacy-preserving biometric identification. In: NDSS (2011)Google Scholar
  18. 18.
    Huang, Y., Chapman, P., Evans, D.: Privacy-preserving applications on smartphones. In: USENIX HotSec. USENIX (2011)Google Scholar
  19. 19.
    Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: USENIX Security. USENIX (2011)Google Scholar
  20. 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) CrossRefGoogle Scholar
  21. 21.
    Kerschbaum, F., Biswas, D., de Hoogh, S.: Performance comparison of secure comparison protocols. In: DEXA, pp. 133–136. IEEE (2009)Google Scholar
  22. 22.
    Kolesnikov, V., Sadeghi, A.-R., Schneider, T.: Improved garbled circuit building blocks and applications to auctions and computing minima. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 1–20. Springer, Heidelberg (2009) CrossRefGoogle Scholar
  23. 23.
    Kolesnikov, V., Sadeghi, A.R., Schneider, T.: From dust to dawn: practically efficient two-party secure function evaluation protocols and their modular design. IACR Cryptology ePrint Archive (2010)Google Scholar
  24. 24.
    Kolesnikov, V., Schneider, T.: Improved garbled circuit: free XOR gates and applications. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 486–498. Springer, Heidelberg (2008) CrossRefGoogle Scholar
  25. 25.
    Kreuter, B., Shelat, A., Mood, B., Butler, K.R.: PCF: a portable circuit format for scalable two-party secure computation. In: USENIX Security. USENIX (2013)Google Scholar
  26. 26.
    Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - a secure two-party computation system. In: USENIX Security. USENIX (2004)Google Scholar
  27. 27.
    Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA, pp. 448–457. SIAM (2001)Google Scholar
  28. 28.
    Naor, M., Pinkas, B.: Computationally secure oblivious transfer. J. Cryptology 18(1), 1–35 (2005)zbMATHMathSciNetCrossRefGoogle Scholar
  29. 29.
    Paillier, P.: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999) CrossRefGoogle Scholar
  30. 30.
    Rane, S., Boufounos, P.: Privacy-preserving nearest neighbor methods. IEEE Signal Process. Mag. 30(2), 18–28 (2013)CrossRefGoogle Scholar
  31. 31.
    Schneider, T., Zohner, M.: GMW vs. Yao? efficient secure two-party computation with low depth circuits. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 275–292. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  32. 32.
  33. 33.
    Songhori, E.M., Hussain, S.U., Sadeghi, A.R., Schneider, T., Koushanfar, F.: TinyGarble: highly compressed and scalable sequential garbled circuits. In: IEEE SP. IEEE (2015)Google Scholar
  34. 34.
    Veugen, T.: Improving the DGK comparison protocol. In: IEEE WIFS. IEEE (2012)Google Scholar
  35. 35.
    Yao, A.: How to generate and exchange secrets. In: FOCS, pp. 62–167. IEEE (1986)Google Scholar
  36. 36.
    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) Google Scholar
  37. 37.
    Ziegeldorf, J.H., Metzke, J., Henze, M., Wehrle, K.: Choose wisely: a comparison of secure two-party computation frameworks. In: IEEE SPW. IEEE (2015)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Jan Henrik Ziegeldorf
    • 1
    Email author
  • Jens Hiller
    • 1
  • Martin Henze
    • 1
  • Hanno Wirtz
    • 1
  • Klaus Wehrle
    • 1
  1. 1.Communication and Distributed Systems (COMSYS)RWTH Aachen UniversityAachenGermany

Personalised recommendations