Certifying assembly with formal security proofs: The case of BBS

Science of Computer Programming

Volumn 77, Issue 10-11, 2012, Pages 1058-1074

  Affeldt, Reynald ^a   Nowak, David ^a   Yamada, Kiyoshi ^a,b  

^a NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^b Village Sasazuka III Bldg 6F   (Japan)

Author keywords

Assembly language; Coq; Hoare logic; PRNG; Provable security

Indexed keywords

ASSEMBLY LANGUAGE; COQ; HOARE LOGIC; PRNG; PROVABLE SECURITY;

NUMBER THEORY; SMART CARDS;

CRYPTOGRAPHY;

EID: 84861598516     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2011.07.003     Document Type: Conference Paper

References (27)

1. R. Affeldt, D. Nowak, K. Yamada, Certifying assembly with security proofs: the case of BBS, in: Electronic Communications of the EASST, vol. 23, 2009.
2. R. Affeldt, and N. Marti An approach to formal verification of arithmetic functions in assembly M. Okada, I. Satoh, Revised Selected Papers of the 11th Asian Computing Science Conference, Secure Software and Related Issues, ASIAN 2006 Lecture Notes in Computer Science vol. 4435 2008 Springer 346 360
3. R. Affeldt, D. Nowak, K. Yamada, Certifying assembly with security proofs: the case of BBS, Coq development. http://staff.aist.go.jp/reynald. affeldt/bbs (accessed 14.01.11).
4. R. Affeldt, M. Tanaka, and N. Marti Formal proof of provable security by game-playing in a proof assistant W. Susilo, J.K. Liu, Y. Mu, Proceedings of the 1st International Conference on Provable Security, Provsec 2007 Lecture Notes in Computer Science vol. 4784 2007 Springer 151 168
5. M. Backes, M. Berg, and D. Unruh A formal language for cryptographic pseudocode I. Cervesato, H. Veith, A. Voronkov, Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2008 Lecture Notes in Computer Science vol. 5330 2008 Springer 353 376
6. G. Barthe, B. Grégoire, and S. Zanella-Béguelin Formal certification of code-based cryptographic proofs Z. Shao, B.C. Pierce, Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009 2009 ACM 90 101
7. M. Bellare, P. Rogaway, Code-based game-playing proofs and the security of triple encryption, in: Cryptology ePrint Archive, Report 2004/331, 2004.
8. L. Blum, M. Blum, and M. Shub A simple unpredictable pseudo random number generator SIAM Journal on Computing 15 2 1986 364 383
9. The Coq Development Team, The Coq proof assistant reference manual - version 8.3. http://coq.inria.fr/refman, INRIA, 2010 (accessed 14.01.11).
10. H. Delfs, and H. Knebl Introduction to Cryptography: Principles and Applications second ed. 2007 Springer
11. J.C. Filliâtre, and C. Marché Multi-prover verification of C programs J. Davies, W. Schulte, M. Barnett, Proceedings of the 6th International Conference on Formal Engineering Methods, ICFEM 2004 Lecture Notes in Computer Science vol. 3308 2004 Springer 15 29
12. G. Gonthier, A. Mahboubi, A small scale reflection extension for the Coq system, Technical Report 6455, INRIA, 2007.
13. N. Marti, R. Affeldt, and A. Yonezawa Formal verification of the heap manager of an operating system using separation logic Z. Liu, J. He, Proceedings of the 8th International Conference on Formal Engineering Methods, ICFEM 2006 Lecture Notes in Computer Science vol. 4260 2006 Springer 400 419
14. F. Mehta, and T. Nipkow Proving pointer programs in higher-order logic Information and Computation 199 1-2 2005 200 227
15. A. Menezes, P.C. van Oorschot, and S.A. Vanstone Handbook of Applied Cryptography 2001 CRC Press fifth printing
16. MIPS Technologies, MIPS32 4KS Processor Core Family Software User's Manual, 2001.
17. P.L. Montgomery Modular multiplication without trial division Mathematics of Computation 44 170 1985 519 521
18. M.O. Myreen, M.J.C. Gordon, Verification of machine code implementations of arithmetic functions for cryptography, in: Theorem Proving in Higher Order Logics: Emerging Trends Proceedings, Internal Report 364/07, Department of Computer Science, University of Kaiserslautern, 2007.
19. M.O. Myreen, K. Slind, and M.J.C. Gordon Extensible proof-producing compilation O. de Moor, M.I. Schwartzbach, Proceedings of the 18th International Conference on Compiler Construction, CC 2009 Lecture Notes in Computer Science vol. 5501 2009 Springer 2 16
20. D. Nowak A framework for game-based security proofs S. Qing, H. Imai, G. Wang, Proceedings of the 9th International Conference on Information and Communications Security, ICICS 2007 Lecture Notes in Computer Science vol. 4861 2008 Springer 319 333
21. D. Nowak On formal verification of arithmetic-based cryptographic primitives P.J. Lee, J.H. Cheon, Revised Selected Papers of the 11th International Conference on Information Security and Cryptology, ICISC 2008 Lecture Notes in Computer Science vol. 5461 2009 Springer 368 382
22. J.C. Reynolds Separation Logic: A Logic for Shared Mutable Data Structures Proceedings of the 17th IEEE Symposium on Logic in Computer Science, LICS 2002 2002 IEEE Computer Society 55 74
23. A. Saabas, and T. Uustalu A compositional natural semantics and Hoare logic for low-level languages Theoretical Computer Science 373 3 2007 273 302
24. V. Shoup, Sequences of games: a tool for taming complexity in security proofs, Report 2004/332, Cryptology ePrint Archive.
25. G. Tan, and A.W. Appel A compositional logic for control flow E. Allen Emerson, K.S. Namjoshi, Proceedings of 7th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2006 Lecture Notes in Computer Science vol. 3855 2006 Springer 80 94
26. K. Yamada, Bug report and patch for SmartMIPS support in GDB. http://article.gmane.org/gmane.comp.gdb.patches/55961, 2010/03/09 (accessed 14.01.11).
27. A.C. Yao Theory and applications of trapdoor functions (Extended Abstract) Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, FOCS 1982 1982 IEEE Computer Society 80 91