Skip to main content
SpringerLink
Log in

A Practical Analysis of Oblivious Sorting Algorithms for Secure Multi-party Computation

  • Conference paper
Secure IT Systems (NordSec 2014)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 8788))

Included in the following conference series:

Abstract

Cryptographic secure computing methods like secure multi-party computation, circuit garbling and homomorphic encryption are becoming practical enough to be usable in applications. Such applications need special data-independent sorting algorithms to preserve privacy. In this paper, we describe the design and implementation of four different oblivious sorting algorithms. We improve two earlier designs based on sorting networks and quicksort with the capability of sorting matrices. We also propose two new designs—a naive comparison-based sort with a low round count and an oblivious radix sort algorithm that does not require any private comparisons. For all these algorithms, we present thorough complexity and performance analysis including detailed breakdown of running-time, network and memory usage.

This research was supported by the European Regional Development Fund through Centre of Excellence in Computer Science (EXCS); the European Social Fund Doctoral Studies and Internationalisation programme DoRa; the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement no. 284731; and by the Estonian Research Council under Institutional Research Grants IUT2-1 and IUT27-1.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bogdanov, D.: Sharemind: programmable secure computations with practical applications. PhD thesis, University of Tartu (2013)

    Google Scholar 

  2. Bogdanov, D., Laud, P., Randmets, J.: Domain-Polymorphic Programming of Privacy-Preserving Applications. In: Proc. of PETShop 2013. ACM Digital Library, pp. 23–26. ACM (2013)

    Google Scholar 

  3. Bogdanov, D., Laur, S., Talviste, R.: Oblivious Sorting of Secret-Shared Data. Technical Report T-4-19, Cybernetica (2013), http://research.cyber.ee/

  4. Bogdanov, D., Niitsoo, M., Toft, T., Willemson, J.: High-performance secure multi-party computation for data mining applications. International Journal of Information Security 11(6), 403–418 (2012)

    Article  Google Scholar 

  5. Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.: SEPIA: privacy-preserving aggregation of multi-domain network events and statistics. In: Proc. of USENIX Conference on Security. USENIX Association (2010)

    Google Scholar 

  6. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: Proc. of FOCS 2001, pp. 136–145. IEEE Computer Society (2001)

    Google Scholar 

  7. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Counting Sort. In: Introduction to Algorithms, ch. 8.2, 2nd edn., pp. 168–170. MIT Press, McGraw-Hill (2001)

    Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1–12. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  10. Edmonds, J.: Counting Sort (a Stable Sort). In: How to Think about Algorithms, ch. 5.2, pp. 72–75. Cambridge University Press (2008)

    Google Scholar 

  11. Evfimievski, A.V., Srikant, R., Agrawal, R., Gehrke, J.: Privacy preserving mining of association rules. In: Proc. of KDD 2002, pp. 217–228 (2002)

    Google Scholar 

  12. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proc. of STOC 2009, pp. 169–178. ACM (2009)

    Google Scholar 

  13. Goethals, B., Laur, S., Lipmaa, H., Mielikäinen, T.: On private scalar product computation for privacy-preserving data mining. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 104–120. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Hamada, K., Ikarashi, D., Chida, K., Takahashi, K.: Oblivious radix sort: An efficient sorting algorithm for practical secure multi-party computation. Cryptology ePrint Archive, Report 2014/121 (2014), http://eprint.iacr.org/

  15. Hamada, K., Kikuchi, R., Ikarashi, D., Chida, K., Takahashi, K.: Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 202–216. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  16. Hollerith, H.: US395781 (A) - ART OF COMPILING STATISTICS. European Patent Office (1889), http://worldwide.espacenet.com/publicationDetails/biblio?CC=US&NR=395781

  17. Jónsson, K.V., Kreitz, G., Uddin, M.: Secure Multi-Party Sorting and Applications. Cryptology ePrint Archive, Report 2011/122 (2011), http://eprint.iacr.org/

  18. Knuth, D.E.: The art of computer programming, 2nd edn. Sorting and searching, vol. 3. Addison Wesley Longman Publishing Co., Inc., USA (1998)

    Google Scholar 

  19. Laur, S., Willemson, J., Zhang, B.: Round-Efficient Oblivious Database Manipulation. In: Lai, X., Zhou, J., Li, H. (eds.) ISC 2011. LNCS, vol. 7001, pp. 262–277. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  20. Machanavajjhala, A., Kifer, D., Gehrke, J., Venkitasubramaniam, M.: L-diversity: Privacy beyond k-anonymity. ACM Trans. Knowl. Discov. Data 1(1), 3 (2007)

    Article  Google Scholar 

  21. Narayanan, A., Shmatikov, V.: Robust de-anonymization of large sparse datasets. In: Proc. of IEEE S&P 2008, pp. 111–125 (2008)

    Google Scholar 

  22. 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)

    Chapter  Google Scholar 

  23. Shamir, A.: How to share a secret. Comm. of the ACM 22, 612–613 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  24. Sweeney, L.: k-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 10(5), 557–570 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  25. Wang, G., Luo, T., Goodrich, M.T., Du, W., Zhu, Z.: Bureaucratic protocols for secure two-party sorting, selection, and permuting. In: Proc. of ASIACCS 2010, pp. 226–237. ACM (2010)

    Google Scholar 

  26. Zhang, B.: Generic Constant-Round Oblivious Sorting Algorithm for MPC. In: Boyen, X., Chen, X. (eds.) ProvSec 2011. LNCS, vol. 6980, pp. 240–256. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cybernetica, Mäealuse 2/1, 12618, Tallinn, Estonia

    Dan Bogdanov & Riivo Talviste

  2. Institute of Computer Science, University of Tartu, Liivi 2, 50409, Tartu, Estonia

    Sven Laur & Riivo Talviste

Authors
  1. Dan Bogdanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sven Laur
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Riivo Talviste
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dan Bogdanov .

Editor information

Editors and Affiliations

  1. SINTEF ICT, Trondheim, Norway

    Karin Bernsmed

  2. Karlstad University, Karlstad, Sweden

    Simone Fischer-Hübner

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Bogdanov, D., Laur, S., Talviste, R. (2014). A Practical Analysis of Oblivious Sorting Algorithms for Secure Multi-party Computation. In: Bernsmed, K., Fischer-Hübner, S. (eds) Secure IT Systems. NordSec 2014. Lecture Notes in Computer Science(), vol 8788. Springer, Cham. https://doi.org/10.1007/978-3-319-11599-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11599-3_4

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11598-6

  • Online ISBN: 978-3-319-11599-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation