Certifying assembly with formal cryptographic proofs: The case of BBS

Electronic Communications of the EASST

Volumn 23, Issue , 2009, Pages

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

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

Author keywords

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

Indexed keywords

EID: 84861615028     PISSN: None     EISSN: 18632122     Source Type: Journal    
DOI: 10.14279/tuj.eceasst.23.316.302     Document Type: Conference Paper

References (18)

1. Affeldt, R., Tanaka, M., Marti, N.: Formal Proof of Provable Security by Game-Playing in a Proof Assistant. Int. Conf. on Provable Security. LNCS, vol. 4784, pp. 151-168. Springer (2007)
2. Affeldt, R., Marti, N.: An Approach to Formal Verification of Arithmetic Functions in Assembly. Annual Asian Computing Science Conference, Dec. 2006. LNCS, vol. 4435, pp. 346-360. Springer, Heidelberg (2008)
3. Backes, M., Berg, M., Unruh D.: A Formal Language for Cryptographic Pseudocode. Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning. LNCS, vol. 5330, pp. 353-376. Springer (2008)
4. Barthe, G., Grégoire, B., Zanella, S.B.: Formal certification of code-based cryptographic proofs. ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, pp.90-101. ACM Press
5. Bellare, M., Rogaway, P.: Code-based game-playing proofs and the security of triple encryption. Cryptology ePrint Archive, Report 2004/331, 2004
6. Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo random number generator. SIAM Journal on Computing, 15(2):364-383. Society for Industrial and Applied Mathematics, 1986
7. Affeldt, R., Nowak D., Yamada K.: Certifying Assembly with Cryptographic Proofs: the Case of BBS. http://staff.aist.go.jp/reynald.affeldt/bbs
8. Gonthier, G., Mahboubi, A.: A Small Scale Reflection Extension for the Coq System. Technical Report 6455, Dec. 2007. INRIA
9. MIPS Technologies. MIPS32 4KS Processor Core Family Software User's Manual MIPS Technologies, Inc., 1225 Charleston Road, Mountain View, CA 94043-1353
10. Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation, 44(170):519-521, 1985
11. Myreen, M.O., Gordon, M.J.C.: Verification of Machine Code Implementations of Arithmetic Functions for Cryptography. Theorem Proving in Higher Order Logics: Emerging Trends Proceedings. Internal Report 364/07, Aug. 2007. Department of Computer Science, University of Kaiserslautern
12. Myreen, M.O., Slind, K., Gordon, M.J.C.: Extensible proof-producing compilation. Int. Conf. on Compiler Construction. LNCS, vol. 5501, pp. 2-16. Springer (2009)
13. Nowak, D.: A framework for game-based security proofs. Int. Conf. on Information and Communications Security. LNCS, vol. 4861, pp. 319-333. Springer (2007)
14. Nowak, D.: On formal verification of arithmetic-based cryptographic primitives. Int. Conf. on Information Security and Cryptology, Dec. 2008. LNCS, vol. 5461, pp. 368-382. Springer (2009)
15. Reynolds, J.C.: Separation Logic: A Logic for Shared Mutable Data Structures. IEEE Symp. on Logic in Computer Science, pp. 55-74 (2002). Invited lecture
16. Saabas, A., Uustalu, T.: A compositional natural semantics and Hoare logic for lowlevel languages. Theoretical Computer Science 373(3), 273-302. Elsevier (2007)
17. Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004/332, 2004
18. Yao, A.C.: Theory and applications of trapdoor functions. IEEE Annual Symp. on Foundations of Computer Science. pp. 80-91. IEEE (1982)