• DocumentCode
    3632764
  • Title

    Secrecy for Bounded Security Protocols under Composed Keys and Disequality Tests

  • Author

    Catalin V. Birjoveanu

  • Author_Institution
    Dept. of Comput. Sci., Al.I.Cuza Univ. of Iasi, Iasi, Romania
  • fYear
    2008
  • Firstpage
    193
  • Lastpage
    196
  • Abstract
    In this paper, we extend some complexity results on thesecrecy problem for bounded security protocols by adding composed keys and disequality tests to an existing model for security protocols.
  • Keywords
    "Protocols","Testing","Data security","Cryptography","Scientific computing","Computer security","Computer science","Electronic mail","Helium"
  • Publisher
    ieee
  • Conference_Titel
    Symbolic and Numeric Algorithms for Scientific Computing, 2008. SYNASC ´08. 10th International Symposium on
  • Print_ISBN
    978-0-7695-3523-4
  • Type

    conf

  • DOI
    10.1109/SYNASC.2008.18
  • Filename
    5204810
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3632764