Student seminar

     Archives: [2026] [2025] [2024] [2023] [2022] [2021] [2020] [2019] [List of Speakers]

Past 2020 Event(s)

18-12-2020Student Seminar
  • Matthieu Lequesne (CWI): On the security of subspace subcodes of Reed-Solomon codes for public key encryption
11-12-2020Student Seminar
  • Jana Sotáková (CWI & QSC): Computing Isogenies
04-12-2020Student Seminar
  • Thomas Attema: Practical Product Proofs for Lattice Commitments
27-11-2020Student Seminar
  • Mark Abspoel (CWI): Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over ℤ/p^k ℤ
06-11-2020Student Seminar
  • Chen Yuan (CWI): Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries
30-10-2020Student Seminar
  • Aron van Baarsen (CWI): VDFs in Class Groups and the Strong Algebraic Group Model
23-10-2020Student Seminar
  • Esteban Landerreche (CWI): Time-Aware Cryptography in UC
09-10-2020Student Seminar
  • João Duarte: On the Complexity of the Crossbred Algorithm
25-09-2020Student Seminar
  • Michael Klooss (KIT): Efficient zero-knowledge arguments in the DLog setting
11-09-2020Student seminar
  • Nicolas Resch (CWI): Thresholds for Random Linear Codes.
31-07-2020Student Seminar
  • David Butler (The Alan Turing Institute): Machine-checked proofs of security are important to increase the rigour of provable security.
24-07-2020Student Seminar
  • Sasha Lapiha (CWI): Comparing Lattice Families for Bounded Distance Decoding near Minkowski’s Bound.
17-07-2020Student Seminar
  • Lisa Kohl: MPC with Silent Preprocessing via Pseudorandom Correlation Generators
10-07-2020Student Seminar
  • André Schrottenloher (Inria Paris): Quantum tools for symmetric cryptanalysis
03-07-2020Student Seminar
  • Wessel van Woerden (CWI): How to break SVP challenges
12-06-2020Student Seminar
  • Jana Sotáková (QuSoft & UvA): The Decisional Diffie-Hellman problem for class group actions
05-06-2020Student Seminar
  • Ronald Cramer (CWI): Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes
29-05-2020Student Seminar
  • Mark Abspoel (CWI): Regenerating codes over Galois rings and applications to MPC
08-05-2020Student Seminar
  • Koen de Boer (CWI): Sampling relatively factorizable elements in ideals of number fields
01-05-2020Student Seminar
  • Serge Fehr (CWI & Universiteit Leiden): The compressed quantum random oracle technique
28-04-2020Student Seminar
  • Toon Segers (Eindhoven Technical University): Verifiable MPC using Compressed Sigma-protocols
24-04-2020Student Seminar
  • Thomas Attema (TNO & CWI): Compressed Sigma-Protocol Theory and Practical Application to Plug & Play Secure Algorithmics
21-04-2020Student Seminar
  • Marten van Dijk (CWI & University of Connecticut): Towards Secure Computing Environments pt 2
14-04-2020Student Seminar
  • Thijs Veugen (TNO & CWI): An Implementation of the Paillier Crypto System with Threshold Decryption without a Trusted Dealer
07-04-2020Student Seminar
  • Chen Yuan (CWI): Beating the Probabilistic Lower Bound on Perfect Hashing
03-04-2020Student Seminar
  • Riddhi Ghosal (Indian Statistical Institute): Approximate Distance-Comparison-Preserving Encryption
31-03-2020Student Seminar
  • Jelle Don (CWI): The Measure-and-Reprogram Technique 2.0: Multi-Round Fiat-Shamir and More
27-03-2020Student Seminar
  • Marten van Dijk (CWI & University of Connecticut): Towards Secure Computing Environments
24-03-2020Student Seminar
  • Leo Ducas (CWI): Random Self-reducibility of Ideal-SVP via Arakelov Random Walks
07-02-2020Student Seminar
  • Wessel van Woerden (CWI & Universiteit Leiden): Lattice Packings: an upper bound on the number of perfect lattices.
31-01-2020Student Seminar
  • Esteban Landerreche (CWI): Non-interactive Cryptographic Timestamping based on Verifiable Delay Functions
24-01-2020Student Seminar
  • Alexander Krigsman (Universiteit Leiden): Efficient Computation of the Deuring Correspondence
10-01-2020Student Seminar
  • Annamaria Iezzi (University of South Florida): A quantum attack to the isogeny problem in the "commutative case".
  • Chloe Martindale (University of Bristol): How to not break SIDH.
  • Laia Amoros (Aalto University): The use of lattices in wireless communications in a wiretap setting.
0.0141s c