Explore order-revealing encryption (ORE) in this conference talk presented at CCS 2016. Delve into new constructions, applications, and lower bounds of ORE as discussed by Kevin Lewi and David J. Wu from Stanford University. Learn about searching on encrypted data, the landscape of ORE, online vs. offline security, and encrypted range queries. Discover small-domain ORE with best-possible security and domain extension techniques. Examine performance evaluations and draw insights from the conclusions presented in this comprehensive overview of order-revealing encryption advancements.
Order-Revealing Encryption - New Constructions, Applications, and Lower Bounds
Association for Computing Machinery (ACM) via YouTube
Overview
Syllabus
Intro
Searching on Encrypted Data
The Landscape of ORE
Online vs. Offline Security
Encrypted Range Queries
Small-Domain ORE with Best-Possible Security
Domain Extension for ORE
Performance Evaluation
Conclusions
Taught by
ACM CCS
