Frontiers in Cryptography
summary
Survey of concrete primitives and tradeoffs: demonstrations of order‑revealing encryption and searchable symmetric encryption that leak access patterns without ORAM, a claim that fully homomorphic schemes are still about a million times slower than plain computation, and concrete libraries and systems — Microsoft SEAL and CryptoNet for ML on ciphertext, SGX enclaves and VC3 for Hadoop with Intel attestation but vendor signing concerns, and Chrome shipping a NewHope+EC hybrid; quantum breakpoints cited as ~2,000 qubits for ECC and ~496 qubits for 2048‑bit RSA.
AI-written summary · about
chapters (18)
- 0:00Intro
- 0:34Disclaimer
- 1:15How would aliens encrypt?
- 1:55Diffie-Hellman (1976)
- 2:40Public-Key Cryptography
- 3:01Non-Secret Encryption
- 9:05Indistinguishability
- 10:12Encrypted Databases
- 11:28"Encrypted E-mail" Service
- 12:06Property-Preserving Encryption
- 14:12Deterministic Encryption
- 16:13Oblivious RAM (ORAM)
- 17:38Functional Encryption
- 18:11Homomorphic Encryption
- 22:20Intel SGX and AMD SEV
- 27:19Group Homomorphisms
- 27:47Shor's Algorithm
- 30:31Post-Quantum Public Key Encryption Algorithms
related talks
41mNon-traditional Encryption Problems And Solutions
01h 02mFrom Basic Idea to Impact: the story of modern cryptography
40mAsymmetric Encryption: A Deep Dive
17mPreview: Security and Privacy
58mKeynote: Crypto means Cryptography!
40mConfidential Computing and Privacy-Enhancing Technologies - The Landscape
52mMore Secrets of Cryptography
13mSurvey of Privacy Solutions for Minimizing MEV