Search dblp for Publications

export results for "Time, computational complexity, and probability in the analysis of distance-bounding protocols"

 download as .bib file

@article{DBLP:journals/jcs/KanovichKNST17,
  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      = {J. Comput. Secur.},
  volume       = {25},
  number       = {6},
  pages        = {585--630},
  year         = {2017},
  url          = {https://doi.org/10.3233/JCS-0560},
  doi          = {10.3233/JCS-0560},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jcs/KanovichKNST17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KanovichKNST17,
  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      = {CoRR},
  volume       = {abs/1702.03504},
  year         = {2017},
  url          = {http://arxiv.org/abs/1702.03504},
  eprinttype    = {arXiv},
  eprint       = {1702.03504},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/KanovichKNST17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics