Zobrazeno 1 - 10
of 203
pro vyhledávání: '"Capkun, S."'
An internet user wanting to share observed content is typically restricted to primitive techniques such as screenshots, web caches or share button-like solutions. These acclaimed proofs, however, are either trivial to falsify or require trust in cent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1032::d9024e72add0789be72236887f33421c
http://hdl.handle.net/10044/1/85569
http://hdl.handle.net/10044/1/85569
Publikováno v:
26th USENIX Security Symposium
Security architectures such as Intel SGX need protection against rollback attacks, where the adversary violates the integrity of a protected application state by re-playing old persistently stored data or by starting multiple application instances. S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1032::6b023ae4c99461b7da8f12adcbf3cd36
http://hdl.handle.net/10044/1/85568
http://hdl.handle.net/10044/1/85568
Autor:
Ranganathan, A., Tippenhauer, N.O., Skoric, B., Singelée, D., Capkun, S., Foresti, S., Yung, M., Martinelli, F.
Publikováno v:
Computer Security – ESORICS 2012 ISBN: 9783642331664
ESORICS
Computer Security – ESORICS 2012 (17th European Symposium on Research in Computer Security, Pisa, Italy, September 10-12, 2012. Proceedings), 415-432
STARTPAGE=415;ENDPAGE=432;TITLE=Computer Security – ESORICS 2012 (17th European Symposium on Research in Computer Security, Pisa, Italy, September 10-12, 2012. Proceedings)
ESORICS
Computer Security – ESORICS 2012 (17th European Symposium on Research in Computer Security, Pisa, Italy, September 10-12, 2012. Proceedings), 415-432
STARTPAGE=415;ENDPAGE=432;TITLE=Computer Security – ESORICS 2012 (17th European Symposium on Research in Computer Security, Pisa, Italy, September 10-12, 2012. Proceedings)
Given the requirements of fast processing and the complexity of RF ranging systems, distance bounding protocols have been challenging to implement so far; only few designs have been proposed and implemented. Currently, the most efficient implementati
Autor:
Bird, N., Conrado, C., Guajardo, J., Maubach, S., Schrijen, G.J., Skoric, B., Tombeur, A.M.H., Thueringer, P., Tuyls, P.T., Stajano, F., Meadows, C., Capkun, S., Moore, T.
Publikováno v:
Proceedings of the 4th European Workshop on Security and Privacy in Ad-hoc and Sensor Networks (ESAS 2007) 2-3 July 2007, Cambridge, United Kingdom, 187-202
STARTPAGE=187;ENDPAGE=202;TITLE=Proceedings of the 4th European Workshop on Security and Privacy in Ad-hoc and Sensor Networks (ESAS 2007) 2-3 July 2007, Cambridge, United Kingdom
Security and Privacy in Ad-hoc and Sensor Networks ISBN: 9783540732747
ESAS
STARTPAGE=187;ENDPAGE=202;TITLE=Proceedings of the 4th European Workshop on Security and Privacy in Ad-hoc and Sensor Networks (ESAS 2007) 2-3 July 2007, Cambridge, United Kingdom
Security and Privacy in Ad-hoc and Sensor Networks ISBN: 9783540732747
ESAS
In this paper, we introduce several new mechanisms that are cheap to implement or integrate into RFID tags and that at the same time enhance their security and privacy properties. Our aim is to provide solutions that make use of existing (or expected
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::918a17ee806fea443566524a2d2dd1f8
https://research.tue.nl/nl/publications/72ac77b9-a455-4f9a-921c-ec15b0a90f9a
https://research.tue.nl/nl/publications/72ac77b9-a455-4f9a-921c-ec15b0a90f9a
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
2010 IEEE International Conference on RFID; 2010, p37-44, 8p
Publikováno v:
2009 22nd IEEE Computer Security Foundations Symposium; 2009, p109-123, 15p
Publikováno v:
2009 Eighth IEEE International Symposium on Network Computing & Applications; 2009, p278-283, 6p