Advanced Public-Key Encryption

on YouTube ↗41m

" summary

Two linked contributions: a DCR/Paillier-style additively homomorphic scheme that moves most work offline using an apps function so online encryption costs one modular addition online with ciphertexts remaining compact, provable under CCR/decisional CCR and used to build trapdoor commitments and chameleon signatures; and a generalized compiler for pairing-based ABE that extends pairing encodings to support decentralized multi-authority ABE, hashes and unbounded NOT, instantiated under a q-type bilinear assumption, taking pair-encodings plus group choices as input (prototype compilers are in progress).

AI-written summary · about

" chapters (10)

1. 0:00Introduction to talk
2. 1:55Additively homomorphic encryption
3. 6:27Fast online/offline encryption
4. 12:19Applications trapdoor commitments
5. 17:34Conclusion and Q&A
6. 19:25Motivation for ABE research
7. 22:14Introduction to ABE
8. 26:36Pair encodings framework
9. 33:00New compiler for practical features
10. 36:31Conclusion and Q&A

" related talks

• 21mLattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABEVinod Vaikuntanathan, Zvika Brakerski · ITCS 2022
• 01h 00mSecure Computation 3Peter Scholl · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 36mPublic Key CryptographyOlivier Blazy, Loïc Ferreira · RSA Conference 2024
• 46mCryptography with Certified DeletionDakshita Khurana · Minimal Complexity Assumptions for Cryptography 2023
• 46mOptimal Broadcast Encryption and More from Evasive LWEHoeteck Wee · Quantum and Lattices Joint Reunion Workshop
• 51mNew Ways to Garble Arithmetic CircuitsRachel Lin · Minimal Complexity Assumptions for Cryptography 2023
• 01h 10mSecure Multiparty Computation IIYuval Ishai · Cryptography Boot Camp 2015
• 40mIt’s a Kind Of Magic: Computation on CiphertextsMaarten Everts · GOTO Amsterdam 2023