J. A. Akinyele, C. Garman, I. Miers, M. W. Pagano, M. Rushanan et al., Charm: a framework for rapidly prototyping cryptosystems, Journal of Cryptographic Engineering, vol.38, issue.3, 2013.
DOI : 10.1007/978-3-642-32009-5_14
URL : http://hms.isi.jhu.edu/papers/charm11.pdf

J. Bacelar-almeida, M. Barbosa, G. Barthe, and F. Dupressoir, Certified computer-aided cryptography: efficient provably secure machine code from high-level implementations, ACM CCS, 2013.

J. Bacelar-almeida, M. Barbosa, G. Barthe, and F. Dupressoir, Verifiable side-channel security of cryptographic implementations: constant-time MEE-CBC, 23rd International Conference on Fast Software Encryption (FSE, pp.163-184, 2016.

A. W. Appel, Verification of a Cryptographic Primitive, ACM Transactions on Programming Languages and Systems, vol.37, issue.2, p.256, 2015.
DOI : 10.1145/2345156.1993532

M. Backes, M. Maffei, and E. Mohammadi, Computationally Sound Abstraction and Verification of Secure Multi-Party Computations, FSTTCS, 2010.

G. Barthe, F. Dupressoir, B. Grégoire, C. Kunz, B. Schmidt et al., EasyCrypt: A Tutorial, Lecture Notes in Computer Science, vol.8604, pp.146-166, 2013.
DOI : 10.1145/1594834.1480894
URL : https://hal.archives-ouvertes.fr/hal-01114366

G. Barthe, C. Fournet, B. Grégoire, P. Strub, N. Swamy et al., Probabilistic relational verification for cryptographic implementations, Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '14, 2014.
DOI : 10.1145/2535838.2535847
URL : https://hal.archives-ouvertes.fr/hal-00935743

G. Barthe, B. Grégoire, S. Heraud, and S. Zanella-béguelin, Computer-Aided Security Proofs for the Working Cryptographer, CRYPTO, 2011.
DOI : 10.1007/978-3-642-22792-9_5
URL : https://hal.archives-ouvertes.fr/hal-01112075

D. Beaver, S. Micali, and P. Rogaway, The round complexity of secure protocols, Proceedings of the twenty-second annual ACM symposium on Theory of computing , STOC '90, pp.503-513, 1990.
DOI : 10.1145/100216.100287

M. Bellare, . Viet-tung, S. Hoang, P. Keelveedhi, and . Rogaway, Efficient Garbling from a Fixed-Key Blockcipher, 2013 IEEE Symposium on Security and Privacy, 2013.
DOI : 10.1109/SP.2013.39
URL : http://doi.org/10.1109/sp.2013.39

M. Bellare, . Viet-tung, P. Hoang, and . Rogaway, Foundations of garbled circuits, Proceedings of the 2012 ACM conference on Computer and communications security, CCS '12, 2012.
DOI : 10.1145/2382196.2382279

M. Bellare and S. Micali, Non-Interactive Oblivious Transfer and Applications, CRYPTO, 1989.
DOI : 10.1007/0-387-34805-0_48

M. Bellare and P. Rogaway, The Security of Triple Encryption and a Framework??for??Code-Based??Game-Playing??Proofs, EUROCRYPT (Lecture Notes in Computer Science), pp.409-426, 2006.
DOI : 10.1002/j.1538-7305.1949.tb00928.x

A. Ben-david, N. Nisan, and B. Pinkas, FairplayMP, Proceedings of the 15th ACM conference on Computer and communications security, CCS '08, pp.257-266, 2008.
DOI : 10.1145/1455770.1455804

R. Bendlin, I. Damgård, C. Orlandi, and S. Zakarias, Semihomomorphic Encryption and Multiparty Computation, EUROCRYPT, pp.169-188, 2011.
DOI : 10.1007/978-3-642-20465-4_11
URL : https://eprint.iacr.org/2010/514.pdf

L. Beringer, A. Petcher, K. Q. Ye, A. W. Appel, and D. C. Usa, Verified Correctness and Security of OpenSSL HMAC USENIX Association, 24th USENIX Security Symposium, USENIX Security 15 Zanella-Béguelin, and Jean Karim Zinzindohoué. 2016. Implementing and Proving the TLS 1.3 Record Layer. Cryptology ePrint Archive, pp.207-221, 1178.

B. Blanchet, A Computationally Sound Mechanized Prover for Security Protocols, IEEE Trans. Dependable Sec. Comput, vol.5, issue.4, 2008.
DOI : 10.1109/tdsc.2007.1005

B. Blanchet, Security Protocol Verification: Symbolic and Computational Models, 2012.
DOI : 10.1007/978-3-642-28641-4_2
URL : https://hal.archives-ouvertes.fr/hal-00863388

D. Bogdanov, S. Laur, and J. Willemson, Sharemind: A Framework for Fast Privacy-Preserving Computations, ESORICS, 2008.
DOI : 10.1007/s001459910003
URL : http://www.math.ut.ee/%7Eswen/publications/articles/bogdanov-laur-willemson-2008.pdf

S. Browning and P. Weaver, Designing Tunable, Verifiable Cryptographic Hardware Using Cryptol, 2010.
DOI : 10.1007/978-1-4419-1539-9_4

R. E. Bryant, Symbolic Boolean manipulation with ordered binary-decision diagrams, ACM Computing Surveys, vol.24, issue.3, pp.293-318, 1992.
DOI : 10.1145/136035.136043

D. Cadé and B. Blanchet, Proved Generation of Implementations from Computationally Secure Protocol Specifications, 2013.
DOI : 10.1007/978-3-642-36830-1_4

B. Carmer and M. Rosulek, Linicrypt: A Model for Practical Cryptography, Advances in Cryptology -CRYPTO 2016 -36th Annual International Cryptology Conference Proceedings, Part III (Lecture Notes in Computer Science), pp.416-445978, 2016.
DOI : 10.1007/978-3-662-46803-6_8

M. Dahl and I. Damgård, Universally Composable Symbolic Analysis for Two-Party Protocols Based on Homomorphic Encryption, EUROCRYPT, 2014.
DOI : 10.1007/978-3-642-55220-5_38
URL : http://eprint.iacr.org/2013/296.pdf

I. Damgård, M. Keller, E. Larraia, V. Pastro, P. Scholl et al., Practical Covertly Secure MPC for Dishonest Majority ??? Or: Breaking the SPDZ Limits, ESORICS, pp.1-18, 2013.
DOI : 10.1007/978-3-642-40203-6_1

I. Damgård, J. Buus-nielsen, M. Nielsen, and S. Ranellucci, The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited, IACR Cryptology ePrint Archive, vol.2016, issue.695, p.695, 2016.
DOI : 10.1007/978-3-642-32009-5_40

I. Damgård, V. Pastro, N. P. Smart, and S. Zakarias, Multiparty Computation from Somewhat Homomorphic Encryption, CRYPTO, pp.643-662, 2012.
DOI : 10.1007/978-3-642-32009-5_38

Y. Ejgenberg, M. Farbstein, M. Levy, and Y. Lindell, SCAPI: The Secure Computation Application Programming Interface, Cryptology ePrint Archive, p.629, 2012.

C. Fournet, C. Keller, and V. Laporte, A Certified Compiler for Verifiable Computing, 2016 IEEE 29th Computer Security Foundations Symposium (CSF), pp.268-280, 2016.
DOI : 10.1109/CSF.2016.26
URL : https://hal.archives-ouvertes.fr/hal-01397680

C. Fournet, M. Kohlweiss, and P. Strub, Modular codebased cryptographic verification, ACM CCS, 2011.
DOI : 10.1145/2046707.2046746
URL : https://hal.archives-ouvertes.fr/inria-00614372

M. Franz, A. Holzer, S. Katzenbeisser, C. Schallhart, and H. Veith, CBMC-GC: An ANSI C Compiler for Secure Two-Party Computations, Compiler Construction -23rd International Conference, pp.244-249978, 2014.
DOI : 10.1007/978-3-642-54807-9_15

A. Groce, A. Ledger, A. J. Malozemoff, and A. Yerukhimovich, CompGC: Efficient Offline/Online Semi-honest Two-party Computation, Cryptology ePrint Archive, vol.458, 2016.

S. Halevi, A plausible approach to computer-aided cryptographic proofs, IACR Cryptology ePrint Archive, p.181, 2005.

W. Henecka, S. Kögl, A. Sadeghi, T. Schneider, and I. Wehrenberg, TASTY, Proceedings of the 17th ACM conference on Computer and communications security, CCS '10, pp.451-462, 2010.
DOI : 10.1145/1866307.1866358

W. Henecka, S. Kögl, A. Sadeghi, T. Schneider, and I. Wehrenberg, TASTY, Proceedings of the 17th ACM conference on Computer and communications security, CCS '10, 2010.
DOI : 10.1145/1866307.1866358

A. Holzer, M. Franz, S. Katzenbeisser, and H. Veith, Secure two-party computations in ANSI C, Proceedings of the 2012 ACM conference on Computer and communications security, CCS '12, 2012.
DOI : 10.1145/2382196.2382278

Y. Huang, D. Evans, J. Katz, and L. Malka, Faster Secure Two-party Computation Using Garbled Circuits, USENIX Security, 2011.

V. Kolesnikov, A. Sadeghi, and T. Schneider, A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design, Journal of Computer Security, vol.21, issue.2, pp.283-315079, 2010.
DOI : 10.3233/JCS-130464
URL : http://www.informatik.tu-darmstadt.de/fileadmin/user_upload/Group_TRUST/PubsPDF/JCS464.pdf

V. Kolesnikov and T. Schneider, Improved Garbled Circuit: Free XOR Gates and Applications, ICALP, 2008.
DOI : 10.1007/978-3-540-70583-3_40
URL : http://www.cs.toronto.edu/~vlad/papers/XOR_ICALP08.pdf

X. Leroy, Formal certification of a compiler back-end or: programming a compiler with a proof assistant, Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.42-54, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00000963

Y. Lindell and B. Pinkas, A Proof of Security of Yao???s Protocol for Two-Party Computation, Journal of Cryptology, vol.33, issue.4, 2009.
DOI : 10.1017/CBO9780511721656

D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella, Fairplay - Secure Two-Party Computation System, USENIX Security Symposium, Matt Blaze, pp.287-302, 2004.

M. Naor and B. Pinkas, Efficient Oblivious Transfer Protocols, SODA, 2001.

P. S. Jesper-buus-nielsen, C. Nordholt, S. Orlandi, and . Burra, A New Approach to Practical Active-Secure Two-Party Computation, Advances in Cryptology -CRYPTO 2012 -32nd Annual Cryptology Conference Proceedings. 681?700, pp.978-981, 2012.

A. Parent, M. Roetteler, and K. M. Svore, Reversible circuit compilation with space constraints, p.377, 1510.

B. Parno, J. Howell, C. Gentry, and M. Raykova, Pinocchio, IEEE S&P, 2013.
DOI : 10.1007/978-1-4614-1460-5

A. Petcher and G. Morrisett, The Foundational Cryptography Framework Held as Part of the European Joint Conferences on Theory and Practice of Software, Principles of Security and Trust -4th International Conference Proceedings (Lecture Notes in Computer Science), pp.53-72978, 2015.

M. Pettai and P. Laud, Automatic Proofs of Privacy of Secure Multi-party Computation Protocols against Active Adversaries, 2015 IEEE 28th Computer Security Foundations Symposium, p.240, 2014.
DOI : 10.1109/CSF.2015.13

A. Rastogi, M. A. Hammer, and M. Hicks, Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations, 2014 IEEE Symposium on Security and Privacy, 2014.
DOI : 10.1109/SP.2014.48

A. Rastogi, N. Swamy, and M. Hicks, WYS*: A Verified Language Extension for Secure Multi-party Computations, 2016.

N. Swamy, C. Hrit, C. Keller, A. Rastogi, A. Delignat-lavaud et al., Dependent Types and Multi-Monadic Effects in F*, 43nd ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages (POPL), pp.256-270, 2016.
DOI : 10.1145/2914770.2837655
URL : https://hal.archives-ouvertes.fr/hal-01265793

X. Wang, A. J. Malozemoff, and J. Katz, Faster Secure Two-Party Computation in the Single-Execution Setting, pp.399-424978, 2017.
DOI : 10.1007/978-3-662-46803-6_8

C. Andrew and . Yao, Protocols for secure computations, FOCS, 1982.

C. Yu, W. Brown, D. Liu, A. Rossi, and M. Ciesielski, Formal Verification of Arithmetic Circuits by Function Extraction, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.35, issue.12, pp.2131-2142, 2016.
DOI : 10.1109/TCAD.2016.2547898
URL : https://hal.archives-ouvertes.fr/hal-01404976