The presentation discusses various techniques for encrypting data in databases, including deterministic encryption, searchable encryption, and homomorphic encryption.
- Deterministic encryption allows for searches on equality while keeping data encrypted
- Searchable encryption allows for searching for keywords in encrypted documents by encrypting the keywords and storing them in a database
- Homomorphic encryption allows for performing operations on encrypted data in a way that is equivalent to performing the operations before encryption
- Each technique has its limitations and trade-offs
- Maintaining an index of keyword frequency can improve the security of searchable encryption