Yixin Shen

About Me

I am currently a research fellow (EPSRC Fellow) in the Information Security Group at Royal Holloway, University of London. Previously, I was a post-doc in the same group, hosted by Pr Martin R. Albrecht. Before that, I did my PhD at IRIF, Université de Paris under the supervision of Frédéric Magniez. Prior to that, I studied at École polytechnique, at Télécom ParisTech and at Parisian Master of Research in Computer Science (MPRI).

Contact: yixin.shen at rhul.ac.uk

Curriculum Vitæ

You can download my CV here.

Research Interests

I mainly study quantum algorithms in the context of cryptanalysis. I am particularly interested in problems related to lattice-based cryptography.

Grant

I am the principal investigator of EP/W02778X/1 (08/2022-07/2027).

Service

Program committee member: INDOCRYPT 2022.

Member of the EPSRC Peer Review College.

Reviewer: TQC 2019, ANTS 2020, SODA 2021, ICALP 2021, CRYPTO 2021, ASIACRYPT 2021, SAC 2021, TQC 2022, ASIACRYPT 2022, TCC 2022, SODA 2022.

Seminar organizer: ENSL/CWI/RHUL Joint Online Cryptography seminars.

Publications

  1. Quantum Augmented Dual Attack
    Martin R. Albrecht, Yixin Shen
    Preprint 2022. [arXiv]

  2. Finding many Collisions via Reusable Quantum Walks
    Xavier Bonnetain, André Chailloux, André Schrottenloher, Yixin Shen
    Preprint 2022. [arXiv]

  3. Variational quantum solutions to the Shortest Vector Problem
    Martin R. Albrecht, Miloš Prokop, Yixin Shen, Petros Wallden
    Preprint 2022. [arXiv]

  4. Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
    Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen
    Extended version of STACS 2021 with major differences. Contributed talk at the 25th Conference on Quantum Information Processing (QIP 2022). [arXiv]

  5. Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
    Divesh Aggarwal, Yanlin Chen, Rajendra Kumar, Yixin Shen
    38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021) [PDF]

    Invited to TOCS Special Issue for STACS 2021 (regretfully declined).

  6. Fast Classical and Quantum Algorithms for Online k-server Problem on Trees
    Ruslan Kapralov, Kamil Khadiev, Joshua Mokut, Yixin Shen, Maxim Yagafarov
    22th Italian Conference on Theoretical Computer Science (ICTCS 2021) [PDF] [arXiv]

  7. Improved Classical and Quantum Algorithms for Subset-Sum
    Xavier Bonnetain, Rémi Bricout, André Schrottenloher, Yixin Shen
    26th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2020)
    [PDF] [arXiv]

  8. Quantum Query Complexity of Dyck Languages with Bounded Height
    Kamil Khadiev, Yixin Shen
    Preprint 2019. [arXiv]

    Merged with Quantum Lower Bounds for 2D-Grid and Dyck Language
    Andris Ambainis, Kaspars Balodis, Jānis Iraids, Krišjānis Prūsis, Juris Smotrovs [arXiv]

    Merged version: Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language
    45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020) [PDF]

  9. Quantum lattice enumeration and tweaking discrete pruning
    Yoshinori Aono, Phong Nguyen, Yixin Shen
    24th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2018)
    [PDF] [eprint]

Teaching Assistant