Rethinking Searchable Symmetric Encryption

Rethinking Searchable Symmetric Encryption

Explore a 15-minute IEEE conference talk that delves into the concept of Searchable Symmetric Encryption, presented by experts Zichen Gui and Kenneth G. Paterson from ETH Zurich, Switzerland, and Sikhar Patranabis from IBM Research, India. Gain insights into the latest developments and potential reimagining of this cryptographic technique, which allows for secure searching of encrypted data without compromising privacy or security.