Efficient data intensive secure computation: fictional or real

Changyu Dong

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

12 Downloads (Pure)

Abstract

Secure computation has the potential to completely reshape the cybersecruity landscape, but this will happen only if we can make it practical. Despite significant improvements recently, secure computation is still orders of magnitude slower than computation in the clear. Even with the latest technology, running the killer apps, which are often data intensive, in secure computation is still a mission impossible. In this paper, I present two approaches that could lead to practical data intensive secure computation. The first approach is by designing data structures. Traditionally, data structures have been widely used in computer science to improve performance of computation. However, in secure computation they have been largely overlooked in the past. I will show that data structures could be effective performance boosters in secure computation. Another approach is by using fully homomorphic encryption (FHE). A common belief is that FHE is too inefficient to have any practical applications for the time being. Contrary to this common belief, I will show that in some cases FHE can actually lead to very efficient secure computation protocols. This is due to the high degree of internal parallelism in recent FHE schemes. The two approaches are explained with Private Set Intersection (PSI) as an example. I will also show the performance figures measured from prototype implementations.
Original languageEnglish
Title of host publicationSecurity Protocols XXIII
Subtitle of host publication23rd International Workshop, Cambridge, UK, March 31 - April 2, 2015, Revised Selected Papers
EditorsBruce Christianson, Petr Švenda, Vashek Matyáš, James Malcolm, Frank Stajano, Jonathan Anderson
PublisherSpringer International Publishing AG
Pages1-11
Number of pages11
Volume9379
Edition1
ISBN (Print)978-3-319-26095-2
Publication statusPublished - 16 Dec 2015

Publication series

NameSecurity and Cryptology
PublisherSpringer International Publishing

    Fingerprint

Keywords

  • secure computation
  • data structures
  • homomorphic encryption (FHE)

Cite this

Dong, C. (2015). Efficient data intensive secure computation: fictional or real. In B. Christianson, P. Švenda, V. Matyáš, J. Malcolm, F. Stajano, & J. Anderson (Eds.), Security Protocols XXIII: 23rd International Workshop, Cambridge, UK, March 31 - April 2, 2015, Revised Selected Papers (1 ed., Vol. 9379, pp. 1-11). (Security and Cryptology). Springer International Publishing AG.