325 search results - page 45 / 65 » Concurrent Composition of Secure Protocols in the Timing Mod... |
105
click to vote
PERCOM
2005
ACM
15 years 9 months ago
2005
ACM
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...
ENTCS
2008
14 years 9 months ago
2008
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...
CCS
2003
ACM
15 years 2 months ago
2003
ACM
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...
102
click to vote
ASIACRYPT
2011
Springer
13 years 9 months ago
2011
Springer
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 ...
ACNS
2007
Springer
15 years 3 months ago
2007
Springer
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...