Formal Verification of Saber's Public-Key Encryption Scheme in EasyCrypt

被引:3
作者
Hulsing, Andreas [1 ]
Meijers, Matthias [1 ]
Strub, Pierre-Yves [2 ]
机构
[1] Eindhoven Univ Technol, Eindhoven, Netherlands
[2] Meta, Paris, France
来源
ADVANCES IN CRYPTOLOGY - CRYPTO 2022, PT I | 2022年 / 13507卷
基金
欧洲研究理事会;
关键词
Formal Verification; Saber; EasyCrypt; SECURITY;
D O I
10.1007/978-3-031-15802-5_22
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this work, we consider the formal verification of the public-key encryption scheme of Saber, one of the selected few post-quantum cipher suites currently considered for potential standardization. We formally verify this public-key encryption scheme's IND-CPA security and 6-correctness properties, i.e., the properties required to transform the public-key encryption scheme into an IND-CCA2 secure and 6-correct key encapsulation mechanism, in EasyCrypt. To this end, we initially devise hand-written proofs for these properties that are significantly more detailed and meticulous than the presently existing proofs. Subsequently, these hand-written proofs serve as a guideline for the formal verification. The results of this endeavor comprise hand-written and computer-verified proofs which demonstrate that Saber's public-key encryption scheme indeed satisfies the desired security and correctness properties.
引用
收藏
页码:622 / 653
页数:32
相关论文
共 19 条
[1]   The Last Mile: High-Assurance and High-Speed Cryptographic Implementations [J].
Almeida, Jose Bacelar ;
Barbosa, Manuel ;
Barthe, Gilles ;
Gregoire, Benjamin ;
Koutsos, Adrien ;
Laporte, Vincent ;
Oliveira, Tiago ;
Strub, Pierre-Yves .
2020 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2020), 2020, :965-982
[2]  
Banerjee A, 2012, LECT NOTES COMPUT SC, V7237, P719, DOI 10.1007/978-3-642-29011-4_42
[3]  
Barbosa M., 2021, 20211253 CRYPT EPRIN
[4]   SoK: Computer-Aided Cryptography [J].
Barbosa, Manuel ;
Barthe, Gilles ;
Bhargavan, Karthik ;
Blanchet, Bruno ;
Cremers, Cas ;
Liao, Kevin ;
Parno, Bryan .
2021 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, SP, 2021, :777-795
[5]  
Barthe Gilles, 2012, Interactive Theorem Proving. Proceedings of the Third International Conference, ITP 2012, P11, DOI 10.1007/978-3-642-32347-8_2
[6]  
Bellare M, 2006, LECT NOTES COMPUT SC, V4004, P409
[7]   Random Oracles in a Quantum World [J].
Boneh, Dan ;
Dagdelen, Ozgur ;
Fischlin, Marc ;
Lehmann, Anja ;
Schaffner, Christian ;
Zhandry, Mark .
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2011, 2011, 7073 :41-+
[8]   A Comprehensive Symbolic Analysis of TLS 1.3 [J].
Cremers, Cas ;
Horvat, Marko ;
Hoyland, Jonathan ;
Scott, Sam ;
van der Merwe, Thyla .
CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, :1773-1788
[9]  
D'Anvers Jan-Pieter, 2018, Progress in Cryptology - AFRICACRYPT 2018. 10th International Conference on Cryptology in Africa. Proceedings: LNCS 10831, P282, DOI 10.1007/978-3-319-89339-6_16
[10]  
DAnvers J.-P., 2021, THESIS KU LEUVEN