Protocol insecurity with a finite number of sessions and composed keys is NP-complete. (Q1874404): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4536615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure networking - CQRE [Secure] '99. International exhibition and congress. Düsseldorf, Germany, November 30--December 2, 1999. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the security of public key protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2767013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NRL Protocol Analyzer: An Overview / rank
 
Normal rank

Latest revision as of 15:53, 5 June 2024

scientific article
Language Label Description Also known as
English
Protocol insecurity with a finite number of sessions and composed keys is NP-complete.
scientific article

    Statements

    Protocol insecurity with a finite number of sessions and composed keys is NP-complete. (English)
    0 references
    0 references
    0 references
    25 May 2003
    0 references
    Verification
    0 references
    Security
    0 references
    Protocols
    0 references
    Rewriting
    0 references
    Complexity
    0 references

    Identifiers