Encrypted Search Party
summary
Claim: encrypted columns can stay queryable by revealing order not plaintext. Demonstrates Order Revealing Encryption with a Ruby toy-ore gem, shows deterministic vs nondeterministic encryption failing or enabling equality queries, and builds left/right ciphertexts that carry offsets IVs and encrypted comparison vectors. Explains two keys (a hash key and shuffle key), shows database-side comparisons and a working sort/range example, and notes practical limits like domain size and the order-leakage tradeoff.
AI-written summary · about
chapters (6)
- 0:00Ruby and crypto journey
- 3:58Application encryption
- 8:38Order revealing encryption
- 15:23ORE in database queries
- 18:17Demo of toy ORE library
- 22:12Summary
related talks
10mEncryption Pitfalls and Workarounds
41mNon-traditional Encryption Problems And Solutions
34mWhy your encrypted Database isn't secure: practical attacks against encrypted OSS databases
31mFast, highly effective database security using searchable encryption (without the yak shave)
44mBreaking Encrypted Databases: Generic Attacks on Range Queries
37mFrontiers in Cryptography
38mActiveRecord::Encryption; Stop Hackers from...
40mTrust No One