Challenges in the Automated Verification of Security Protocols (Q3541719): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-71070-7_34 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1901741109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding knowledge in security protocols under equational theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile values, new names, and secure communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intruders with Caps / rank
 
Normal rank
Property / cites work
 
Property / cites work: From One Session to Many: Dynamic Tags for Security Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Algorithms for Deciding Knowledge in Security Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated complexity analysis based on ordered resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Intruder Deductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated verification of selected equivalences for security protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of cryptographic protocols: tagging enforces termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deducibility Constraints, Equational Theory and Electronic Money / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: An NP decision procedure for protocol insecurity with XOR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2848035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical Combination of Intruder Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree automata with one memory set constraints and cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4447230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security properties: two agents are sufficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification: Theory and Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safely Composing Security Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Knowledge in Security Protocols for Monoidal Equational Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy intruder deduction problems with homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic protocol analysis for monoidal equational theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protocol Verification Via Rigid/Flexible Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2842870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint state composition theorems for public-key encryption and digital signature functionalities with local computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An attack on the Needham-Schroeder public-key authentication protocol / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic recognition of tractability in inference relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NRL Protocol Analyzer: An Overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protocol insecurity with a finite number of sessions and composed keys is NP-complete. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263167 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:27, 28 June 2024

scientific article
Language Label Description Also known as
English
Challenges in the Automated Verification of Security Protocols
scientific article

    Statements

    Challenges in the Automated Verification of Security Protocols (English)
    0 references
    0 references
    27 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references