Главная
Study mode:
on
1
Intro
2
Part I: Correlated pseudorandom functions
3
Part II: Low-complexity weak PRFs
4
Secure multi-party computation (MPC)
5
Secure MPC with preprocessing Beaver91
6
Pseudorandom correlation generator (PCG)
7
Pseudorandom correlation function (PCF)
8
Construction of PCFs
9
Weak pseudorandom function (weak PRF)
10
Function secret sharing (FSS)
11
Towards instantiating the building blocks
12
Dual Learning Parity with (Regular) Noise
13
Towards exponential stretch
14
A different point of view
15
Security Analysis
16
Security against XOR-related-key attacks
17
Concrete efficiency
18
Summary Variable-Density Learning Parity with Noise assumption - can be proven to withstand large class of attacks
Description:
Explore a 20-minute IEEE conference talk on correlated pseudorandom functions derived from variable-density LPN. Delve into the construction of pseudorandom correlation functions (PCFs) and their applications in secure multi-party computation. Examine weak pseudorandom functions, function secret sharing, and the Variable-Density Learning Parity with Noise assumption. Gain insights into security analysis, including resistance against XOR-related-key attacks, and understand the concrete efficiency of these cryptographic primitives.

Correlated Pseudorandom Functions from Variable-Density LPN

IEEE
Add to list
0:00 / 0:00