Главная
Study mode:
on
1
Intro
2
Background
3
Current Situation
4
Agenda
5
Adaptive Security
6
Template Construction
7
Simulation Trapdoor
8
Simulation
9
Fourier IBE
10
Modulus Size
11
Simulation Results
12
Obstacles
13
Putting everything together
14
The main idea
15
The polynomial ring
16
Why is it a scalar
17
Ignored problems
18
Linear maps
19
Hardcore functions
20
Mental experiment
21
Combining everything together
22
Comparison
23
Summary
Description:
Explore a comprehensive talk from Asiacrypt 2016 on partitioning via non-linear polynomial functions and compact identity-based encryption (IBE) schemes from ideal lattices. Delve into adaptive security, template construction, and simulation techniques presented by Shuichi Katsumata and Shota Yamada. Learn about Fourier IBE, modulus size considerations, and simulation results. Examine obstacles in implementation and discover how various components are integrated. Investigate the polynomial ring concept, scalar properties, and potential issues. Gain insights into linear maps, hardcore functions, and mental experiments. Compare the presented approach with existing methods and grasp the key takeaways from this cutting-edge cryptographic research.

Partitioning via Non Linear Polynomial Functions - More Compact IBEs from Ideal Lattices

TheIACR
Add to list
0:00 / 0:00