Boolean Searchable Symmetric Encryption with Worst Case Sub Linear Complexity

Name: Boolean Searchable Symmetric Encryption with Worst Case Sub Linear Complexity
Uploaded: 2017-01-01
Duration: 23 min 26 s
Description: Boolean Searchable Symmetric Encryption with Worst Case Sub Linear Complexity — a 2017 Eurocrypt 2017 security conference talk on crypto (23:26 min). Watch the full video, indexed free on the Breach Arc Archive.

Eurocrypt 2017 · 2017 · 23:26

▶

Boolean Searchable Symmetric Encryption with Worst Case Sub Linear Complexity — a 2017 Eurocrypt 2017 security conference talk on crypto (23:26 min). Watch the full video, indexed free on the Breach Arc Archive.

▶ Watch video on YouTube

crypto

← Back to the Breach Arc Archive