EN FR
EN FR
PROSECCO - 2018
PROSECCO - 2018
Project-Team Prosecco
Team, Visitors, External Collaborators
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Partnerships and Cooperations
Dissemination
Bibliography
Project-Team Prosecco
Team, Visitors, External Collaborators
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Partnerships and Cooperations
Dissemination
Bibliography


previous Previous | up Home


Bibliography

Major publications by the team in recent years
  • 1M. Abadi, B. Blanchet, C. Fournet.

    The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication, in: Journal of the ACM (JACM), October 2017, vol. 65, no 1, pp. 1 - 103. [ DOI : 10.1145/3127586 ]

    https://hal.inria.fr/hal-01636616
  • 2C. Abate, A. Azevedo de Amorim, R. Blanco, A. N. Evans, G. Fachini, C. Hriţcu, T. Laurent, B. C. Pierce, M. Stronati, A. Tolmach.

    When Good Components Go Bad: Formally Secure Compilation Despite Dynamic Compromise, in: 25th ACM Conference on Computer and Communications Security (CCS), Toronto, Canada, ACM, October 2018, pp. 1351–1368, https://arxiv.org/abs/1802.00588. [ DOI : 10.1145/3243734.3243745 ]

    https://hal.archives-ouvertes.fr/hal-01949202
  • 3A. Azevedo de Amorim, M. Dénès, N. Giannarakis, C. Hriţcu, B. C. Pierce, A. Spector-Zabusky, A. Tolmach.

    Micro-Policies: Formally Verified, Tag-Based Security Monitors, in: 36th IEEE Symposium on Security and Privacy (Oakland S&P), IEEE Computer Society, May 2015, pp. 813–830. [ DOI : 10.1109/SP.2015.55 ]

    https://hal.inria.fr/hal-01265666
  • 4K. Bhargavan, B. Blanchet, N. Kobeissi.

    Verified Models and Reference Implementations for the TLS 1.3 Standard Candidate, in: 38th IEEE Symposium on Security and Privacy, San Jose, United States, May 2017, pp. 483 - 502. [ DOI : 10.1109/SP.2017.26 ]

    https://hal.inria.fr/hal-01575920
  • 5K. Bhargavan, A. Delignat-Lavaud, C. Fournet, A. Pironti, P.-Y. Strub.

    Triple Handshakes and Cookie Cutters: Breaking and Fixing Authentication over TLS, in: IEEE Symposium on Security and Privacy (Oakland), 2014, pp. 98–113.

    https://hal.inria.fr/hal-01102259
  • 6B. Blanchet.

    Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif, in: Foundations and Trends in Privacy and Security, October 2016, vol. 1, no 1–2, pp. 1–135.

    https://hal.inria.fr/hal-01423760
  • 7M. Isaakidis, H. Halpin, G. Danezis.

    UnlimitID: Privacy-Preserving Federated Identity Management Using Algebraic MACs, in: Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society, New York, NY, USA, WPES '16, ACM, 2016, pp. 139–142. [ DOI : 10.1145/2994620.2994637 ]

    https://hal.inria.fr/hal-01426847
  • 8N. Kobeissi, K. Bhargavan, B. Blanchet.

    Automated Verification for Secure Messaging Protocols and Their Implementations: A Symbolic and Computational Approach, in: 2nd IEEE European Symposium on Security and Privacy, Paris, France, April 2017, pp. 435 - 450. [ DOI : 10.1109/EuroSP.2017.38 ]

    https://hal.inria.fr/hal-01575923
  • 9N. Swamy, C. Hritcu, C. Keller, A. Rastogi, A. Delignat-Lavaud, S. Forest, K. Bhargavan, C. Fournet, P.-Y. Strub, M. Kohlweiss, J.-K. Zinzindohoué, S. Zanella-Béguelin.

    Dependent Types and Multi-Monadic Effects in F*, in: 43rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), ACM, January 2016, pp. 256-270.

    https://hal.inria.fr/hal-01265793
  • 10J.-K. Zinzindohoué, K. Bhargavan, J. Protzenko, B. Beurdouche.

    HACL*: A Verified Modern Cryptographic Library, in: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30 - November 03, 2017, 2017, pp. 1789–1806.

    https://hal.inria.fr/hal-01588421
Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 11C. Hriţcu.

    The Quest for Formally Secure Compartmentalizing Compilation, ENS Paris ; PSL Research University, January 2019, Habilitation à diriger des recherches.

    https://tel.archives-ouvertes.fr/tel-01995823
  • 12N. Kobeissi.

    Formal Verification for Real-World Cryptographic Protocols and Implementations, Inria Paris ; Ecole Normale Supérieure de Paris - ENS Paris, December 2018.

    https://hal.inria.fr/tel-01950884
  • 13J.-K. Zinzindohoué.

    Secure, fast and verified cryptographic applications: a scalable approach, Université de recherche Paris Sciences Lettres – PSL Research University, July 2018.

    https://hal.inria.fr/tel-01981380

Articles in International Peer-Reviewed Journals

  • 14D. Adrian, K. Bhargavan, Z. Durumeric, P. Gaudry, M. Green, J. A. Halderman, N. Heninger, D. Springall, E. Thomé, L. Valenta, B. Vandersloot, E. Wustrow, S. Zanella-Béguelin, P. Zimmermann.

    Imperfect forward secrecy: How Diffie-Hellman fails in practice, in: Communications of the ACM, December 2018, vol. 62, no 1, pp. 106-114. [ DOI : 10.1145/3292035 ]

    https://hal.inria.fr/hal-01982426
  • 15D. Ahman.

    Handling Fibred Algebraic Effects, in: Proceedings of the ACM on Programming Languages, January 2018, vol. 2, no POPL. [ DOI : 10.1145/3158095 ]

    https://hal.archives-ouvertes.fr/hal-01672734
  • 16D. Ahman, C. Fournet, C. Hriţcu, K. Maillard, A. Rastogi, N. Swamy.

    Recalling a Witness: Foundations and Applications of Monotonic State, in: Proceedings of the ACM on Programming Languages, January 2018, vol. 2, no POPL, https://arxiv.org/abs/1707.02466. [ DOI : 10.1145/3158153 ]

    https://hal.archives-ouvertes.fr/hal-01672733
  • 17B. Blanchet, B. Smyth.

    Automated reasoning for equivalences in the applied pi calculus with barriers, in: Journal of Computer Security, 2018, vol. 26, no 3, pp. 367 - 422. [ DOI : 10.3233/JCS-171013 ]

    https://hal.inria.fr/hal-01947972
  • 18W. J. Bowman, Y. Cong, N. Rioux, A. Ahmed.

    Type‐Preserving CPS Translation of Σ and Π Types is Not Not Possible, in: Proceedings of the ACM on Programming Languages, January 2018, vol. 2, no POPL. [ DOI : 10.1145/3158110 ]

    https://hal.archives-ouvertes.fr/hal-01672735
  • 19O. Flückiger, G. Scherer, M.-H. Yee, A. Goel, A. Ahmed, J. Vitek.

    Correctness of Speculative Optimizations with Dynamic Deoptimization, in: Proceedings of the ACM on Programming Languages, 2018, vol. 2, no POPL, https://arxiv.org/abs/1711.03050. [ DOI : 10.1145/3158137 ]

    https://hal.inria.fr/hal-01646765
  • 20M. New, A. Ahmed.

    Graduality from embedding-projection pairs, in: Proceedings of the ACM on Programming Languages, July 2018, vol. 2, no ICFP, pp. 1-30, https://arxiv.org/abs/1807.02786. [ DOI : 10.1145/3236768 ]

    https://hal.archives-ouvertes.fr/hal-01949209
  • 21N. Tabareau, É. Tanter, M. Sozeau.

    Equivalences for Free: Univalent Parametricity for Effective Transport, in: Proceedings of the ACM on Programming Languages, September 2018, pp. 1-29. [ DOI : 10.1145/3234615 ]

    https://hal.inria.fr/hal-01559073
  • 22M. Toro, R. Garcia, É. Tanter.

    Type-Driven Gradual Security with References, in: ACM Transactions on Programming Languages and Systems (TOPLAS), December 2018, vol. 40, no 4, pp. 1-55. [ DOI : 10.1145/3229061 ]

    https://hal.archives-ouvertes.fr/hal-01957581
  • 23M. Toro, E. Labrada, É. Tanter.

    Gradual Parametricity, Revisited, in: Proceedings of the ACM on Programming Languages, 2018, vol. 3, no POPL, https://arxiv.org/abs/1807.04596. [ DOI : 10.1145/3290330 ]

    https://hal.archives-ouvertes.fr/hal-01960553
  • 24N. Vazou, É. Tanter, D. Van Horn.

    Gradual liquid type inference, in: Proceedings of the ACM on Programming Languages, October 2018, vol. 2, no OOPSLA, pp. 1-25, https://arxiv.org/abs/1807.02132. [ DOI : 10.1145/3276502 ]

    https://hal.archives-ouvertes.fr/hal-01949207

International Conferences with Proceedings

  • 25C. Abate, A. Azevedo de Amorim, R. Blanco, A. N. Evans, G. Fachini, C. Hriţcu, T. Laurent, B. C. Pierce, M. Stronati, A. Tolmach.

    When Good Components Go Bad: Formally Secure Compilation Despite Dynamic Compromise, in: 25th ACM Conference on Computer and Communications Security (CCS), Toronto, Canada, ACM, October 2018, pp. 1351–1368, https://arxiv.org/abs/1802.00588. [ DOI : 10.1145/3243734.3243745 ]

    https://hal.archives-ouvertes.fr/hal-01949202
  • 26A. Azevedo de Amorim, C. Hriţcu, B. C. Pierce.

    The Meaning of Memory Safety, in: 7th International Conference on Principles of Security and Trust (POST), Thessaloniki, Greece, April 2018, pp. 79–105, https://arxiv.org/abs/1705.07354. [ DOI : 10.1007/978-3-319-89722-6_4 ]

    https://hal.archives-ouvertes.fr/hal-01949201
  • 27D. Baelde, A. Lick, S. Schmitz.

    A Hypersequent Calculus with Clusters for Linear Frames, in: Twefth Conference on Advances in Modal Logic, Bern, Switzerland, G. Bezhanishvili, G. D'Agostino, G. Metcalfe, T. Stude (editors), Advances in Modal Logic, College Publications, July 2018, vol. 12, pp. 36–55.

    https://hal.inria.fr/hal-01756126
  • 28D. Baelde, A. Lick, S. Schmitz.

    A Hypersequent Calculus with Clusters for Tense Logic over Ordinals, in: 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Ahmedabad, India, S. Ganguly, P. Pandya (editors), Leibniz International Proceedings in Informatics, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018, vol. 122, pp. 15:1–15:19. [ DOI : 10.4230/LIPIcs.FSTTCS.2018.15 ]

    https://hal.inria.fr/hal-01852077
  • 29K. Bhargavan, I. Boureanu, A. Delignat-Lavaud, P.-A. Fouque, C. Onete.

    A Formal Treatment of Accountable Proxying over TLS, in: SP 2018 - IEEE Symposium on Security and Privacy, San Francisco, United States, May 2018.

    https://hal.inria.fr/hal-01948722
  • 30K. Bhargavan, F. Kiefer, P.-Y. Strub.

    hacspec: Towards Verifiable Crypto Standards, in: Security Standardisation Research. SSR 2018, Darmstadt, Germany, November 2018, pp. 1-20. [ DOI : 10.1007/978-3-030-04762-7_1 ]

    https://hal.inria.fr/hal-01967342
  • 31B. Blanchet.

    Composition Theorems for CryptoVerif and Application to TLS 1.3, in: 31st IEEE Computer Security Foundations Symposium (CSF'18), Oxford, United Kingdom, July 2018. [ DOI : 10.1109/CSF.2018.00009 ]

    https://hal.inria.fr/hal-01947959
  • 32W. Bowman, A. Ahmed.

    Typed closure conversion for the calculus of constructions, in: PLDI’18 - 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, Philadelphia, PA, United States, June 2018, https://arxiv.org/abs/1808.04006. [ DOI : 10.1145/3296979.3192372 ]

    https://hal.archives-ouvertes.fr/hal-01949211
  • 33N. Grimm, K. Maillard, C. Fournet, C. Hriţcu, M. Maffei, J. Protzenko, T. Ramananandro, A. Rastogi, N. Swamy, S. Zanella‐Béguelin.

    A Monadic Framework for Relational Verification: Applied to Information Security, Program Equivalence, and Optimizations, in: 7th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP), Los Angeles, United States, ACM, January 2018, pp. 130–145, https://arxiv.org/abs/1703.00055. [ DOI : 10.1145/3167090 ]

    https://hal.archives-ouvertes.fr/hal-01672703
  • 34N. Kobeissi, N. Kulatova.

    Ledger Design Language: Designing and Deploying Formally Verified Public Ledgers, in: Workshop on Security Protocol Implementations: Development and Analysis, London, United Kingdom, April 2018.

    https://hal.inria.fr/hal-01948971
  • 35G. Scherer, M. New, N. Rioux, A. Ahmed.

    FabULous Interoperability for ML and a Linear Language, in: International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Thessaloniki, Greece, C. Baie, U. D. Lago (editors), FabOpen image in new windowous Interoperability for ML and a Linear Language, Springer, April 2018, vol. LNCS - Lecture Notes in Computer Science, no 10803, https://arxiv.org/abs/1707.04984. [ DOI : 10.1007/978-3-319-89366-2_8 ]

    https://hal.inria.fr/hal-01929158

Conferences without Proceedings

  • 36N. Kobeissi, K. Bhargavan.

    Noise Explorer: Fully Automated Modeling and Verification for Arbitrary Noise Protocols, in: RWC 2019 - Real World Cryptography Symposium, San Jose, United States, January 2019.

    https://hal.inria.fr/hal-01948964
  • 37K. Maillard, É. Miquey, X. Montillet, G. Munch-Maccagnoni, G. Scherer.

    A preview of a tutorial on L (polarized μμ-tilde), in: HOPE 2018 - 7th ACM SIGPLAN Workshop on Higher-Order Programming with Effects, St. Louis, United States, September 2018.

    https://hal.inria.fr/hal-01992294
  • 38G. Martínez, D. Ahman, V. Dumitrescu, N. Giannarakis, C. Hawblitzel, C. Hriţcu, M. Narasimhamurthy, Z. Paraskevopoulou, C. Pit-Claudel, J. Protzenko, T. Ramananandro, A. Rastogi, N. Swamy.

    Meta-F*: Proof automation with SMT, Tactics, and Metaprograms, in: ESOP'19 - European Symposium on Programming, Prague, Czech Republic, April 2019, https://arxiv.org/abs/1803.06547.

    https://hal.archives-ouvertes.fr/hal-01995376

Internal Reports

Other Publications

  • 40D. Baelde, A. Lick, S. Schmitz.

    Decidable XPath Fragments in the Real World, August 2018, working paper or preprint.

    https://hal.inria.fr/hal-01852475
  • 41H. Halpin, K. Ermoshina, F. Musiani.

    Co-ordinating Developers and High-Risk Users of Privacy-Enhanced Secure Messaging Protocols, November 2018, SSR 2018 - Security Standardisation Research Conference.

    https://hal.inria.fr/hal-01966560
  • 42H. Halpin.

    Decentralizing the Social Web, October 2018, INSCI'2018- 5th International conference 'Internet Science'.

    https://hal.inria.fr/hal-01966561
  • 43N. Kobeissi.

    Capsule: A Protocol for Secure Collaborative Document Editing, December 2018, working paper or preprint.

    https://hal.inria.fr/hal-01948967
References in notes
  • 44M. Abadi, B. Blanchet.

    Analyzing Security Protocols with Secrecy Types and Logic Programs, in: Journal of the ACM, January 2005, vol. 52, no 1, pp. 102–146.

    http://prosecco.gforge.inria.fr/personal/bblanche/publications/AbadiBlanchetJACM7037.pdf
  • 45M. Abadi, B. Blanchet, C. Fournet.

    Just Fast Keying in the Pi Calculus, in: ACM Transactions on Information and System Security (TISSEC), July 2007, vol. 10, no 3, pp. 1–59.

    http://prosecco.gforge.inria.fr/personal/bblanche/publications/AbadiBlanchetFournetTISSEC07.pdf
  • 46C. Abate, R. Blanco, D. Garg, C. Hritcu, M. Patrignani, J. Thibault.

    Journey Beyond Full Abstraction: Exploring Robust Property Preservation for Secure Compilation, July 2018, arXiv:1807.04603.

    https://arxiv.org/abs/1807.04603
  • 47C. Abate, A. Azevedo de Amorim, R. Blanco, A. N. Evans, G. Fachini, C. Hritcu, T. Laurent, B. C. Pierce, M. Stronati, A. Tolmach.

    When Good Components Go Bad: Formally Secure Compilation Despite Dynamic Compromise, in: 25th ACM Conference on Computer and Communications Security (CCS), ACM, October 2018, pp. 1351–1368.

    https://arxiv.org/abs/1802.00588
  • 48D. Ahman, C. Fournet, C. Hritcu, K. Maillard, A. Rastogi, N. Swamy.

    Recalling a Witness: Foundations and Applications of Monotonic State, in: PACMPL, January 2018, vol. 2, no POPL, pp. 65:1–65:30.

    https://arxiv.org/abs/1707.02466
  • 49D. Ahman, C. Hriţcu, K. Maillard, G. Martínez, G. Plotkin, J. Protzenko, A. Rastogi, N. Swamy.

    Dijkstra Monads for Free, in: 44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), ACM, January 2017, pp. 515-529. [ DOI : 10.1145/3009837.3009878 ]

    https://www.fstar-lang.org/papers/dm4free/
  • 50A. Azevedo de Amorim, M. Dénès, N. Giannarakis, C. Hriţcu, B. C. Pierce, A. Spector-Zabusky, A. Tolmach.

    Micro-Policies: Formally Verified, Tag-Based Security Monitors, in: 36th IEEE Symposium on Security and Privacy (Oakland S&P), IEEE Computer Society, May 2015, pp. 813–830. [ DOI : 10.1109/SP.2015.55 ]

    http://prosecco.gforge.inria.fr/personal/hritcu/publications/micro-policies.pdf
  • 51A. Azevedo de Amorim, C. Hritcu, B. C. Pierce.

    The Meaning of Memory Safety, in: 7th International Conference on Principles of Security and Trust (POST), April 2018, pp. 79–105. [ DOI : 10.1007/978-3-319-89722-6_4 ]

    https://arxiv.org/abs/1705.07354
  • 52K. Bhargavan, B. Blanchet, N. Kobeissi.

    Verified Models and Reference Implementations for the TLS 1.3 Standard Candidate, in: 38th IEEE Symposium on Security and Privacy, San Jose, United States, May 2017, pp. 483 - 502. [ DOI : 10.1109/SP.2017.26 ]

    https://hal.inria.fr/hal-01575920
  • 53K. Bhargavan, B. Bond, A. Delignat-Lavaud, C. Fournet, C. Hawblitzel, C. Hritcu, S. Ishtiaq, M. Kohlweiss, R. Leino, J. Lorch, K. Maillard, J. Pang, B. Parno, J. Protzenko, T. Ramananandro, A. Rane, A. Rastogi, N. Swamy, L. Thompson, P. Wang, S. Zanella-Béguelin, J.-K. Zinzindohoué.

    Everest: Towards a Verified, Drop-in Replacement of HTTPS, in: 2nd Summit on Advances in Programming Languages (SNAPL), May 2017.

    http://drops.dagstuhl.de/opus/volltexte/2017/7119/pdf/LIPIcs-SNAPL-2017-1.pdf
  • 54K. Bhargavan, A. Delignat-Lavaud, C. Fournet, M. Kohlweiss, J. Pan, J. Protzenko, A. Rastogi, N. Swamy, S. Zanella-Béguelin, J.-K. Zinzindohoué.

    Implementing and Proving the TLS 1.3 Record Layer, in: IEEE Symposium on Security and Privacy (Oakland), 2017.
  • 55K. Bhargavan, C. Fournet, R. Corin, E. Zalinescu.

    Verified Cryptographic Implementations for TLS, in: ACM Transactions Inf. Syst. Secur., March 2012, vol. 15, no 1, pp. 3:1–3:32.

    http://doi.acm.org/10.1145/2133375.2133378
  • 56K. Bhargavan, C. Fournet, A. D. Gordon, N. Swamy.

    Verified implementations of the information card federated identity-management protocol, in: ACM Symposium on Information, Computer and Communications Security (ASIACCS), 2008, pp. 123-135.
  • 57B. Blanchet, M. Abadi, C. Fournet.

    Automated Verification of Selected Equivalences for Security Protocols, in: Journal of Logic and Algebraic Programming, February–March 2008, vol. 75, no 1, pp. 3–51.

    http://prosecco.gforge.inria.fr/personal/bblanche/publications/BlanchetAbadiFournetJLAP07.pdf
  • 58B. Blanchet.

    An Efficient Cryptographic Protocol Verifier Based on Prolog Rules, in: 14th IEEE Computer Security Foundations Workshop (CSFW'01), 2001, pp. 82–96.
  • 59B. Blanchet.

    Automatic Verification of Correspondences for Security Protocols, in: Journal of Computer Security, July 2009, vol. 17, no 4, pp. 363–434.

    http://prosecco.gforge.inria.fr/personal/bblanche/publications/BlanchetJCS08.pdf
  • 60B. Blanchet, A. Podelski.

    Verification of Cryptographic Protocols: Tagging Enforces Termination, in: Theoretical Computer Science, March 2005, vol. 333, no 1-2, pp. 67–90, Special issue FoSSaCS'03.

    http://prosecco.gforge.inria.fr/personal/bblanche/publications/BlanchetPodelskiTCS04.html
  • 61D. Cadé, B. Blanchet.

    Proved Generation of Implementations from Computationally Secure Protocol Specifications, in: Journal of Computer Security, 2015, vol. 23, no 3, pp. 331–402.
  • 62J. Clulow.

    On the Security of PKCS#11, in: CHES, 2003, pp. 411-425.
  • 63S. Delaune, S. Kremer, G. Steel.

    Formal Analysis of PKCS#11 and Proprietary Extensions, in: Journal of Computer Security, November 2010, vol. 18, no 6, pp. 1211-1245. [ DOI : 10.3233/JCS-2009-0394 ]

    http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKS-jcs09.pdf
  • 64A. Delignat-Lavaud, K. Bhargavan, S. Maffeis.

    Language-Based Defenses Against Untrusted Browser Origins, in: Proceedings of the 22th USENIX Security Symposium, 2013.

    http://prosecco.inria.fr/personal/karthik/pubs/language-based-defenses-against-untrusted-origins-sec13.pdf
  • 65D. Dolev, A. Yao.

    On the security of public key protocols, in: IEEE Transactions on Information Theory, 1983, vol. IT–29, no 2, pp. 198–208.
  • 66C. Fournet, M. Kohlweiss, P.-Y. Strub.

    Modular Code-Based Cryptographic Verification, in: ACM Conference on Computer and Communications Security, 2011.
  • 67N. Grimm, K. Maillard, C. Fournet, C. Hritcu, M. Maffei, J. Protzenko, T. Ramananandro, A. Rastogi, N. Swamy, S. Zanella-Béguelin.

    A Monadic Framework for Relational Verification: Applied to Information Security, Program Equivalence, and Optimizations, in: 7th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP), ACM, January 2018, pp. 130–145. [ DOI : 10.1145/3167090 ]

    https://arxiv.org/abs/1703.00055
  • 68N. Kobeissi, K. Bhargavan, B. Blanchet.

    Automated Verification for Secure Messaging Protocols and Their Implementations: A Symbolic and Computational Approach, in: 2nd IEEE European Symposium on Security and Privacy, Paris, France, April 2017, pp. 435 - 450. [ DOI : 10.1109/EuroSP.2017.38 ]

    https://hal.inria.fr/hal-01575923
  • 69G. Martínez, D. Ahman, V. Dumitrescu, N. Giannarakis, C. Hawblitzel, C. Hritcu, M. Narasimhamurthy, Z. Paraskevopoulou, C. Pit-Claudel, J. Protzenko, T. Ramananandro, A. Rastogi, N. Swamy.

    Meta-F*: Proof Automation with SMT, Tactics, and Metaprograms, March 2018, arXiv:1803.06547.

    https://arxiv.org/abs/1803.06547
  • 70R. Needham, M. Schroeder.

    Using encryption for authentication in large networks of computers, in: Communications of the ACM, 1978, vol. 21, no 12, pp. 993–999.
  • 71J. Protzenko, J.-K. Zinzindohoué, A. Rastogi, T. Ramananandro, P. Wang, S. Zanella-Béguelin, A. Delignat-Lavaud, C. Hritcu, K. Bhargavan, C. Fournet, N. Swamy.

    Verified Low-Level Programming Embedded in F*, in: PACMPL, September 2017, vol. 1, no ICFP, pp. 17:1–17:29. [ DOI : 10.1145/3110261 ]

    http://arxiv.org/abs/1703.00053
  • 72N. Swamy, C. Fournet, A. Rastogi, K. Bhargavan, J. Chen, P.-Y. Strub, G. M. Bierman.

    Gradual typing embedded securely in JavaScript, in: 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), 2014, pp. 425-438.

    http://prosecco.inria.fr/personal/karthik/pubs/tsstar-popl14.pdf
  • 73N. Swamy, C. Hriţcu, C. Keller, A. Rastogi, A. Delignat-Lavaud, S. Forest, K. Bhargavan, C. Fournet, P.-Y. Strub, M. Kohlweiss, J.-K. Zinzindohoué, S. Zanella-Béguelin.

    Dependent Types and Multi-Monadic Effects in F*, in: 43rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), ACM, January 2016, pp. 256-270.

    https://www.fstar-lang.org/papers/mumon/
  • 74J.-K. Zinzindohoué, K. Bhargavan, J. Protzenko, B. Beurdouche.

    HACL*: A Verified Modern Cryptographic Library, in: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30 - November 03, 2017, 2017, pp. 1789–1806.

    http://doi.acm.org/10.1145/3133956.3134043


previous Previous | up Home