• Sorted by Date • Classified by Publication Type • Classified by Research Category •
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, and Carolyn L. Talcott. Time, computational complexity, and probability in the analysis of distance-bounding protocols. Journal of Computer Security, 25(6):585–630, 2017.
This extends our POST 2015 paper.
[PDF] [gzipped postscript] [postscript] [HTML]
(unavailable)
@article{kanovich17jcs,
author = {Max I. Kanovich and
Tajana Ban Kirigin and
Vivek Nigam and
Andre Scedrov and
Carolyn L. Talcott},
title = {Time, computational complexity, and probability in the analysis of
distance-bounding protocols},
journal = {Journal of Computer Security},
volume = {25},
number = {6},
pages = {585--630},
year = {2017},
url = {https://doi.org/10.3233/JCS-0560},
doi = {10.3233/JCS-0560},
timestamp = {Wed, 30 Aug 2017 15:38:06 +0200},
biburl = {http://dblp.uni-trier.de/rec/bib/journals/jcs/KanovichKNST17},
bibsource = {dblp computer science bibliography, http://dblp.org},
bib2html_pubtype = {Journal},
bib2html_rescat = {Foundations of Computer Security},
bib2html_dl_pdf = "/docs/post-journal-final.pdf",
wwwnote = "This extends our POST 2015 paper."
}
Generated by bib2html.pl (written by Patrick Riley ) on Mon Jan 08, 2024 13:46:57