Complexity of Checking Freshness of Cryptographic Protocols


Conference paper


Zhiyao Liang, Rakesh M. Verma
Lecture Notes in Computer Science, R. Sekar, Arun K. Pujari, Information Systems Security, 4th International Conference, {ICISS} 2008, Hyderabad, India, December 16-20, 2008. Proceedings, vol. 5352, Springer, 2008, pp. 86--101

Cite

Cite

APA   Click to copy
Liang, Z., & Verma, R. M. (2008). Complexity of Checking Freshness of Cryptographic Protocols. In R. Sekar & A. K. Pujari (Eds.), Information Systems Security, 4th International Conference, {ICISS} 2008, Hyderabad, India, December 16-20, 2008. Proceedings (Vol. 5352, pp. 86–101). Springer.


Chicago/Turabian   Click to copy
Liang, Zhiyao, and Rakesh M. Verma. “Complexity of Checking Freshness of Cryptographic Protocols.” In Information Systems Security, 4th International Conference, {ICISS} 2008, Hyderabad, India, December 16-20, 2008. Proceedings, edited by R. Sekar and Arun K. Pujari, 5352:86–101. Lecture Notes in Computer Science. Springer, 2008.


MLA   Click to copy
Liang, Zhiyao, and Rakesh M. Verma. “Complexity of Checking Freshness of Cryptographic Protocols.” Information Systems Security, 4th International Conference, {ICISS} 2008, Hyderabad, India, December 16-20, 2008. Proceedings, edited by R. Sekar and Arun K. Pujari, vol. 5352, Springer, 2008, pp. 86–101.


BibTeX   Click to copy

@inproceedings{liang2008a,
  title = {Complexity of Checking Freshness of Cryptographic Protocols},
  year = {2008},
  pages = {86--101},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = {5352},
  author = {Liang, Zhiyao and Verma, Rakesh M.},
  editor = {Sekar, R. and Pujari, Arun K.},
  booktitle = {Information Systems Security, 4th International Conference, {ICISS} 2008, Hyderabad, India, December 16-20, 2008. Proceedings}
}