On the Impossibility of Key Agreements from Quantum Random Oracles-Reference-Cited by-同舟云学术

On the Impossibility of Key Agreements from Quantum Random Oracles

Published:2022 Issue: Volume: Page:165-194
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2022
language:
Short-container-title:

Author:

Austrin Per,Chung Hao,Chung Kai-Min,Fu Shiuan,Lin Yao-Ting,Mahmoody Mohammad

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-15979-4_6

Reference44 articles.

1. Aaronson, S., Ambainis, A.: The need for structure in quantum speedups. arXiv preprint arXiv:0911.0996 (2009)

2. Aaronson, S.: Quantum computing, postselection, and probabilistic polynomial-time. Proc. R. Soc. A Math. Phys. Eng. Sci. 461(2063), 3473–3482 (2005)

3. Lecture Notes in Computer Science;A Agarwal,2021

4. Austrin, P., Chung, H., Chung, K.-M., Fu, S., Lin, Y.-T., Mahmoody, M.: On the impossibility of key agreements from quantum random oracles. Cryptology ePrint Archive, Paper 2022/218 (2022). https://eprint.iacr.org/2022/218

5. Lecture Notes in Computer Science;G Alagic,2020

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Verifiable Quantum Advantage without Structure;Journal of the ACM;2024-06-11

2. Commitments from Quantum One-Wayness;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Towards the Impossibility of Quantum Public Key Encryption with Classical Keys from One-Way Functions;IACR Communications in Cryptology;2024-04-09

4. On the Efficiency of Generic, Quantum Cryptographic Constructions;IACR Communications in Cryptology;2024-04-09

5. On Central Primitives for Quantum Cryptography with Classical Communication;Lecture Notes in Computer Science;2024