IQIM Postdoctoral and Graduate Student Seminar
Abstract: One-way functions, which are functions easy to compute but hard to invert, are the most fundamental assumptions in classical cryptography, because almost all cryptographic tasks (such as commitments, digital signatures, zero-knowledge, pseudorandom generators, public-key encryption, etc.) do not exist if one-way functions do not exist. In this talk, we show that it is not necessarily the case in quantum cryptography. We construct quantum commitments, quantum digital signatures, and quantum multiparty computation from pseudorandom quantum states [Ji, Liu, Song, CRYPTO 2018] that could exist even if BQP=QMA (when one-way functions do not exist) [Kretschmer, TQC 2021].
References: Morimae and Yamakawa, CRYPTO2022; arXiv:2112.06369
Lunch will be provided, following the talk, on the lawn north of the Bridge Arcade
Attendees joining in person must demonstrate that they comply with Caltech's vaccination requirements (present Caltech ID or AWS ID or vaccination and booster confirmation).