Non-traditional Encryption Problems And Solutions
summary
Covers concrete tradeoffs: FF1 vs FF3-1 for format‑preserving encryption, warns FF1 patent risk and recommends ~1,000,000 effective values; shows FF1 ≈ eight rounds, FF3‑1 ≈ ten. Describes deterministic encryption for equality joins and how frequency analysis leaks low‑entropy fields. Explains searchable and indexed keyword schemes and a non‑deterministic MongoDB queryable encryption (public preview, heavy index and ~5× storage and slow inserts). Explains homomorphic examples, mentions Microsoft SEAL, and notes fully homomorphic is currently impractical (orders‑of‑magnitude slowdowns).
AI-written summary · about
chapters (11)
- 0:00Intro
- 1:50Traditional Encryption Design
- 5:06Conceptual Example
- 7:00Standard Algorithms
- 9:12FF1 and FF3-1 Details
- 14:34Deterministic Encryption Problems
- 17:35Searchable Symmetric Encryption
- 24:43Homomorphic Encryption Example Plaintext
- 26:44Homomorphic Encryption Scenario
- 28:57Practical Homomorphic Encryption
- 35:32Queryable Encryption - Drawbacks
related talks
37mFrontiers in Cryptography
41mKeeping Secrets: Emerging Practice in Database Encryption
32mEncryption - A Deeper Review
33mHomomorphic Encryption in the Open Source World
23mEncrypted Search Party
51mWhere should I be encrypting my data
51mDon’t Throw Away the Key: What Developers Should Know about Encryption
01h 07mIntroduction to cryptography