"Time, computational complexity, and probability in the analysis of ..."

Max I. Kanovich et al. (2017)

> Home

Details and statistics

DOI: 10.3233/JCS-0560

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jcs/KanovichKNST17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcs/KanovichKNST17
Max I. Kanovich, Tajana Ban Kirigin, Vivek Nigam, Andre Scedrov, Carolyn L. Talcott:
Time, computational complexity, and probability in the analysis of distance-bounding protocols. J. Comput. Secur. 25(6): 585-630 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.