Bounding Messages for Free in Security Protocols (Q5458850): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Bounding Messages for Free in 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: Tree automata with one memory set constraints and cryptographic protocols / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Safely Composing Security Protocols / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computer Science Logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deciding Key Cycles for Security Protocols / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4418589 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank | |||
Normal rank |
Latest revision as of 22:10, 27 June 2024
scientific article; zbMATH DE number 5267239
Language | Label | Description | Also known as |
---|---|---|---|
English | Bounding Messages for Free in Security Protocols |
scientific article; zbMATH DE number 5267239 |
Statements
Bounding Messages for Free in Security Protocols (English)
0 references
24 April 2008
0 references