Calendrier de Évènements
L lun
M mar
M mer
J jeu
V ven
S sam
D dim
0 évènement,
1 évènement,
Séminaire Algortihmique : « Efficient and succinct zero-knowledge arguments in the CL framework », Agathe Beaugrand (GREYC)
Séminaire Algortihmique : « Efficient and succinct zero-knowledge arguments in the CL framework », Agathe Beaugrand (GREYC)
Multiparty computation (MPC) aims at allowing a set of participants to perform computation together on private inputs. In order to protect the privacy of the users and guarantee the correctness of the computation, MPC relies on several cryptographic tools, among which asymmetric encryption and zero-knowledge proofs. In this talk, we focus on using the CL … Continue reading Séminaire Algortihmique : « Efficient and succinct zero-knowledge arguments in the CL framework », Agathe Beaugrand (GREYC)
0 évènement,
0 évènement,
0 évènement,
0 évènement,
0 évènement,
0 évènement,
1 évènement,
Séminaire Algorithmique : « Structured-Seed Local Pseudorandom Generators and their Applications », Melissaris Nikolas (IRIF, Univ. Paris Cité)
Séminaire Algorithmique : « Structured-Seed Local Pseudorandom Generators and their Applications », Melissaris Nikolas (IRIF, Univ. Paris Cité)
Pseudorandom generators are basic tools for simulating randomness efficiently. A local PRG is one where each output bit depends on only a few bits of the seed, which makes them useful in low-depth cryptography and certain complexity-theoretic constructions. In this talk, I will introduce structured-seed local PRGs (SSL-PRGs), where the seed is not uniform but … Continue reading Séminaire Algorithmique : « Structured-Seed Local Pseudorandom Generators and their Applications », Melissaris Nikolas (IRIF, Univ. Paris Cité)