J. Cuellar, P. H. Drielsma, P. Heám, O. Kouchnarenko, J. Mantovani et al., if (Hash(N o )= H) then Check validity 51: Use the Data 52: Send(f, A, N o , o) And send the ack 53: end if 54: End 55: On reception of an ack (A, N o , o) 56: next ? DrawAccordingTo(L s A (Ng s )) Just forward it 57: Send(next, A, N o , o) 58: End [ABB + 05, Turuani, L. Viganò, and L. Vigneron. The AVISPA tool for the automated validation of internet security protocols and applications Proc. of CAV'2005, pp.281-285, 2005.

M. Arnaud, V. Cortier, and S. Delaune, Modeling and verifying ad hoc routing protocols, Proceedings of the 23rd IEEE Computer Security Foundations Symposium (CSF'10), pp.59-74, 2010.
DOI : 10.1109/csf.2010.12

URL : https://hal.archives-ouvertes.fr/hal-00881009

M. Kawazoe-aguilera, C. Delporte-gallet, H. Fauconnier, and S. Toueg, On implementing omega in systems with weak reliability and synchrony assumptions, Distributed Computing, pp.285-314, 2008.

M. Abadi and C. Fournet, Mobile values, new names, and secure communication, Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL '01, pp.104-115, 2001.
DOI : 10.1145/373243.360213

URL : https://hal.archives-ouvertes.fr/hal-01423924

]. D. Af01b and J. A. Aldous, Reversible Markov chains and random walks on graphs, 2001.

R. J. Anderson, Security Engineering: A Guide to Building Dependable Distributed Systems, 2001.

M. Abadi and P. Rogaway, Reconciling two views of cryptography (the computational soundness of formal encryption), IFIP International Conference on Theoretical Computer Science (IFIP TCS2000), 2000.

M. Arnaud, Formal verification of secured routing protocols. PHD, Ecole normale supérieure de Cachan-ENS Cachan, 2012.
URL : https://hal.archives-ouvertes.fr/tel-00675509

[. Project, AVISPA protocol library Available at http://www. avispa-project.org

[. Blanchet, M. Abadi, and C. Fournet, Automated Verification of Selected Equivalences for Security Protocols, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.3-51, 2008.
DOI : 10.1109/LICS.2005.8

[. Backes, M. Berg, and D. Unruh, A Formal Language for Cryptographic Pseudocode, LPAR 2008, pp.353-376, 2008.
DOI : 10.1007/978-3-540-89439-1_26

D. [. Brands and . Chaum, Distance-Bounding Protocols, Advances in Cryptology (EUROCRYPT'93), pp.344-359, 1994.
DOI : 10.1007/3-540-48285-7_30

Y. Bertot and P. Castéran, Interactive Theorem Proving and Program Development. Coqâ??Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS series, 2004.
DOI : 10.1007/978-3-662-07964-5

URL : https://hal.archives-ouvertes.fr/hal-00344237

[. Bellare, R. Canetti, and H. Krawczyk, Keying Hash Functions for Message Authentication, Advances in Cryptology -CRYPTO '96, pp.1-15, 1996.
DOI : 10.1007/3-540-68697-5_1

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.134.8430

C. David-basin, C. Cremers, and . Meadows, Model Checking Security Protocols, chapter 24, 2011.

[. Barthe, J. Cederquist, and S. Tarento, A Machine-Checked Formalization of the Generic Model and the Random Oracle Model, Proceedings of IJCAR'04, pp.385-399, 2004.
DOI : 10.1007/978-3-540-25984-8_29

A. Datta, A. Derek, J. C. Mitchell, and M. Turuani, Compositional analysis of contract-signing protocols, Theor. Comput. Sci, vol.367, issue.12, pp.33-56, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00103647

[. Bellare, A. Desai, E. Jokipii, and P. Rogaway, A concrete security treatment of symmetric encryption, Proceedings 38th Annual Symposium on Foundations of Computer Science, p.394, 1997.
DOI : 10.1109/SFCS.1997.646128

[. Barthe, M. Daubignard, B. Kapron, and Y. Lakhnech, Computational indistinguishability logic, Proceedings of the 17th ACM conference on Computer and communications security, CCS '10, pp.375-386, 2010.
DOI : 10.1145/1866307.1866350

[. Benaloh, Verifiable Secret-Ballot Elections, 1987.

J. Benaloh, Dense Probabilistic Encryption, Proceedings of the Workshop on Selected Areas of Cryptography, pp.120-128, 1994.

G. Barthe, B. Grégoire, S. Heraud, and S. Z. Béguelin, Computer-Aided Security Proofs for the Working Cryptographer, CRYPTO, pp.71-90, 2011.
DOI : 10.1007/978-3-642-22792-9_5

URL : https://hal.archives-ouvertes.fr/hal-01112075

[. Barthe, B. Grégoire, Y. Lakhnech, and S. Z. Béguelin, Beyond Provable Security Verifiable IND-CCA Security of OAEP, Lecture Notes in Computer Science, vol.21, issue.2, pp.180-196, 2011.
DOI : 10.1109/SP.2009.17

URL : https://hal.archives-ouvertes.fr/hal-01112084

[. Barthe, B. Grégoire, Y. Lakhnech, and S. Z. Béguelin, Beyond Provable Security Verifiable IND-CCA Security of OAEP, CT-RSA, pp.180-196, 2011.
DOI : 10.1109/SP.2009.17

URL : https://hal.archives-ouvertes.fr/hal-01112084

[. Barthe, B. Grégoire, and S. Z. Béguelin, Formal certification of code-based cryptographic proofs, POPL '09: Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp.90-101, 2009.

[. Backes, C. Hritcu, and M. Maffei, Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus, 2008 21st IEEE Computer Security Foundations Symposium, pp.195-209, 2008.
DOI : 10.1109/CSF.2008.26

[. Blanchet, A. D. Jaggard, A. Scedrov, and J. Tsay, Computationally sound mechanized proofs for basic and public-key Kerberos, Proceedings of the 2008 ACM symposium on Information, computer and communications security , ASIACCS '08, pp.87-99, 2008.
DOI : 10.1145/1368310.1368326

[. Bellare, J. Kilian, and P. Rogaway, The Security of Cipher Block Chaining, Advances in Cryptology -CRYPTO '94, 14th Annual International Cryptology Conference Proceedings, pp.341-358, 1994.
DOI : 10.1007/3-540-48658-5_32

]. B. Bla01 and . Blanchet, An efficient cryptographic protocol verifier based on prolog rules, Proc. 14th Computer Security Foundations Workshop (CSFW'01), pp.82-96, 2001.

B. Blanchet, Vérification automatique de protocoles cryptographiques : modèle formel et modèle calculatoire Automatic verification of security protocols: formal model and computational model. Mémoire d'habilitation à diriger des recherches En français avec publications en anglais en annexe, French with publications in English in appendix, 2008.

B. Blanchet, A second look at shoup's lemma, Workshop on Formal and Computational Cryptography (FCC 2011), 2011.
URL : https://hal.archives-ouvertes.fr/hal-01110443

Y. [. Bozga, M. Lakhnech, and . Perin, HERMES: An Automatic Tool for Verification of Secrecy in Security Protocols, Computer Aided Verification, 2003.
DOI : 10.1007/978-3-540-45069-6_23

J. Bohli, J. Müller-quade, and S. Röhrich, Bingo Voting: Secure and Coercion-Free Voting Using a Trusted Random Number Generator, E-Voting and Identity, pp.111-124, 2007.
DOI : 10.1007/978-3-540-77493-8_10

]. P. Bmsu01a, P. Bose, I. Morin, J. Stojmenovi?, and . Urrutia, Routing with guaranteed delivery in ad hoc wireless networks, Wireless Networks, vol.7, issue.6, pp.609-616, 2001.

[. Bose, P. Morin, I. Stojmenovi?, and J. Urrutia, wireless networks, Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications , DIALM '99, pp.609-6161012319418150, 1023.
DOI : 10.1145/313239.313282

[. Backes, M. Maffei, and D. Unruh, Computationally sound verification of source code, Proceedings of the 17th ACM conference on Computer and communications security, CCS '10, pp.387-398, 2010.
DOI : 10.1145/1866307.1866351

]. M. Bor01 and . Boreale, Symbolic trace analysis of cryptographic protocols, Proc. 28th International Colloquium on Automata, Languages and Programming (ICALP), 2001.

[. Blanchet and D. Pointcheval, Automated Security Proofs with Sequences of Games, Advances in Cryptology ? CRYPTO'06, pp.537-554, 2006.
DOI : 10.1007/11818175_32

[. Bohli and A. Pashalidis, Relations Among Privacy Notions, pp.362-380, 2009.

B. Blanchet and D. Pointcheval, The computational and decisional Diffie- Hellman assumptions in CryptoVerif, Workshop on Formal and Computational Cryptography Edimburgh, United Kingdom, 2010.

M. Bellare and P. Rogaway, Random oracles are practical, Proceedings of the 1st ACM conference on Computer and communications security , CCS '93, pp.62-73, 1993.
DOI : 10.1145/168588.168596

M. Bellare and P. Rogaway, Optimal asymmetric encryption, EURO- CRYPT, pp.92-111, 1994.
DOI : 10.1007/BFb0053428

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.1562

[. Black and P. Rogaway, CBC MACs for arbitrary-length messages: The three-key constructions, Advances in Cryptology -CRYPTO'00, pp.197-215, 2000.

[. Black and P. Rogaway, A Block-Cipher Mode of Operation for Parallelizable Message Authentication, Advances in Cryptology -EUROCRYPT 2002, pp.384-397, 2002.
DOI : 10.1007/3-540-46035-7_25

M. Bellare, P. Bellare, P. Rogaway, and D. Wagner, Code-based game-playing proofs and the security of triple encryption The EAX mode of operation, Fast Software Encryption, 11th International Workshop, pp.389-407, 2004.

[. Benaloh and D. Tuinstra, Receipt-free secret-ballot elections (extended abstract), Proceedings of the twenty-sixth annual ACM symposium on Theory of computing , STOC '94, pp.544-553, 1994.
DOI : 10.1145/195058.195407

G. Barthe and S. Tarento, A Machine-Checked Formalization of the Random Oracle Model, Proceedings of TYPES'04, pp.33-49, 2004.
DOI : 10.1007/11617990_3

[. Benaloh, Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret, Proceedings on Advances in Cryptology?CRYPTO '86, pp.251-260, 1987.

R. Michael, S. Clarkson, A. C. Chong, and . Myers, Civitas: Toward a secure voting system, IEEE Symposium on Security and Privacy, pp.354-368, 2008.

[. Degrieck and S. Delaune, Analysing routing protocols: four nodes topologies are sufficient, Pierpaolo Degano and Joshua D
URL : https://hal.archives-ouvertes.fr/hal-00732911

R. Corin and J. Hartog, A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs, Lecture Notes in Computer Science, vol.4052, issue.2, pp.252-263, 2006.
DOI : 10.1007/11787006_22

S. [. Corin and . Etalle, An Improved Constraint-Based System for the Verification of Security Protocols, Proc. 9th International Static Analysis Symposium (SAS), pp.326-341, 2002.
DOI : 10.1007/3-540-45789-5_24

[. Canetti and R. Gennaro, Incoercible multiparty computation (extended abstract), FOCS, pp.504-513, 1996.

[. Capkun and J. Hubaux, Secure positioning of wireless devices with application to sensor networks, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., 2005.
DOI : 10.1109/INFCOM.2005.1498470

[. Cortier, S. Kremer, and B. Warinschi, A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems, Journal of Automated Reasoning, vol.13, issue.1, pp.3-4225, 2011.
DOI : 10.1007/s10817-010-9187-9

URL : https://hal.archives-ouvertes.fr/inria-00525776

V. [. Comon-lundh, E. Coltier, and . Zalinescu, Deciding security properties for cryptographic protocols. application to key cycles, ACM Transactions on Computational Logic, vol.11, issue.2, pp.496-520, 2010.
DOI : 10.1145/1656242.1656244

URL : https://hal.archives-ouvertes.fr/inria-00525775

P. Mames, D. Fouque, J. Pointcheval, J. Stern, and . Traoré, On some incompatible properties of voting schemes, Proceedings of the IAVoSS Workshop on Trustworthy Elections, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00539539

[. Chakraborty and M. Nandi, An Improved Security Bound for HCTR, Fast Software Encryption: 15th International Workshop, pp.289-302, 2008.
DOI : 10.1007/978-3-540-71039-4_18

B. Chor and R. L. Rivest, A knapsack-type public key cryptosystem based on arithmetic in finite fields, IEEE Transactions on Information Theory, vol.34, issue.5, pp.901-909, 1988.
DOI : 10.1109/18.21214

[. Cremers, S. Kasper-bonne-rasmussen, and . Capkun, Distance Hijacking Attacks on Distance Bounding Protocols, 2012 IEEE Symposium on Security and Privacy, 2011.
DOI : 10.1109/SP.2012.17

]. C. Cre08 and . Cremers, The Scyther Tool: Verification, falsification, and analysis of security protocols, Computer Aided Verification, 20th International Conference, pp.414-418, 2008.

[. Chaum, P. Ryan, and S. Schneider, A Practical Voter-Verifiable Election Scheme, Computer Security -ESORICS 2005, pp.118-139, 2005.
DOI : 10.1007/11555827_8

[. Chakraborty and P. Sarkar, A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation, Lecture Notes in Computer Science, vol.4047, pp.293-309
DOI : 10.1007/11799313_19

[. Chakraborty and P. Sarkar, HCH: A New Tweakable Enciphering Scheme Using the Hash-Counter-Hash Approach, IEEE Transactions on Information Theory, vol.54, issue.4, pp.1683-1699, 2008.
DOI : 10.1109/TIT.2008.917623

M. Daubignard, Formalisation de preuves de sÃ?curitÃ? concrÃ?te, 2012.

V. [. Das and . Bharghavan, Routing in ad-hoc networks using minimum connected dominating sets, Proceedings of ICC'97, International Conference on Communications, pp.376-380, 1997.
DOI : 10.1109/ICC.1997.605303

[. Datta, A. Derek, J. C. Mitchell, and A. Roy, Protocol Composition Logic (PCL), Electronic Notes in Theoretical Computer Science, vol.172, pp.311-358, 2007.
DOI : 10.1016/j.entcs.2007.02.012

URL : http://doi.org/10.1016/j.entcs.2007.02.012

A. Datta, A. Derek, J. C. Mitchell, and B. Warinschi, Computationally Sound Compositional Logic for Key Exchange Protocols, 19th IEEE Computer Security Foundations Workshop (CSFW'06), pp.321-334, 2006.
DOI : 10.1109/CSFW.2006.9

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.5001

M. Dahl, S. Delaune, and G. Steel, Formal Analysis of Privacy for Vehicular Mix-Zones, Proceedings of the 15th European Symposium on Research in Computer Security (ESORICS'10), pp.55-70, 2010.
DOI : 10.1007/978-3-642-15497-3_4

J. Du, E. Kranakis, O. Morales-ponce, and S. Rajsbaum, Neighbor Discovery in a Sensor Network with Directional Antennae, Algosensors, 2011.
DOI : 10.1007/978-3-642-28209-6_6

[. Delaune, S. Kremer, and M. Ryan, Verifying privacy-type properties of electronic voting protocols, Journal of Computer Security, vol.17, issue.4, pp.435-487, 2009.
DOI : 10.3233/JCS-2009-0340

[. Delaune, S. Kremer, and M. D. Ryan, Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster, Towards Trustworthy Elections ? New Directions in Electronic Voting, pp.289-309, 2010.
DOI : 10.1007/978-3-642-12980-3_18

A. [. Dolev and . Yao, On the security of public key protocols, Proc. of the 22nd Symp. on Foundations of ComputerScience, pp.350-357, 1981.

]. D. Dy83a, A. Dolev, and . Yao, On the security of public key protocols. Information Theory, IEEE Transactions on, vol.29, issue.2, pp.198-208, 1983.

]. D. Dy83b, A. Dolev, . Chi-chih, and . Yao, On the security of public key protocols, IEEE Transactions on Information Theory, pp.198-207, 1983.

F. William, C. H. Ehrsam, J. L. Meyer, W. L. Smith, and . Tuchman, Message verification and transmission error detection by block chaining, 1976.

A. [. Erdene-ochir, M. Kountouris, F. Minier, and . Valois, Enhancing resiliency against routing layer attacks in wireless sensor networks: Gradient-based routing in focus, International Journal On Advances in Networks and Services, vol.4, issue.1 2, pp.38-54, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00643873

C. Eliasson and A. Zúquete, An electronic voting system supporting vote weights, Internet Research, vol.16, issue.5, pp.507-518, 2006.
DOI : 10.1108/10662240610710987

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.6106

M. [. Fournet, P. Kohlweiss, and . Strub, Modular code-based cryptographic verification, Proceedings of the 18th ACM conference on Computer and communications security, CCS '11, pp.341-350, 2011.
DOI : 10.1145/2046707.2046746

URL : https://hal.archives-ouvertes.fr/inria-00614372

R. W. Floyd, Assigning meanings to programs, Proceedings of Symposium on Applied Mathematics, vol.19, pp.19-32, 1967.
DOI : 10.1090/psapm/019/0235771

A. Fujioka, T. Okamoto, and K. Ohta, A practical secret voting scheme for large scale elections, Advances in Cryptology ? AUSCRYPT '92, pp.244-251
DOI : 10.1007/3-540-57220-1_66

[. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern, RSA-OAEP Is Secure under the RSA Assumption, Journal of Cryptology, vol.17, issue.2, pp.81-104, 2004.
DOI : 10.1007/s00145-002-0204-y

[. Fujisaki, T. Okamoto, D. Pointcheval, and J. Gjosteen, Rsa-oaep is secure under the rsa assumption Homomorphic cryptosystems based on subgroup membership problems, Progress in Cryptology - Mycrypt 2005, pp.81-104, 2004.

S. Goldwasser and S. Micali, Probabilistic encryption & how to play mental poker keeping secret all partial information, Proceedings of the fourteenth annual ACM symposium on Theory of computing , STOC '82, pp.365-377, 1982.
DOI : 10.1145/800070.802212

]. S. Hal04 and . Halevi, EME * : Extending EME to handle arbitrary-length messages with associated data, Progress in Cryptology -INDOCRYPT 2004, 5th International Conference on Cryptology in India, pp.315-327

S. Halevi, A plausible approach to computer-aided cryptographic proofs, 2005.

S. Halevi, Invertible Universal Hashing and the TET Encryption Mode, Lecture Notes in Computer Science, vol.4622, pp.412-429, 2007.
DOI : 10.1007/978-3-540-74143-5_23

M. [. Hancke and . Kuhn, An RFID Distance Bounding Protocol, First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05), pp.67-73, 2005.
DOI : 10.1109/SECURECOMM.2005.56

]. C. Hoa69 and . Hoare, An axiomatic basis for computer programming, Commun. ACM, vol.12, pp.576-580, 1969.

]. C. Hoa85 and . Hoare, Communicating Sequential Processes, 1985.

A. [. Hu, D. B. Perrig, and . Johnson, Packet leashes: a defense against wormhole attacks in wireless networks, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), pp.1976-1986, 2003.
DOI : 10.1109/INFCOM.2003.1209219

[. Hu, A. Perrig, and D. B. Johnson, Ariadne:, Proceedings of the 8th annual international conference on Mobile computing and networking , MobiCom '02, pp.21-38, 2005.
DOI : 10.1145/570645.570648

S. Halevi and P. Rogaway, A Tweakable Enciphering Mode, Lecture Notes in Computer Science, vol.2729, pp.482-499, 2003.
DOI : 10.1007/978-3-540-45146-4_28

S. Halevi and P. Rogaway, A Parallelizable Enciphering Mode, Lecture Notes in Computer Science, vol.2964, pp.292-304, 2004.
DOI : 10.1007/978-3-540-24660-2_23

]. B. Hug95 and . Hughes, Random walks and random environments, 1995.

[. Iwata and K. Kurosawa, OMAC: One-Key CBC MAC, Lecture Notes in Computer Science, vol.2887, pp.129-153, 2003.
DOI : 10.1007/978-3-540-39887-5_11

[. Iwata and K. Kurosawa, On the Security of a??New Variant of OMAC, Lecture Notes in Computer Science, vol.2971, pp.67-78, 2003.
DOI : 10.1007/978-3-540-24691-6_6

[. Iwata, K. Kurosawa, O. , T. , and X. , Stronger Security Bounds for OMAC, TMAC, and XCBC, Lecture Notes in Computer Science, vol.2904, pp.402-415, 2003.
DOI : 10.1007/978-3-540-24582-7_30

R. Impagliazzo and B. M. Kapron, Logics for reasoning about cryptographic constructions, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp.286-320, 2006.
DOI : 10.1109/SFCS.2003.1238211

A. Juels, D. Catalano, and M. Jakobsson, Coercion-resistant electronic elections, Proceedings of the 2005 ACM workshop on Privacy in the electronic society , WPES '05, 2002.
DOI : 10.1145/1102199.1102213

A. Juels, D. Catalano, and M. Jakobsson, Coercion-resistant electronic elections, Proceedings of the 2005 ACM workshop on Privacy in the electronic society , WPES '05, pp.61-70, 2005.
DOI : 10.1145/1102199.1102213

D. B. Johnson, D. A. Maltz, and J. Broch, Dsr: the dynamic source routing protocol for multihop wireless ad hoc networks, Ad hoc networking, pp.139-172, 2001.

W. Hendrik and . Lenstra-jr, On the chor-rivest knapsack cryptosystem, J. Cryptology, vol.3, pp.149-155, 1991.

S. Charanjit and . Jutla, Encryption modes with almost free message integrity, EUROCRYPT '01: Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques, pp.529-544, 2001.

R. Joaquim, A. Zúquete, and P. Ferreira, Revs -a robust electronic voting system, IADIS International Conference e-Society 2003, 2003.

A. Kassem, Formal verification of routing protocols in ad-hoc networks in presence of independent intruders, 2012.

[. Kurosawa and T. Iwata, TMAC: Two-Key CBC MAC, Lecture Notes in Computer Science, vol.2612, pp.33-49, 2003.
DOI : 10.1007/3-540-36563-X_3

S. Kremer and L. Mazaré, Computationally sound analysis of protocols using bilinear pairings, Journal of Computer Security, vol.18, issue.6, pp.999-1033, 2010.
DOI : 10.3233/JCS-2009-0388

S. Kremer, M. Ryan, and B. Smyth, Election Verifiability in Electronic Voting Protocols, Proceedings of the 15th European Symposium on Research in Computer Security, ESORICS 2010, pp.389-404
DOI : 10.1007/978-3-642-15497-3_24

[. Klus, B. Smyth, and M. D. Ryan, Proswapper: Improved equivalence verifier for proverif, 2010.

T. [. Küsters and . Truderung, An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols, 2009 30th IEEE Symposium on Security and Privacy, pp.251-266, 2009.
DOI : 10.1109/SP.2009.13

C. Byoungcheon-lee, E. Boyd, K. Dawson, J. Kim, S. Yang et al., Providing receipt-freeness in mixnet-based voting protocols, Information Security and Cryptology -ICISC 2003, pp.245-258, 2004.

]. K. Li10 and . Li, Performance analysis and evaluation of random walk algorithms on wireless networks, IPDPS Workshops, pp.1-8, 2010.

L. Langer, H. Jonker, and W. Pieters, Anonymity and Verifiability in Voting: Understanding (Un)Linkability, Proceedings of the 12th international conference on Information and communications security, ICICS'10, pp.296-310, 2010.
DOI : 10.1007/978-3-642-17650-0_21

]. L. Lov93 and . Lovász, Random walks on graphs: A survey, Combinatorics, Paul Erd?s is Eighty, pp.1-46, 1993.

]. G. Low96 and . Lowe, Breaking and fixing the Needham-Schroeder public-key protocol using FDR, Proc. 2nd International Workshop on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'96), pp.147-166, 1996.

]. G. Low98 and . Lowe, Casper: a compiler for the analysis of security protocols, J. Comput. Secur, vol.6, issue.12, pp.53-84, 1998.

[. Liskov, R. L. Rivest, and D. Wagner, Tweakable block ciphers, CRYPTO '02: Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology, pp.31-46, 2002.

[. Liskov, R. L. Rivest, and D. Wagner, Tweakable Block Ciphers, Advances in Cryptology ? CRYPTO 2002, pp.31-46, 2002.
DOI : 10.1007/3-540-45708-9_3

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.2377

A. David, S. R. Mcgrew, and . Fluhrer, The security of the extended codebook (XCB) mode of operation, Carlisle M

M. [. Merkle and . Hellman, Hiding information and signatures in trapdoor knapsacks, IEEE Transactions on Information Theory, vol.24, issue.5, pp.525-530, 2006.
DOI : 10.1109/TIT.1978.1055927

M. [. Mitchell, U. Mitchell, and . Stern, Automated analysis of cryptographic protocols using Murphi, IEEE Symposium on Security and Privacy, 1997.

T. Moran and M. Naor, Receipt-Free Universally-Verifiable Voting with Everlasting Privacy, CRYPTO 2006, pp.373-392
DOI : 10.1007/11818175_22

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.2458

C. Meadows, R. Poovendran, D. Pavlovic, L. Chang, and P. Syverson, Distance Bounding Protocols: Authentication Logic Analysis and Collusion Attacks, Secure Localization and Time Synchronization for Wireless Sensor and Ad Hoc Networks, 2006.
DOI : 10.1007/978-0-387-46276-9_12

]. J. Ms01a, V. Millen, and . Shmatikov, Constraint solving for bounded-process cryptographic protocol analysis, Proc. 8th ACM Conference on Computer and Communications Security (CCS'01, 2001.

]. J. Ms01b, V. Millen, and . Shmatikov, Constraint solving for bounded-process cryptographic protocol analysis, Proc. of the ACM Conference on Computer and Communications Security, pp.166-175, 2001.

V. [. Millen and . Shmatikov, Symbolic protocol analysis with products and Diffie-Hellman exponentiation, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings., pp.47-62, 2003.
DOI : 10.1109/CSFW.2003.1212704

A. David, J. Mcgrew, and . Viega, The security and performance of the galois/counter mode (GCM) of operation, Progress in Cryptology -INDOCRYPT 2004, 5th International Conference on Cryptology in India, pp.343-355, 2004.

D. Nowak, A Framework for Game-Based Security Proofs, ICICS, pp.319-333, 2007.
DOI : 10.1007/978-3-540-77048-0_25

[. Nipkow, L. C. Paulson, and M. Wenzel, Isabelle/HOL ? A Proof Assistant for Higher-Order Logic, LNCS, vol.2283, 2002.

M. [. Needham and . Schroeder, Using encryption for authentication in large networks of computers, Communications of the ACM, vol.21, issue.12, pp.993-999, 1978.
DOI : 10.1145/359657.359659

D. Naccache and J. Stern, A new public key cryptosystem based on higher residues, Proceedings of the 5th ACM conference on Computer and communications security , CCS '98, pp.59-66, 1998.
DOI : 10.1145/288090.288106

T. Okamoto, An electronic voting scheme, Proceedings of the IFIP World Conference on IT Tools, pp.21-30, 1996.
DOI : 10.1007/978-0-387-34979-4_3

[. Ochirkhand, M. Minier, F. Valois, and A. Kountouris, Resilient networking in wireless sensor networks, 2010.

W. [. Ortner and . Woess, Non-backtracking random walks and cogrowth of graphs. Canad, J. Math, vol.59, issue.4, pp.828-844, 2007.

]. L. Pau98 and . Paulson, The inductive approach to verifying cryptographic protocols, Journal of computer security, vol.6, issue.12, pp.85-128, 1998.

M. Paiola and B. Blanchet, Verification of security protocols with lists: From length one to unbounded length, Pierpaolo Degano and Joshua D
URL : https://hal.archives-ouvertes.fr/hal-00863387

A. Perrig, R. Canetti, J. D. Tygar, and D. Song, The tesla broadcast authentication protocol, RSA CryptoBytes, vol.5, 2002.

Z. [. Papadimitratos and . Haas, Secure routing for mobile ad hoc networks, Proc.of the SCS Communication Networks and Distributed Systems Modeling and Simulation Conference, 2002.

]. D. Poi00 and . Pointcheval, Chosen-ciphertext security for any one-way cryptosystem, PKC'00, pp.129-146, 2000.

]. J. Pol74 and . Pollard, Theorems on Factorization and Primality Testing, Mathematical Proceedings of the Cambridge Philosophical Society, vol.76, issue.03, pp.521-528, 1974.

]. C. Pon11 and . Ponsonnet, Secure probabilistic routing in wireless sensor networks, 2011.

[. Poturalski, P. Papadimitratos, and J. Hubaux, Secure neighbor discovery in wireless networks, Proceedings of the 2008 ACM symposium on Information, computer and communications security , ASIACCS '08, 2007.
DOI : 10.1145/1368310.1368338

[. Poturalski, P. Papadimitratos, and J. Hubaux, Secure neighbor discovery in wireless networks, Proceedings of the 2008 ACM symposium on Information, computer and communications security , ASIACCS '08, pp.189-200, 2008.
DOI : 10.1145/1368310.1368338

[. Poturalski, P. Papadimitratos, and J. Hubaux, Towards provable secure neighbor discovery in wireless networks, Proceedings of the 6th ACM workshop on Formal methods in security engineering, FMSE '08, pp.31-42, 2008.
DOI : 10.1145/1456396.1456400

M. Pps-+-08-]-panagiotis-papadimitratos, P. Poturalski, P. Schaller, D. Lafourcade, S. Basin et al., Secure Neighborhood Discovery: A Fundamental Element for Mobile Ad Hoc Networking, IEEE Communications Magazine, vol.46, issue.2, 2008.

E. Charles, E. M. Perkins, and . Royer, Ad-hoc on-demand distance vector routing, Pro. 2nd Workshop on Mobile Computing Systems and Appliations, pp.99-100, 1999.

[. Petrank and C. Rackoff, CBC MAC for Real-Time Data Sources, Journal of Cryptology, vol.13, issue.3, pp.315-338, 2000.
DOI : 10.1007/s001450010009

A. Roy, A. Datta, A. Derek, and J. C. Mitchell, Inductive Proofs of Computational Secrecy, ESORICS, pp.219-234, 2007.
DOI : 10.1007/978-3-540-74835-9_15

A. Roy, A. Datta, and J. C. Mitchell, Formal Proofs of Cryptographic Security of Diffie-Hellman-Based Protocols, TGC, pp.312-329, 2007.
DOI : 10.1007/978-3-540-78663-4_21

P. Rogaway, Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC, IEEE Symposium on Foundations of Secure Systems, pp.16-31, 1995.
DOI : 10.1007/978-3-540-30539-2_2

Y. A. Peter, T. Ryan, and . Peacock, Prêt à voter: a systems perspective, 2005.

. Y. Rsg-+-00-]-p, S. A. Ryan, M. H. Schneider, G. Goldsmith, A. W. Lowe et al., The modelling and analysis of security protocols: the CSP approach, 2000.

. [. Stein, The Sage Development Team, Sage Mathematics Software, 2010.

S. [. Song, A. Berezin, and . Perrig, Athena: a novel approach to efficient automatic security protocol analysis1, Journal of Computer Security, vol.9, issue.1-2, pp.47-74, 2001.
DOI : 10.3233/JCS-2001-91-203

B. Smyth and V. Cortier, Attacking and fixing helios: An analysis of ballot secrecy, Cryptology ePrint Archive, vol.625, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00732899

B. Smyth and V. Cortier, Attacking and fixing helios: An analysis of ballot secrecy, Proceedings of the 24th IEEE Computer Security Foundations Symposium (CSF'11), pp.297-311, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00732899

]. S. Sch96 and . Schneider, Security properties and CSP, Proc. of the Symposium on Security and Privacy, pp.174-187, 1996.

]. V. Shm04 and . Shmatikov, Decidable analysis of cryptographic protocols with products and modular exponentiation, Proc. 13th European Symposium On Programming, pp.355-369, 2004.

[. Shoup, OAEP Reconsidered, Journal of Cryptology, vol.15, issue.4, pp.223-249, 2002.
DOI : 10.1007/s00145-002-0133-9

]. V. Sho04 and . Shoup, Sequences of games: a tool for taming complexity in security proofs, 2004.

I. Kubo, S. Ikeda, and M. Yamashita, The hitting and cover times of random walks on finite graphs using local degree information, Contents lists available at ScienceDirect, pp.94-100, 2009.

]. G. Sla10 and . Slade, The self-avoiding walk: A brief survey To appear in Surveys in Stochastic Processes, Proceedings of the Thirty-third SPA Conference in Berlin, 2009, to be published in the EMS Series of Congress Reports, 2010.

P. Hubaux, A practical secure neighbor verification protocol for wireless sensor networks, Proceedings of the second ACM conference on Wireless network security, pp.193-200, 2009.

B. Smyth, M. D. Ryan, S. Kremer, and M. Kourjieh, Towards Automatic Analysis of Election Verifiability Properties, Proceedings of the Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security (ARSPA-WITS'10), pp.146-163
DOI : 10.1007/978-3-642-16074-5_11

M. [. Schurgers and . Srivastava, Energy efficient routing in wireless sensor networks Communications for Network-Centric Operations: Creating the Information Force, Military Communications Conference, pp.357-361, 2001.

[. Schaller, B. Schmidt, D. Basin, and S. Capkun, Modeling and Verifying Physical Properties of Security Protocols for Wireless Networks, 2009 22nd IEEE Computer Security Foundations Symposium
DOI : 10.1109/CSF.2009.6

[. Schaller, B. Schmidt, D. Basin, and S. Capkun, Modeling and Verifying Physical Properties of Security Protocols for Wireless Networks, 2009 22nd IEEE Computer Security Foundations Symposium, pp.109-123, 2009.
DOI : 10.1109/CSF.2009.6

[. Soldera, J. Seberry, and C. Qu, The Analysis of Zheng-Seberry Scheme, Lecture Notes in Computer Science, vol.2384, pp.159-168, 2002.
DOI : 10.1007/3-540-45450-0_13

[. Thayer, V. Swarup, and J. D. Guttman, Metric Strand Spaces for Locale Authentication Protocols, Proceedings, volume 321 of IFIP Conference Proceedings, pp.79-94, 2010.
DOI : 10.1007/978-3-642-13446-3_6

URL : https://hal.archives-ouvertes.fr/hal-01061320

S. Vaudenay, Cryptanalysis of the chor-rivest cryptosystem, CRYPTO '98, pp.243-256, 1998.

J. [. Vasudevan, D. Kurose, and . Towsley, On neighbor discovery in wireless networks with directional antennas, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., pp.2502-2512, 2005.
DOI : 10.1109/INFCOM.2005.1498535

R. Wen and R. Buckland, Masked Ballot Voting for Receipt-Free Online Elections, Proceedings of the 2nd International Conference on E-Voting and Identity, VOTE-ID '09, pp.18-36, 2009.
DOI : 10.1007/3-540-49264-X_32

J. [. Wegman and . Carter, Universal classes of hash functions, Journal of Computer and System Sciences, vol.18, issue.2, pp.143-154, 1919.

J. [. Wegman and . Carter, New hash functions and their use in authentication and set equality, Journal of Computer and System Sciences, vol.22, issue.3, pp.265-279, 1981.
DOI : 10.1016/0022-0000(81)90033-7

[. Wang, D. Feng, and W. Wu, On the Security of Tweakable Modes of Operation: TBC and TAE, Jianying Zhou
DOI : 10.1007/11556992_20

J. Wu and H. Li, On calculating connected dominating set for efficient routing in ad hoc wireless networks, Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications , DIALM '99, pp.7-14, 1999.
DOI : 10.1145/313239.313261

[. Zapata and N. Asokan, Securing ad hoc routing protocols, Proceedings of the ACM workshop on Wireless security , WiSE '02, 2002.
DOI : 10.1145/570681.570682

Y. Zhang, The computational SLR: a logic for reasoning about computational indistinguishability. IACR ePrint Archive, Proc. of Typed Lambda Calculi and Applications, 2008.

[. Zheng and J. Seberry, Immunizing public key cryptosystems against chosen ciphertext attacks, IEEE Journal on Selected Areas in Communications, vol.11, issue.5, pp.715-724, 1993.
DOI : 10.1109/49.223871

K. Altisen, S. Devismes, A. Gerbaud, and P. Lafourcade, Comparisons of mean hitting times for tabu random walks on finite graphs, 2011.

K. Altisen, S. Devismes, A. Gerbaud, and P. Lafourcade, Analysis of Random Walks Using Tabu Lists, Structural Information and Communication Complexity -19th International Colloquium, SIROCCO 2012, pp.254-266, 2012.
DOI : 10.1007/978-3-642-31104-8_22

K. Altisen, S. Devismes, P. Lafourcade, and C. Ponsonnet, Routage par marche aléatoire à listes tabous, Algotel, 2011.

K. Altisen, S. Devismes, P. Lafourcade, and C. Ponsonnet, Routage par marche aléatoire à listes tabous, pp.23-26, 2011.

J. Courant, M. Daubignard, C. Ene, P. Lafourcade, and Y. Lakhnech, Towards automated proofs for asymmetric encryption schemes in the random oracle model, Proceedings of the 15th ACM conference on Computer and communications security, CCS '08, pp.371-380, 2008.
DOI : 10.1145/1455770.1455817

J. Courant, M. Daubignard, C. Ene, P. Lafourcade, and Y. Lakhnech, Automated proofs for asymmetric encryption, Journal of Automated Reasoning, 2010.

C. J. Cremers, P. Lafourcade, and P. Nadeau, Comparing State Spaces in Automatic Security Protocol Analysis, Formal to Practical Security -Papers Issued from the 2005-2008 French-Japanese Collaboration, pp.70-94, 2009.
DOI : 10.1007/11805618_21

J. Dreier, P. Lafourcade, and Y. Lakhnech, Vote-Independence: A Powerful Privacy Notion for Voting Protocols, Proceedings of the 4th Workshop on Foundations & Practice of Security (FPS), 2011.
DOI : 10.1007/978-3-642-27901-0_13

URL : https://hal.archives-ouvertes.fr/hal-01338071

J. Dreier, P. Lafourcade, and Y. Lakhnech, Vote-Independence: A Powerful Privacy Notion for Voting Protocols, 2011.
DOI : 10.1007/978-3-642-27901-0_13

URL : https://hal.archives-ouvertes.fr/hal-01338071

J. Dreier, P. Lafourcade, and Y. Lakhnech, Defining Privacy for Weighted Votes, Single and Multi-voter Coercion, Computer Security -ESORICS 2012 -17th European Symposium on Research in Computer Security Proceedings, 2012.
DOI : 10.1007/978-3-642-33167-1_26

URL : https://hal.archives-ouvertes.fr/hal-01338037

J. Dreier, P. Lafourcade, and Y. Lakhnech, A formal taxonomy of privacy in voting protocols, 2012 IEEE International Conference on Communications (ICC), 2012.
DOI : 10.1109/ICC.2012.6364938

URL : https://hal.archives-ouvertes.fr/hal-01338064

J. Dreier, P. Lafourcade, and Y. Lakhnech, On defining privacy in the presence of weighted votes and the equivalence of single and multi-voter coercion, 2012.

J. Dreier, P. Lafourcade, and Y. Lakhnech, On parallel factorization of processes in the applied pi calculus, 2012.

J. Dreier, P. Lafourcade, and Y. Lakhnech, On Unique Decomposition of Processes in the Applied ??-Calculus, Technichal repoart, 2012.
DOI : 10.1007/978-3-642-37075-5_4

URL : https://hal.archives-ouvertes.fr/hal-01338002

L. Fousse, P. Lafourcade, and M. Alnuaimi, Benaloh???s Dense Probabilistic Encryption Revisited, Progress in Cryptology -AFRICACRYPT 2011 -4th International Conference on Cryptology in Africa, pp.348-362, 2011.
DOI : 10.1007/978-3-642-13190-5_2

URL : http://arxiv.org/abs/1008.2991

M. Gagné, P. Lafourcade, and Y. Lakhnech, OCaml implementation of our method. Laboratoire Verimag, 2012.

M. Gagné, P. Lafourcade, and Y. Lakhnech, Automated security proofs for message authentication codes

M. Gagne, P. Lafourcade, Y. Lakhnech, and S. Reihaneh, Automated proofs for encryption modes, 13th Annual Asian Computing Science Conference Focusing on Information Security and Privacy: Theory and Practice (ASIAN0'9), 2009.

N. Ghoualmi, N. Kahya, and P. Lafourcade, Key management protocol in wimax revisited, The Third International Conference on Communications Security and Information Assurance, 2012.

R. Jamet and P. Lafourcade, Formal Model for (k)-Neighborhood Discovery Protocols, chapter in Advances in Network Analysis and its Applications, 2012.

B. Ksie?opolski and P. Lafourcade, Attack and revison of an electronic auction protocol using OFMC, 2007.

P. Lafourcade, Application de la résolution de conflits « logiques », à l'aide à la décision pour la résolution de conflits des problèmes d'ordonnancement, 2003.

P. Lafourcade, Vérification des protocoles cryptographiques en présence de théories équationnelles, Thèse de doctorat, 0209.

P. Lafourcade, V. Terrade, and S. Vigier, Comparison of Cryptographic Verification Tools Dealing with Algebraic Properties, sixth International Workshop on Formal Aspects in Security and Trust, 2009.
DOI : 10.1007/978-3-642-12459-4_13

P. Papadimitratos, M. Poturalski, P. Schaller, P. Lafourcade, D. Basin et al., Secure neighborhood discovery: a fundamental element for mobile ad hoc networking, IEEE Communications Magazine, vol.46, issue.2, pp.132-139, 2008.
DOI : 10.1109/MCOM.2008.4473095

J. Tharaud, S. Wohlgemuth, I. Echizen, N. Sonehara, G. Müller et al., Privacy by Data Provenance with Digital Watermarking - A Proof-of-Concept Implementation for Medical Services with Electronic Health Records, 2010 Sixth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, pp.15-17, 2010.
DOI : 10.1109/IIHMSP.2010.130