Title

Efficient Dynamic Searchable Encryption with Forward Privacy

Abstract

Abstract

Searchable symmetric encryption (SSE) enables a client to perform
searches over its outsourced encrypted files while preserving privacy
of the files and queries. We present a new dynamic SSE scheme that
achieves forward privacy, where a newly added file cannot be linked to
previous searches. Our scheme is efficient and parallelizable and
outperforms the best previous schemes providing forward privacy, and
achieves competitive performance with dynamic schemes without forward
privacy. We provide a full security proof in the random oracle model.
In our experiments on the Wikipedia archive of about four million
pages, the server takes one second to perform a search with 100,000
results.

Biography: Alptekin Küpçü received his Ph.D. degree from Brown University
Computer Science Department in 2010. Since then, he has been working
as a faculty at Koç University, and leading the Cryptography, Security
& Privacy Research Group he founded. His research mainly focuses on
applied cryptography, with applications to cloud security,
privacy-preserving machine learning, peer-to-peer networks,
blockchains, and game theory and mechanism design. He has also led the
development of the Cashlib cryptographic library, which is available
as open source online. Dr. Küpçü has various accomplishments including
5 international patents granted, 11 funded research projects (for 9 of
which he was the principal investigator), 2 European Union COST Action
management committee memberships, 4 Teaching Awards, 2 Outstanding
Young Scientist Awards (BAGEP and GEBİP), METU Parlar Foundation
Research Encouragement Award, ACM and IEEE Senior Member Awards, and
the Royal Society of UK Newton Advanced Fellowship. For more
information, visit https://crypto.ku.edu.tr

Supervisor(s)

Supervisor(s)

Alptekin Küpçü

Date and Location

Date and Location

2020-03-11;11:00:00-A101

Category

Category

Seminar