Computer Science Logic
From MaRDI portal
Publication:5292632
DOI10.1007/b13224zbMath1116.94314OpenAlexW2623947920MaRDI QIDQ5292632
Laurent Vigneron, Yannick Chevalier, Mathieu Turuani, Ralf Küsters, Michaël Rusinowitch
Publication date: 21 June 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13224
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Bounding messages for free in security protocols -- extension to various security properties ⋮ Bounding Messages for Free in Security Protocols
This page was built for publication: Computer Science Logic