3 search results - page 1 / 1 » Timed protocols insecurity problem is NP-complete |
IEEEHPCS
2010
13 years 3 months ago
2010
—In this paper we study the protocol insecurity problem for time dependent security protocols with a finite number of sessions, extending to the timed case the results of M. Rus...
IH
1998
Springer
13 years 9 months ago
1998
Springer
Abstract. Currently knownbasic anonymitytechniques dependon identity veri cation. If veri cation of user identities is not possible due to the related management overhead or a gene...
JUCS
2010
12 years 11 months ago
2010
: One of the most important use-cases of Trusted Computing is Remote Attestation. It allows platforms to get a trustworthy proof of the loaded software and current configuration of...