YoVDO

Succinct and Adaptively Secure ABE for Arithmetic Branching Programs from k-Lin

Offered By: TheIACR via YouTube

Tags

Attribute-Based Encryption Courses Secure Computation Courses

Course Description

Overview

Explore a conference talk from Asiacrypt 2020 that presents a paper on succinct and adaptively secure Attribute-Based Encryption (ABE) for arithmetic branching programs from k-Lin. Delve into the framework proposed by Lin and Luo, which builds upon previous work from Eurocrypt. Learn about key concepts such as adaptive IND-CPA security, arithmetic key garbling schemes, and inner-product functional encryption. Examine the modified proof techniques with less hardwiring and simulation security. Gain insights into piecewise security, special simulation structures, and gradual simulation security as applied to ABE schemes.

Syllabus

Intro
Attribute-Based Encryption [SW05]
Adaptive IND-CPA Security
Framework of [LL20, Eurocrypt]
Framework of This Work
Arithmetic Key Garbling Scheme X
Inner-Product Functional Encryption X
1-ABE via AKGS and IPFE
Security: x then f
Hardwiring Less: Piecewise Security LL20, EC
Hardwiring Less: Special Simulation Structure
Modified Proof with Less Hardwiring
Replacing Function-Hiding: Simulation Security
Modified Proof with Simulation
Gradual Simulation Security


Taught by

TheIACR

Related Courses

Applied Cryptography
University of Virginia via Udacity
Perfectly Oblivious RAM and Parallel RAM Revisited - Improved Constructions
Paul G. Allen School via YouTube
ZK-PCPs from Leakage-Resilient Secret Sharing - 2021 ITC Conference
Paul G. Allen School via YouTube
Scalable Verification of Zero Knowledge Protocols
IEEE via YouTube
On Black-Box Knowledge-Sound Commit-and-Prove SNARKs
TheIACR via YouTube