Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Boolean Searchable Symmetric Encryption with Worst Case Sub Linear Complexity

TheIACR via YouTube

Overview

Explore a groundbreaking paper on Boolean Searchable Symmetric Encryption presented at Eurocrypt 2017. Delve into the innovative approach developed by Seny Kamara and Tarik Moataz, which achieves worst-case sub-linear complexity. Examine the blackbox construction, single keyword construction, and data structures used in this cryptographic solution. Gain insights into the security aspects, intuition behind the design, and key algorithms such as IEXToken, Gate, and Search. Analyze the leakage, complexity, and compact construction of this novel encryption method. Evaluate the new construction and its potential impact on the field of searchable encryption.

Syllabus

Introduction
Blackbox construction
Single keyword construction
Data structures
Security
Intuition
IEX
Token Algorithm
Gate Algorithm
Search Algorithm
Leakage
Complexity
Compact Construction
New Construction
Evaluation
Occlusion

Taught by

TheIACR

Reviews

Start your review of Boolean Searchable Symmetric Encryption with Worst Case Sub Linear Complexity

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.