BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Multi-User Security in Post-Quantum Cryptography
DTSTART:20250612T160000
DTEND:20250612T180000
DTSTAMP:20260528T093206Z
UID:8aa27a093490b2ee54a8333490c018b8634ed5ff22839acc2f11c3a3
CATEGORIES:Conferences - Seminars
DESCRIPTION:Lewis Glabush\nEDIC candidacy exam\nExam president: Prof. Thom
 as Vidick\nThesis advisor: Prof. Serge Vaudenay\nCo-examiner: Prof. Alessa
 ndro Chiesa\n\nAbstract\nMulti-user security is an important topic in post
 -quantum public key cryptographic\, which has received limited attention i
 n the literature. Multi-user security captures how security degrades as pr
 otocols are used at scale. Trivial bounds have existed in the literature s
 ince 2000\, but are insufficient to maintain security tightness at scale. 
 For concrete schemes\, better-than-trivial bounds are suggested by existin
 g heuristics. This thesis will consider the impact of cryptography at scal
 e for lattice-based schemes. We will consider known techniques to improve 
 multi-user security: user domain seperation and salting. Furthermore\, we 
 will describe the optimal key-refresh rates\, and the expected failure rat
 e\, for lattice based schemes used at scale.\n\nSelected papers\n1: Tightn
 ess Subtleties for Multi-user PKE Notions. Eprint version: https://eprint.
 iacr.org/2022/855. IMA version: https://link.springer.com/chapter/10.1007/
 978-3-030-92641-0_5. (The versions are the same).\n2: Public-Key Encrypti
 on in a Multi-user Setting: Security Proofs and Improvements https://www.i
 acr.org/archive/eurocrypt2000/1807/18070262-new.pdf. \n3: Faster Lattice-
 Based KEMs via a Generic Fujisaki-Okamoto Transform Using Prefix Hashing. 
 https://eprint.iacr.org/2021/1351.pdf. ACM CCS version: https://dl.acm.org
 /doi/10.1145/3460120.3484819.  (The versions are the same).\n 
LOCATION:INF 220 https://plan.epfl.ch/?room==INF%20220
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR