• School of Computer Science
  Personal Web Page
• Home
• Publications
• CV
• Links

Journals

• [ARR09]
  M. Arapinis, M. Calder, L. Dennis, M. Fisher, P. Gray, S. Konur, A. Miller, E. Ritter, M. Ryan, S. Schewe, C. Unsworth and R. Yasmin. Towards the Verification of Pervasive Systems. Electronic Communication of the European Association of Software Science and Technology 22, 2009.
• [LGAD04]
  F. Loulergue, F. Gava, M. Arapinis and F. Dabrowski. Semantics and Implementation of Minimally Synchronous Parallel ML. International Journal of Computer & Information Science 5(3), pages 182-199, 2004.

Conferences

• [POST13]
  M. Arapinis, V. Cortier, S. Kremer and M. Ryan. Practical everlasting privacy. In POST'13. Second Conference on Principles of Security and Trust , 2013 (to appear).
• [AMRR12]
  M. Arapinis, L. Mancini, E. Ritter, M. Ryan, N. Golde, K. Redon and R. Borgaonkar. New privacy issues in mobile telephony: fix and verification. In CCS'12. ACM Press , 2012.
• [ACD12]
  M. Arapinis, V. Cheval and S. Delaune. Verifying privacy-type properties in a modular way. In CSF'12. IEEE Computer Society Press , 2012 .
• [ABR12a]
  M. Arapinis, S. Bursuc and M. Ryan. Privacy supporting cloud computing: ConfiChair, a case study. In POST'12. First Conference on Principles of Security and Trust, pages 89-108 , 2012.
• [ABR12b]
  M. Arapinis, S. Bursuc and M. Ryan. Reduction of equational theories for verification of trace equivalence: re-encryption and AC. In POST'12. First Conference on Principles of Security and Trust, pages 169-188 , 2012.
• [ARR11]
  M. Arapinis, E. Ritter and M. Ryan. StatVerif: Verification of Stateful Processes. In CSF'11. IEEE Computer Society Press, pages 33-47 , 2011.
• [ACRR10]
  M. Arapinis, T. Chothia, E. Ritter and M. Ryan. Analysing Unlinkability and Anonymity Using the Applied Pi Calculus. In CSF'10. IEEE Computer Society Press, pages 107-121 , 2010.
• [ACRR09]
  M. Arapinis, T. Chothia, E. Ritter and M. Ryan. Untraceability in the applied pi calculus. In ICITST 2009. 4th International Conference for Internet Technology and Secured Transactions, pages 1-6 , 2009 .
• [ADK08]
  M. Arapinis, S. Delaune and S. Kremer. From One Session To Many: Dynamic Tags for Security Protocols. In LPAR'08, LNAI 5220, pages 128-142 Springer, 2008.
• [AD07]
  M. Arapinis and M. Duflot. Bounding messages for free in security protocols. In FSTTCS'07, LNCS 4855, pages 376-387 Springer, 2007.
• [ALGD03]
  M. Arapinis, F. Loulergue, F. Gava and F. Dabrowski. Semantics of Minimally Synchronous Parallel ML. In SNPD'03, pages 260-267 International Association for Computer and Information Science, 2003.

Theses

• [Ara08]
  M. Arapinis. Sécurité des protocoles cryptographiques: décidabilité et résultats de réduction. Thèse de doctorat, Université Paris 12, Créteil, France, November 2008.

Other Publications

• [ACD12rr]
  M. Arapinis, V. Cheval and S. Delaune. Verifying privacy-type properties in a modular way. Research Report LSV-12-03, Laboratoire Spécification et Vérification, ENS Cachan, France, 33 pages, 2012.
• [ADK08rr]
  M. Arapinis, S. Delaune and S. Kremer. From one Session to many: Dynamic Tags for Security Protocols. Research Report LSV-08-17 May, Laboratoire Spécification et Vérification, ENS Cachan, France, 28 pages, 2008.