{"id":1646,"date":"2020-12-11T11:54:19","date_gmt":"2020-12-11T10:54:19","guid":{"rendered":"http:\/\/www.ens-lyon.fr\/LIP\/AriC\/?page_id=1646"},"modified":"2021-06-30T11:26:12","modified_gmt":"2021-06-30T09:26:12","slug":"joint-online-crypto-seminar","status":"publish","type":"page","link":"https:\/\/www.ens-lyon.fr\/LIP\/AriC\/joint-online-crypto-seminar","title":{"rendered":"Joint online crypto seminar"},"content":{"rendered":"\n

Up Next<\/h2>\n\n\n\n

12\/07\/21 @ 10:30 (9:30UK)
Finding Collisions in a Quantum World: Quantum Black-Box Separation of Collision-Resistance and One-Wayness<\/strong> – Takashi Yamakawa<\/p>Abstract:<\/strong> Since the celebrated work of Impagliazzo and Rudich (STOC 1989), a number of black-box impossibility results have been
established. However, these works only ruled out classical black-box reductions among cryptographic primitives. Therefore it may be
possible to overcome these impossibility results by using quantum reductions. To exclude such a possibility, we have to extend these
impossibility results to the quantum setting. In this paper, we initiate the study of black-box impossibility in the quantum
setting. We first formalize a quantum counterpart of fully-black-box reduction following the formalization by Reingold, Trevisan and
Vadhan (TCC 2004). Then we prove that there is no quantum fully-black-box reduction from collision-resistant hash functions to
one-way permutations (or even trapdoor permutations). We take both of classical and quantum implementations of primitives into
account. This is an extension to the quantum setting of the work of Simon (Eurocrypt 1998) who showed a similar result in the
classical setting.

Speaker Bio: <\/em>Takashi Yamakawa is a researcher at NTT in Japan. He earned his PhD in Science from The University of Tokyo in 2017.His
research focuses on post-quantum and quantum cryptography.<\/cite><\/blockquote>\n\n\n\n

Full Schedule<\/h2>\n\n\n\n