Sciweavers

225 search results - page 44 / 45
» Weakly-Private Secret Sharing Schemes
Sort
View
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
14 years 5 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
CCS
2004
ACM
13 years 10 months ago
Privacy and security in library RFID: issues, practices, and architectures
We expose privacy issues related to Radio Frequency Identification (RFID) in libraries, describe current deployments, and suggest novel architectures for library RFID. Libraries ...
David Molnar, David Wagner
SACRYPT
2005
Springer
189views Cryptology» more  SACRYPT 2005»
13 years 10 months ago
A Scalable, Delegatable Pseudonym Protocol Enabling Ownership Transfer of RFID Tags
The ability to link two different sightings of the same Radio Frequency Identification (RFID) tag enables invasions of privacy. The problem is aggravated when an item, and the ta...
David Molnar, Andrea Soppera, David Wagner
FSTTCS
2003
Springer
13 years 10 months ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
ACNS
2009
Springer
142views Cryptology» more  ACNS 2009»
13 years 12 months ago
Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys
We enrich the classical notion of group key exchange (GKE) protocols by a new property that allows each pair of users to derive an independent peer-to-peer (p2p) key on-demand and ...
Mark Manulis