EasyPQC: Verifying Post-Quantum Cryptography-Reference-Cited by-同舟云学术

EasyPQC: Verifying Post-Quantum Cryptography

Published:2021-11-12 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security
language:
Short-container-title:

Author:

Barbosa Manuel¹,Barthe Gilles²,Fan Xiong³,Grégoire Benjamin⁴,Hung Shih-Han⁵,Katz Jonathan⁶,Strub Pierre-Yves⁷,Wu Xiaodi⁶,Zhou Li⁸

Affiliation:

1. University of Porto (FCUP) and INESC TEC, Porto, Portugal

2. MPI-SP and IMDEA Software Institute, Bochum, Germany

3. Algorand, Inc., Boston, MA, USA

4. INRIA, Sophia-Antipolis, France

5. University of Texas, Austin, TX, USA

6. University of Maryland, College Park, MD, USA

7. École Polytechnique, Paris, France

8. MPI-SP, Bochum, Ghana

Funder

AFOSR

NSF (National Science Foundation)

Publisher

ACM

Link

Reference55 articles.

3. Mechanized Proofs of Adversarial Complexity and Application to Universal Composability;Barbosa Manuel;IACR Cryptol. ePrint Arch.,2021

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

2. Formal Verification of Cryptosystems;Encyclopedia of Cryptography, Security and Privacy;2024

3. Formally Verifying Kyber;Lecture Notes in Computer Science;2024

5. Quantum Cryptography Techniques;Quantum Computing in Cybersecurity;2023-10-13