Reading the Crypto Classics: Song, Wagner, and Perrig: „Practical Techniques for Searches on Encrypted Data“

2020/12/02 10:00-11:00

Moderator: Christian Janson, TU Darmstadt, Cryptoplexity Group | Location: Online

Organizer: Christian Janson


This talk is the first one in the seminar series “Reading the Crypto Classics” for the very special winter term 2020/2021. The idea of this seminar is to jointly read classical milestone papers in the area of cryptography, to discuss their impact and understand their relevance for current research areas. The seminar is running as an Oberseminar, but at the same time meant to be a joint reading group seminar of the CROSSING Special Interest Group on Advanced Cryptography with all interested CROSSING members being invited to participate.

This issue will cover the paper/talk

Song, Wagner, and Perrig: „Practical Techniques for Searches on Encrypted Data“ (IEEE S&P 2000); DOI: 10.1109/SECPRI.2000.848445

with the following abstract:

“It is desirable to store data on data storage servers such as mail servers and file servers in encrypted form to reduce security and privacy risks. But this usually implies that one has to sacrifice functionality for security. For example, if a client wishes to retrieve only documents containing certain words, it was not previously known how to let the data storage server perform the search and answer the query, without loss of data confidentiality. We describe our cryptographic schemes for the problem of searching on encrypted data and provide proofs of security for the resulting crypto systems. Our techniques have a number of crucial advantages. They are provably secure: they provide provable secrecy for encryption, in the sense that the untrusted server cannot learn anything about the plaintext when only given the ciphertext; they provide query isolation for searches, meaning that the untrusted server cannot learn anything more about the plaintext than the search result; they provide controlled searching, so that the untrusted server cannot search for an arbitrary word without the user's authorization; they also support hidden queries, so that the user may ask the untrusted server to search for a secret word without revealing the word to the server. The algorithms presented are simple, fast (for a document of length n, the encryption and search algorithms only need O(n) stream cipher and block cipher operations), and introduce almost no space and communication overhead, and hence are practical to use today.”

Further information about the virtual format

For participation the following Zoom-Link and login data are required: Meeting-ID: 848 3831 0062
Kenncode: 517749

More information