|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Secrecy for Bounded Security Protocols under Composed Keys and Disequality Tests
Timisoara, Romania
September 26-September 29
ISBN: 978-0-7695-3523-4
| ASCII Text | x | ||
| Catalin V. Birjoveanu, "Secrecy for Bounded Security Protocols under Composed Keys and Disequality Tests," 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, pp. 193-196, 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2008. | |||
| BibTex | x | ||
| @article{ 10.1109/SYNASC.2008.18, author = {Catalin V. Birjoveanu}, title = {Secrecy for Bounded Security Protocols under Composed Keys and Disequality Tests}, journal ={2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing}, volume = {0}, year = {2008}, isbn = {978-0-7695-3523-4}, pages = {193-196}, doi = {http://doi.ieeecomputersociety.org/10.1109/SYNASC.2008.18}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing TI - Secrecy for Bounded Security Protocols under Composed Keys and Disequality Tests SN - 978-0-7695-3523-4 SP193 EP196 A1 - Catalin V. Birjoveanu, PY - 2008 KW - security protocol KW - secrecy problem KW - complexity KW - composed keys VL - 0 JA - 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing ER - | |||
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.
Index Terms:
security protocol, secrecy problem, complexity, composed keys
Citation:
Catalin V. Birjoveanu, "Secrecy for Bounded Security Protocols under Composed Keys and Disequality Tests," synasc, pp.193-196, 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2008
Usage of this product signifies your acceptance of the Terms of Use.