Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
  • Lahav O and Zohar Y. (2019). Pure Sequent Calculi. ACM Transactions on Computational Logic. 20:3. (1-38). Online publication date: 31-Jul-2019.

    https://doi.org/10.1145/3319501

  • Barthe G, Fan X, Gancher J, Grégoire B, Jacomme C and Shi E. Symbolic Proofs for Lattice-Based Cryptography. Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. (538-555).

    https://doi.org/10.1145/3243734.3243825

  • Avanesov T, Chevalier Y, Rusinowitch M and Turuani M. (2017). Satisfiability of general intruder constraints with and without a set constructor. Journal of Symbolic Computation. 80:P1. (27-61). Online publication date: 1-May-2017.

    https://doi.org/10.1016/j.jsc.2016.07.009

  • Zohar Y and Zamansky A. Gen2sat. Proceedings of the 8th International Joint Conference on Automated Reasoning - Volume 9706. (487-495).

    https://doi.org/10.1007/978-3-319-40229-1_33

  • Baudet M, Cortier V and Delaune S. (2013). YAPA. ACM Transactions on Computational Logic. 14:1. (1-32). Online publication date: 1-Feb-2013.

    https://doi.org/10.1145/2422085.2422089

  • Cortier V and Delaune S. (2012). Decidability and Combination Results for Two Notions of Knowledge in Security Protocols. Journal of Automated Reasoning. 48:4. (441-487). Online publication date: 1-Apr-2012.

    https://doi.org/10.1007/s10817-010-9208-8

  • Blanchet B. Security protocol verification. Proceedings of the First international conference on Principles of Security and Trust. (3-29).

    https://doi.org/10.1007/978-3-642-28641-4_2

  • Anantharaman S, Bouchard C, Narendran P and Rusinowitch M. Unification modulo chaining. Proceedings of the 6th international conference on Language and Automata Theory and Applications. (70-82).

    https://doi.org/10.1007/978-3-642-28332-1_7

  • Escobar S, Kapur D, Lynch C, Meadows C, Meseguer J, Narendran P and Sasse R. Protocol analysis in Maude-NPA using unification modulo homomorphic encryption. Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming. (65-76).

    https://doi.org/10.1145/2003476.2003488

  • Küsters R and Truderung T. (2011). Reducing Protocol Analysis with XOR to the XOR-Free Case in the Horn Theory Based Approach. Journal of Automated Reasoning. 46:3-4. (325-352). Online publication date: 1-Apr-2011.

    https://doi.org/10.1007/s10817-010-9188-8

  • Li Z and Wang W. Rethinking about guessing attacks. Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security. (316-325).

    https://doi.org/10.1145/1966913.1966954

  • Li Z and Wang W. Deciding recognizability under Dolev-Yao intruder model. Proceedings of the 13th international conference on Information security. (416-429).

    /doi/10.5555/1949317.1949365

  • Conchinha B, Basin D and Caleiro C. Efficient decision procedures for message deducibility and static equivalence. Proceedings of the 7th International conference on Formal aspects of security and trust. (34-49).

    /doi/10.5555/1964555.1964558

  • Kanovich M, Kirigin T, Nigam V and Scedrov A. Bounded memory Dolev-Yao adversaries in collaborative systems. Proceedings of the 7th International conference on Formal aspects of security and trust. (18-33).

    /doi/10.5555/1964555.1964557

  • Baskar A, Ramanujam R and Suresh S. A DEXPTIME-complete Dolev-Yao theory with distributive encryption. Proceedings of the 35th international conference on Mathematical foundations of computer science. (102-113).

    /doi/10.5555/1885577.1885588

  • Comon-Lundh H, Cortier V and Zălinescu E. (2010). Deciding security properties for cryptographic protocols. application to key cycles. ACM Transactions on Computational Logic. 11:2. (1-42). Online publication date: 1-Jan-2010.

    https://doi.org/10.1145/1656242.1656244

  • Blanchet B. (2009). Automatic verification of correspondences for security protocols. Journal of Computer Security. 17:4. (363-434). Online publication date: 1-Dec-2009.

    /doi/10.5555/1576303.1576304

  • Anantharaman S, Lin H, Lynch C, Narendran P and Rusinowitch M. Unification modulo homomorphic encryption. Proceedings of the 7th international conference on Frontiers of combining systems. (100-116).

    /doi/10.5555/1807707.1807715

  • Cortier V and Delaune S. (2009). Safely composing security protocols. Formal Methods in System Design. 34:1. (1-36). Online publication date: 1-Feb-2009.

    https://doi.org/10.1007/s10703-008-0059-4

  • Küsters R and Truderung T. Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach. Proceedings of the 15th ACM conference on Computer and communications security. (129-138).

    https://doi.org/10.1145/1455770.1455788

  • Kremer S, Mercier A and Treinen R. Proving Group Protocols Secure Against Eavesdroppers. Proceedings of the 4th international joint conference on Automated Reasoning. (116-131).

    https://doi.org/10.1007/978-3-540-71070-7_9

  • Chevalier Y, Küsters R, Rusinowitch M and Turuani M. (2008). Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption. ACM Transactions on Computational Logic. 9:4. (1-52). Online publication date: 1-Aug-2008.

    https://doi.org/10.1145/1380572.1380573

  • Delaune S, Lafourcade P, Lugiez D and Treinen R. (2008). Symbolic protocol analysis for monoidal equational theories. Information and Computation. 206:2-4. (312-351). Online publication date: 1-Feb-2008.

    https://doi.org/10.1016/j.ic.2007.07.005

  • Chevalier Y and Rusinowitch M. (2008). Hierarchical combination of intruder theories. Information and Computation. 206:2-4. (352-377). Online publication date: 1-Feb-2008.

    https://doi.org/10.1016/j.ic.2007.07.004

  • Cortier V, Delaitre J and Delaune S. Safely composing security protocols. Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science. (352-363).

    /doi/10.5555/1781794.1781825

  • Cortier V, Delaitre J and Delaune S. Safely Composing Security Protocols. FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science. (352-363).

    https://doi.org/10.1007/978-3-540-77050-3_29

  • Delaune S, Lin H and Lynch C. Protocol verification via rigid/flexible resolution. Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning. (242-256).

    /doi/10.5555/1779419.1779438

  • Cortier V and Delaune S. Deciding knowledge in security protocols for monoidal equational theories. Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning. (196-210).

    /doi/10.5555/1779419.1779435

  • Delaune S, Lin H and Lynch C. Protocol Verification Via Rigid/Flexible Resolution. Logic for Programming, Artificial Intelligence, and Reasoning. (242-256).

    https://doi.org/10.1007/978-3-540-75560-9_19

  • Cortier V and Delaune S. Deciding Knowledge in Security Protocols for Monoidal Equational Theories. Logic for Programming, Artificial Intelligence, and Reasoning. (196-210).

    https://doi.org/10.1007/978-3-540-75560-9_16

  • Arnaud M, Cortier V and Delaune S. Combining Algorithms for Deciding Knowledge in Security Protocols. Proceedings of the 6th international symposium on Frontiers of Combining Systems. (103-117).

    https://doi.org/10.1007/978-3-540-74621-8_7

  • Lafourcade P. (2007). Intruder Deduction for the Equational Theory of Exclusive-or with Commutative and Distributive Encryption. Electronic Notes in Theoretical Computer Science (ENTCS). 171:4. (37-57). Online publication date: 1-Jul-2007.

    https://doi.org/10.1016/j.entcs.2007.02.054

  • Meseguer J and Thati P. (2007). Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. Higher-Order and Symbolic Computation. 20:1-2. (123-160). Online publication date: 1-Jun-2007.

    https://doi.org/10.1007/s10990-007-9000-6

  • Lafourcade P, Lugiez D and Treinen R. (2007). Intruder deduction for the equational theory of Abelian groups with distributive encryption. Information and Computation. 205:4. (581-623). Online publication date: 1-Apr-2007.

    https://doi.org/10.1016/j.ic.2006.10.008

  • Cortier V, Keighren G and Steel G. Automatic analysis of the security of XOR-based key management schemes. Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems. (538-552).

    /doi/10.5555/1763507.1763562

  • Küsters R and Truderung T. On the automatic analysis of recursive security protocols with XOR. Proceedings of the 24th annual conference on Theoretical aspects of computer science. (646-657).

    /doi/10.5555/1763424.1763500

  • Bursuc S, Comon-Lundh H and Delaune S. Associative-commutative deducibility constraints. Proceedings of the 24th annual conference on Theoretical aspects of computer science. (634-645).

    /doi/10.5555/1763424.1763499

  • Bursuc S, Comon-Lundh H and Delaune S. Deducibility constraints, equational theory and electronic money. Rewriting Computation and Proof. (196-212).

    /doi/10.5555/2391276.2391289

  • Cortier V, Kremer S, Küsters R and Warinschi B. Computationally sound symbolic secrecy in the presence of hash functions. Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science. (176-187).

    https://doi.org/10.1007/11944836_18

  • Delaune S. (2006). An undecidability result for AGh. Theoretical Computer Science. 368:1-2. (161-167). Online publication date: 1-Dec-2006.

    https://doi.org/10.1016/j.tcs.2006.08.018

  • Chevalier Y and Rusinowitch M. Hierarchical combination of intruder theories. Proceedings of the 17th international conference on Term Rewriting and Applications. (108-122).

    https://doi.org/10.1007/11805618_9

  • Delaune S, Lafourcade P, Lugiez D and Treinen R. Symbolic protocol analysis in presence of a homomorphism operator and exclusive or. Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II. (132-143).

    https://doi.org/10.1007/11787006_12

  • Cortier V, Delaune S and Lafourcade P. (2006). A survey of algebraic properties used in cryptographic protocols. Journal of Computer Security. 14:1. (1-43). Online publication date: 1-Jan-2006.

    /doi/10.5555/1239376.1239377

  • Escobar S, Meadows C and Meseguer J. A rewriting-based inference system for the NRL protocol analyzer. Proceedings of the 2005 ACM workshop on Formal methods in security engineering. (1-12).

    https://doi.org/10.1145/1103576.1103578

  • Backes M and Pfitzmann B. Limits of the cryptographic realization of dolev-yao-style XOR. Proceedings of the 10th European conference on Research in Computer Security. (178-196).

    https://doi.org/10.1007/11555827_11

  • Steel G. Deduction with XOR constraints in security API modelling. Proceedings of the 20th international conference on Automated Deduction. (322-336).

    https://doi.org/10.1007/11532231_24

  • Chevalier Y and Rusinowitch M. Combining intruder theories. Proceedings of the 32nd international conference on Automata, Languages and Programming. (639-651).

    https://doi.org/10.1007/11523468_52

  • Boreale M and Buscemi M. (2005). A method for symbolic analysis of security protocols. Theoretical Computer Science. 338:1-3. (393-425). Online publication date: 10-Jun-2005.

    https://doi.org/10.1016/j.tcs.2005.03.044

  • Chevalier Y, Küsters R, Rusinowitch M and Turuani M. (2005). An NP decision procedure for protocol insecurity with XOR. Theoretical Computer Science. 338:1-3. (247-274). Online publication date: 10-Jun-2005.

    https://doi.org/10.1016/j.tcs.2005.01.015

  • Millen J and Shmatikov V. (2005). Symbolic protocol analysis with an Abelian group operator or Diffie-Hellman exponentiation. Journal of Computer Security. 13:3. (515-564). Online publication date: 1-May-2005.

    /doi/10.5555/1145948.1145954

  • Lafourcade P, Lugiez D and Treinen R. Intruder deduction for AC-like equational theories with homomorphisms. Proceedings of the 16th international conference on Term Rewriting and Applications. (308-322).

    https://doi.org/10.1007/978-3-540-32033-3_23

  • Comon-Lundh H and Delaune S. The finite variant property. Proceedings of the 16th international conference on Term Rewriting and Applications. (294-307).

    https://doi.org/10.1007/978-3-540-32033-3_22

  • Mazaré L. (2005). Satisfiability of Dolev-Yao Constraints. Electronic Notes in Theoretical Computer Science (ENTCS). 125:1. (109-124). Online publication date: 1-Mar-2005.

    https://doi.org/10.1016/j.entcs.2004.05.022

  • Chevalier Y, Küsters R, Rusinowitch M and Turuani M. (2005). Deciding the Security of Protocols with Commuting Public Key Encryption. Electronic Notes in Theoretical Computer Science (ENTCS). 125:1. (55-66). Online publication date: 1-Mar-2005.

    https://doi.org/10.1016/j.entcs.2004.05.019

  • Meseguer J and Thati P. (2005). Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols. Electronic Notes in Theoretical Computer Science (ENTCS). 117:C. (153-182). Online publication date: 20-Jan-2005.

    /doi/10.5555/2773803.2773979

  • Delaune S and Jacquemard F. A decision procedure for the verification of security protocols with explicit destructors. Proceedings of the 11th ACM conference on Computer and communications security. (278-287).

    https://doi.org/10.1145/1030083.1030121

  • Backes M, Meadows C and Mitchell J. Relating cryptography and formal methods. Proceedings of the 2003 ACM workshop on Formal methods in security engineering. (61-66).

    https://doi.org/10.1145/1035429.1035436

  • Comon-Lundh H and Cortier V. New decidability results for fragments of first-order logic and application to cryptographic protocols. Proceedings of the 14th international conference on Rewriting techniques and applications. (148-164).

    /doi/10.5555/1759148.1759161