Sciweavers

25 search results - page 4 / 5
» Breaking a Cryptographic Protocol with Pseudoprimes
Sort
View
JCS
2011
156views more  JCS 2011»
13 years 1 months ago
Securing low-cost RFID systems: An unconditionally secure approach
We explore a new direction towards solving the identity authentication problem in RFID systems. We break the RFID authentication process into two main problems: message authenticat...
Basel Alomair, Loukas Lazos, Radha Poovendran
CCS
2006
ACM
13 years 10 months ago
Data collection with self-enforcing privacy
Consider a pollster who wishes to collect private, sensitive data from a number of distrustful individuals. How might the pollster convince the respondents that it is trustworthy?...
Philippe Golle, Frank McSherry, Ilya Mironov
CRYPTO
2011
Springer
232views Cryptology» more  CRYPTO 2011»
12 years 6 months ago
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Structure-preserving signatures are signatures defined over bilinear groups that rely on generic group operations. In particular, the messages and signatures consist of group elem...
Masayuki Abe, Jens Groth, Kristiyan Haralambiev, M...
PODC
2004
ACM
13 years 11 months ago
Asynchronous group key exchange with failures
Group key exchange protocols allow a group of servers communicating over an asynchronous network of point-to-point links to establish a common key, such that an adversary which fu...
Christian Cachin, Reto Strobl
CTRSA
2009
Springer
142views Cryptology» more  CTRSA 2009»
14 years 1 months ago
Attacks on the DECT Authentication Mechanisms
Digital Enhanced Cordless Telecommunications (DECT) is a standard for connecting cordless telephones to a fixed telecommunications network over a short range. The cryptographic al...
Stefan Lucks, Andreas Schuler, Erik Tews, Ralf-Phi...