Stéphanie Delaune
Stéphanie Delaune
Univ Rennes, CNRS, IRISA
Adresse e-mail validée de irisa.fr - Page d'accueil
Titre
Citée par
Citée par
Année
Verifying Privacy-type Properties of Electronic Voting Protocols
S Delaune, S Kremer, M Ryan
Journal of Computer Security, 2008
3672008
A survey of algebraic properties used in cryptographic protocols
V Cortier, S Delaune, P Lafourcade
Journal of Computer Security 14 (1), 1-43, 2006
2122006
Coercion-resistance and receipt-freeness in electronic voting
S Delaune, S Kremer, M Ryan
19th IEEE Computer Security Foundations Workshop (CSFW'06), 12 pp.-42, 2006
1902006
The finite variant property: How to get rid of some algebraic properties
H Comon-Lundh, S Delaune
International Conference on Rewriting Techniques and Applications, 294-307, 2005
1772005
Trace equivalence decision: Negative tests and non-determinism
V Cheval, H Comon-Lundh, S Delaune
Proceedings of the 18th ACM conference on Computer and communications …, 2011
862011
Automatic verification of privacy properties in the applied pi calculus
S Delaune, M Ryan, B Smyth
IFIP International Conference on Trust Management, 263-278, 2008
852008
Safely composing security protocols
V Cortier, S Delaune
Formal Methods in System Design 34 (1), 1-36, 2009
832009
A method for proving observational equivalence
V Cortier, S Delaune
2009 22nd IEEE Computer Security Foundations Symposium, 266-276, 2009
802009
Formal analysis of protocols based on TPM state registers
S Delaune, S Kremer, MD Ryan, G Steel
2011 IEEE 24th Computer Security Foundations Symposium, 66-80, 2011
692011
Computing knowledge in security protocols under convergent equational theories
Ş Ciobâcă, S Delaune, S Kremer
International Conference on Automated Deduction, 355-370, 2009
692009
Formal analysis of PKCS# 11
S Delaune, S Kremer, G Steel
2008 21st IEEE Computer Security Foundations Symposium, 331-344, 2008
642008
Deciding equivalence-based properties using constraint solving
V Cheval, V Cortier, S Delaune
Theoretical Computer Science 492, 1-39, 2013
622013
Verifying privacy-type properties of electronic voting protocols: A taster
S Delaune, S Kremer, M Ryan
Towards trustworthy elections, 289-309, 2010
572010
A formal analysis of authentication in the TPM
S Delaune, S Kremer, MD Ryan, G Steel
International Workshop on Formal Aspects in Security and Trust, 111-125, 2010
542010
Formal analysis of privacy for vehicular mix-zones
M Dahl, S Delaune, G Steel
European Symposium on Research in Computer Security, 55-70, 2010
512010
A theory of dictionary attacks and its complexity
S Delaune, F Jacquemard
Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004., 2-15, 2004
502004
Partial order reduction for security protocols
D Baelde, S Delaune, L Hirschi
arXiv preprint arXiv:1504.04768, 2015
492015
A decision procedure for the verification of security protocols with explicit destructors
S Delaune, F Jacquemard
Proceedings of the 11th ACM conference on Computer and communications …, 2004
492004
Easy intruder deduction problems with homomorphisms
S Delaune
Information Processing Letters 97 (6), 213-218, 2006
482006
Formal security analysis of PKCS# 11 and proprietary extensions
S Delaune, S Kremer, G Steel
Journal of Computer Security 18 (6), 1211-1245, 2010
462010
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20