BU Sec Seminar: Generic Delay Functions: Equivalence to Factoring in RSA Groups and an Impossibility Result in Known-Order Groups
- Starts: 1:00 pm on Wednesday, April 21, 2021
- Ends: 2:00 pm on Wednesday, April 21, 2021
Speaker: Lior Rotem, Phd Student, Hebrew University Abstract: Despite the fundamental importance of delay functions, the main known delay function which offers both sufficient structure for realizing time-lock puzzles and verifiable delay functions, as well as a realistic level of practicality is the “iterated squaring” function of Rivest, Shamir and Wagner in hidden-order groups. The challenges of basing the sequentiality of iterated squaring on well-established assumptions, or of constructing new delay functions in well-understood cyclic groups of known order, have remained open for over two decades. In this talk, I will present both upper bounds, connecting the sequentiality of iterated squaring in RSA groups to the factoring assumption, and a lower bound, ruling out the existence of generic-group delay functions in cyclic groups of known order. This talk is based on joint works with Gil Segev and Ido Shahaf. Bio: Lior is a Ph.D. student at the Hebrew University's School of Computer Science and Engineering, where he is advised by Prof. Gil Segev. He is an Adams Fellow of the Israel Academy of Sciences and Humanities.
- The Zoom link is sent out to the BUsec mailing list. To join the mailing list, please email Ari Karchmer at email@example.com