Главная
Study mode:
on
1
Intro
2
Constructions of io
3
Our Template (in detail)
4
Projective Arithmetic FE (PAFE)
5
Efficiency
6
Sub-linear (Secret Key) FE for Boolean circuits
7
Construction of Sub-linear FE
8
Instantiation of degree-5 randomizing polynomials
9
Slotted Encodings
10
Construction of PAFE (Intuition)
11
Conclusions
12
Future Directions
Description:
Explore a groundbreaking cryptography paper presented at Eurocrypt 2017 by Prabhanjan Ananth and Amit Sahai. Delve into the concepts of Projective Arithmetic Functional Encryption (PAFE) and Indistinguishability Obfuscation from degree-5 randomizing polynomials. Learn about the detailed template for constructing indistinguishability obfuscation, the efficiency of PAFE, and sub-linear functional encryption for Boolean circuits. Examine the construction of sub-linear FE, instantiation of degree-5 randomizing polynomials, and slotted encodings. Gain insights into the intuition behind PAFE construction, and discover potential future directions in this field of cryptography.

Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree

TheIACR
Add to list