Sciweavers

325 search results - page 45 / 65
» Concurrent Composition of Secure Protocols in the Timing Mod...
Sort
View
PERCOM
2005
ACM
14 years 8 months ago
Security Parallels between People and Pervasive Devices
Unique and challenging security problems arise due to the scarcity of computational, storage, and power resources in the low-cost pervasive computing environment. Particularly rel...
Stephen A. Weis
ENTCS
2008
110views more  ENTCS 2008»
13 years 8 months ago
Game-Based Probabilistic Predicate Abstraction in PRISM
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
Mark Kattenbelt, Marta Z. Kwiatkowska, Gethin Norm...
CCS
2003
ACM
14 years 1 months ago
k-anonymous message transmission
Informally, a communication protocol is sender k - anonymous if it can guarantee that an adversary, trying to determine the sender of a particular message, can only narrow down it...
Luis von Ahn, Andrew Bortz, Nicholas J. Hopper
ASIACRYPT
2011
Springer
12 years 8 months ago
BiTR: Built-in Tamper Resilience
The assumption of the availability of tamper-proof hardware tokens has been used extensively in the design of cryptographic primitives. For example, Katz (Eurocrypt 2007) suggests ...
Seung Geol Choi, Aggelos Kiayias, Tal Malkin
ACNS
2007
Springer
129views Cryptology» more  ACNS 2007»
14 years 2 months ago
Gradually Convertible Undeniable Signatures
In 1990, Boyar, Chaum, Damg˚ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted b...
Laila El Aimani, Damien Vergnaud