Quantum Cryptographic Complexity

Quantum Cryptographic Complexity is a theoretical framework within quantum complexity theory that characterizes the computational resources required to break cryptographic protocols secure against quantum adversaries, distinguished by its incorporation of quantum query models, bounded-error quantum polynomial time constraints, and reductions between cryptographic primitives in the presence of quantum oracles.

28

Publications

878

Citations

61

Authors

50

Institutions

Publications per year

2017–2026

10

Authors

61

  1. RD
    Ronald de Wolf

    Centrum Wiskunde & Informatica, Netherlands

    3 publications · 119 citations

    3

    h-index

  2. JK
    Julia Kempe

    University of California, Berkeley, United States

    3 publications · 119 citations

    3

    h-index

  3. RJ
    Rahul Jain

    National University of Singapore, Singapore

    2 publications · 34 citations

    2

    h-index

  4. DG
    Dmitry Gavinsky

    University of Calgary, Canada

    2 publications · 106 citations

    2

    h-index

  5. LM
    Lawrence M. Ioannou

    University of Cambridge, United Kingdom

    2 publications · 114 citations

    2

    h-index

1–5 of 61

Venues

  1. Quantum Information and Computation

    QIC · 3 publications · 94 citations

    3

    h-index

  2. arXiv (Cornell University)

    Repository · 2 publications · 27 citations

    2

    h-index

  3. Physical review. A/Physical review, A

    PRA · 1 publications · 21 citations

    1

    h-index

  4. IEEE Transactions on Information Theory

    1 publications · 13 citations

    1

    h-index

  5. Designs Codes and Cryptography

    1 publications · 12 citations

    1

    h-index

1–5