Science

The Magic World of Searchable Symmetric Encryption

A brief introduction to search over encrypted data
In the last couple of years, cloud and web services have become more and more popular. Since Snowden we know for sure that intelligence agencies have access to the data storage of an service provider, either by (forced) cooperation, or espionage. Thus, to protect our privacy we have to encrypted our data before hand it over to our service provider (data holder). But this approach contradicts the very idea of a web service where the data holder have to process our data in one way or an other. Therefore, we need new cryptographic techniques to enable the data holder to perform operation on encrypted data. One of the most important operations for cloud storage or database based web/cloud services is the search operation. In this talk we focus on the very familiar cloud storage scenario. Because in this scenario, It is obvious, that the user (data owner) do not want to perform the search by himself. This should be a service offered by the data holder. We will present different practical approaches to achieve searchable ciphertext, namely one with an index and one with cleverly encrypted words. Note that no PhD is required to attend this talk ;-)
We found that many people cannot believe that it is possible to execute operations on ciphertext. We want to rectify this by educating hackers of the magic of searchable encryption schemes. Intro "The Cloud" has undoubtedly become very popular over the last decade. Many people like the convenience of virtually unlimited storage and computing power at their fingertips. However, people tend to dislike to disclose their data to third parties. A simple solution would be encrypt the data before uploading it to a third party, but you may very well want to perform certain operations on the encrypted data such as a search. Entering Searchable Encryption This conflict of encryption and the ability to execute computations on data seems to be inherent. However, clever encryption schemes which allow certain search operations on ciphertext exist! We will present some searchable symmetric encryption schemes which enable others to search for keywords or substrings without learning they key nor the plaintext. You may very well ask what the security implications in those cases are, so we will present the associated security notions. Another concern is performance reg. speed or memory consumption. We present our measurements of prototypical implementations and infer that searchable symmetric encryption schemes can indeed be practical. Our vision is to store data remotely in an encrypted fashion without losing convenience of using third party applications. We want to enable developers to secure their databases and we want to make users aware of advances in cryptography so that they demand more secure services. Given the properties, other use cases of secure keyword search include email or document storage. In fact, it is possible to not only secure relational databases, but to create secure big data scenarios where massive amounts of data are being handled.

Additional information

Type lecture
Language English

More sessions

12/27/15
Science
greenstadt
Hall 2
What does the fact that Tor users can’t edit wikipedia mean for the quality of the ``encyclopedia that anyone can edit?’’ How do captchas and blocking of anonymity services affect the experiences of Tor users when they are trying to contribute content? This talk will discuss the increasing limitations of active participation in the anonymous Internet and the findings of our interview study of Tor users and wikipedia editors concerning these issues. We believe that by understanding the ...
12/27/15
Science
Hall 6
The REXUS/BEXUS programme allows students from universities and higher education colleges across Europe to carry out scientific and technological experiments on research rockets and balloons. Each year, two rockets and two balloons are launched, carrying up to 20 experiments designed and built by student teams. By reference of two experiments we were involved in, we will explain the way from the experiment idea to the launch and test of it.
12/27/15
Science
Philipp Winter
Hall 1
Several years ago, the Great Firewall of China was silently upgraded to find and block circumvention servers that employ encryption to defeat deep packet inspection. The system is now used to block protocols such as Tor, SoftEther, and SSH. In this talk, we will give an overview of how this system works, and how it can be circumvented.
12/27/15
Science
Peter Buschkamp
Hall 6
Light of astronomical objects gets distorted as it passes earth’s atmosphere. Adaptive optics can correct this distortion and create images that are as sharp as those taken in space. The correction needs a bright reference star. If there is no such star nearby, an artificial Laser Guide Star can be created in the upper atmosphere.
12/28/15
Science
Julia Maria Mönig
Hall G
In my talk I am 1) discussing philosophical concepts of privacy, especially Hannah Arendt's philosophy. I am 2) explaining why in a liberal-democratic system we need to protect our privacy and 3) what we can morally do to prevent catastrophes such as a totalitarian system from happening again. With Hannah Arendt's arguments and her analysis of totalitarian systems in mind, I am referring to three examples from today's privacy discussions: cybermobbing, Behavioral Advertising and secret services.
12/28/15
Science
Cornelius Diekmann
Hall G
We develop a tool to verify Linux netfilter/iptables firewalls rulesets. Then, we verify the verification tool itself. Warning: involves math! This talk is also an introduction to interactive theorem proving and programming in Isabelle/HOL. We strongly suggest that audience members have some familiarity with functional programming. A strong mathematical background is NOT required. TL;DR: Math is cool again, we now have the tools for "executable math". Also: iptables!
12/28/15
Science
Nicolas Pouillard
Hall 6
In this presentation I will present the experimental language Ling. We shall get an intuitive understanding of the language through familiar concepts from imperative programming. We shall cover how Ling enables a modular and precise control on memory allocation, through a general optimization called fusion. This optimization, fusion is a cost-free abstraction mechanism which brings high level programming to system programming.