Filtrer vos résultats
- 58
- 29
- 44
- 24
- 12
- 4
- 1
- 1
- 1
- 12
- 87
- 1
- 4
- 5
- 6
- 6
- 3
- 11
- 10
- 2
- 3
- 5
- 5
- 4
- 3
- 1
- 4
- 1
- 8
- 4
- 2
- 82
- 4
- 1
- 52
- 52
- 46
- 45
- 32
- 13
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 87
- 31
- 10
- 9
- 8
- 8
- 7
- 6
- 6
- 5
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
87 résultats
|
|
Symbolic analysis of terrorist fraud resistanceComputer Security - {ESORICS} 2019 - 24th European Symposium on Research in Computer Security, Sep 2019, Luxembourg, Luxembourg
Communication dans un congrès
hal-02171218v1
|
||
|
|
Extending the SQUIRREL meta-logic for reasoning over security protocols2021
Pré-publication, Document de travail
hal-03264227v1
|
||
|
|
So near and yet so far - Symbolic verification of distance-bounding protocolsACM Transactions on Privacy and Security, 2022, 25 (2), pp.39. ⟨10.1145/3501402⟩
Article dans une revue
hal-02965322v2
|
||
|
|
A decidable class of security protocols for both reachability and equivalence properties[Research Report] Loria & Inria Grand Est; Irisa. 2020
Rapport
hal-02446170v1
|
||
|
|
Modeling and Verifying Ad Hoc Routing ProtocolsInformation and Computation, 2014, 238, pp.30-67. ⟨10.1016/j.ic.2014.07.004⟩
Article dans une revue
hal-00881009v1
|
||
|
|
Analysing routing protocols: four nodes topologies are sufficient1st International Conference on Principles of Security and Trust (POST'12), Mar 2012, Tallinn, Estonia. pp.30--50, ⟨10.1007/978-3-642-28641-4_3⟩
Communication dans un congrès
hal-00732911v1
|
||
|
|
One vote is enough for analysing privacyESORICS 2022 - 27th European Symposium on Research in Computer Security, Sep 2022, Copenhague, Denmark
Communication dans un congrès
hal-03669664v1
|
||
Modeling and Verifying Ad Hoc Routing Protocol4th International Workshop on Security and Rewriting Techniques - SecReT'09, Jul 2009, Port Jefferson, United States. pp.33-46
Communication dans un congrès
inria-00426626v1
|
|||
|
|
Combining algorithms for deciding knowledge in security protocols[Research Report] RR-6118, INRIA. 2007
Rapport
inria-00129418v2
|
||
|
|
Typing messages for free in security protocols: the case of equivalence properties[Research Report] RR-8546, INRIA. 2014, pp.46
Rapport
hal-01007580v1
|
||
|
|
A Survey of Algebraic Properties Used in Cryptographic ProtocolsJournal of Computer Security, 2006, 14 (1), pp.1-43
Article dans une revue
inria-00000552v1
|
||
|
|
Transforming Password Protocols to Compose31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), Dec 2011, Mumbai, India
Communication dans un congrès
inria-00636753v1
|
||
Deciding knowledge in security protocols for monoidal equational theories.Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis - FCS-ARSPA'07, Jul 2007, Wrocław, Poland
Communication dans un congrès
inria-00181620v1
|
|||
Safely Composing Security Protocols27th Conference on Foundations of Software Technology and Theoretical Computer Science - FSTTCS'07, Dec 2007, New Delhi, India
Communication dans un congrès
inria-00181591v1
|
|||
|
|
Safely composing security protocols[Research Report] RR-6234, INRIA. 2007, pp.26
Rapport
inria-00157889v2
|
||
Analysing Privacy-Type Properties in Cryptographic Protocols (Invited Talk)3rd International Conference on Formal Structures for Computation and Deduction, 2018, Oxford, United Kingdom
Communication dans un congrès
hal-01906649v1
|
|||
|
|
Typing messages for free in security protocols[Research Report] LSV, ENS Cachan, CNRS, INRIA, Université Paris-Saclay, Cachan (France). 2018, pp.1-49
Rapport
hal-01741172v1
|
||
|
|
Efficiently deciding equivalence for standard primitives and phasesESORICS 2018 - 23rd European Symposium on Research in Computer Security, Sep 2018, Barcelona, Spain
Communication dans un congrès
hal-01900083v1
|
||
A method for proving observational equivalence22nd IEEE Computer Security Foundations Symposium - CSF'09, Jul 2009, Port Jefferson, United States. pp.266-276
Communication dans un congrès
inria-00426622v1
|
|||
|
|
Security protocols, constraint systems, and group theories6th International Joint Conference on Automated Reasoning (IJCAR'12), Jun 2012, Manchester, United Kingdom. pp.164-178, ⟨10.1007/978-3-642-31365-3_15⟩
Communication dans un congrès
hal-00729091v1
|
||
Modeling and Verifying Ad Hoc Routing Protocols.23rd IEEE Computer Security Foundations Symposium - CSF'10, 2010, Edinburgh, United Kingdom
Communication dans un congrès
inria-00525779v1
|
|||
|
|
Decidability of trace equivalence for protocols with nonces28th IEEE Computer Security Foundations Symposium (CSF'15), Jul 2015, Verona, Italy. ⟨10.1109/CSF.2015.19⟩
Communication dans un congrès
hal-01206276v1
|
||
|
|
SAT-Equiv: An Efficient Tool for Equivalence Properties30th IEEE Computer Security Foundations Symposium (CSF'17), Jul 2017, Santa Barbara, United States. pp.481 - 494, ⟨10.1109/CSF.2017.15⟩
Communication dans un congrès
hal-01624274v1
|
||
|
|
Proving physical proximity using symbolic models[Research Report] Univ Rennes, CNRS, IRISA, France. 2018
Rapport
hal-01708336v1
|
||
|
|
Automatic generation of sources lemmas in Tamarin: towards automatic proofs of security protocolsESORICS 2020 - 25th European Symposium on Research in Computer Security, Sep 2020, Guilford, United Kingdom. pp.3--22, ⟨10.1007/978-3-030-59013-0_1⟩
Communication dans un congrès
hal-02903620v1
|
||
|
|
Cracking the Stateful NutCSF 2022 - 35th IEEE Computer Security Foundations Symposium, Aug 2022, Haifa, Israel
Communication dans un congrès
hal-03500056v1
|
||
|
|
A procedure for deciding symbolic equivalence between sets of constraint systemsInformation and Computation, 2017, 255, pp.94 - 125. ⟨10.1016/j.ic.2017.05.004⟩
Article dans une revue
hal-01584242v1
|
||
|
|
Deciding equivalence-based properties using constraint solvingTheoretical Computer Science, 2013, 492, pp.1-39. ⟨10.1016/j.tcs.2013.04.016⟩
Article dans une revue
hal-00881060v1
|
||
|
|
New Algorithm for Exhausting Optimal Permutations for Generalized Feistel NetworksINDOCRYPT 2022: 23rd International Conference on Cryptology in India, Dec 2022, Kolkata, India. pp.103-124, ⟨10.1007/978-3-031-22912-1_5⟩
Communication dans un congrès
hal-03927074v1
|
||
|
|
Automatic generation of sources lemmas in TAMARIN: towards automatic proofs of security protocolsJournal of Computer Security, 2022, 30 (4), pp.573-598. ⟨10.3233/JCS-210053⟩
Article dans une revue
hal-03767104v1
|