Sciweavers

1777 search results - page 191 / 356
» Programming Cryptographic Protocols
Sort
View
PERCOM
2005
ACM
16 years 1 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
MOBIHOC
2007
ACM
16 years 1 months ago
Surviving attacks on disruption-tolerant networks without authentication
Disruption-Tolerant Networks (DTNs) deliver data in network environments composed of intermittently connected nodes. Just as in traditional networks, malicious nodes within a DTN ...
John Burgess, George Dean Bissias, Mark D. Corner,...
WISEC
2010
ACM
15 years 8 months ago
Effectiveness of distance-decreasing attacks against impulse radio ranging
We expose the vulnerability of an emerging wireless ranging technology, impulse radio ultra-wide band (IR-UWB), to distance-decreasing attacks on the physical communication layer ...
Manuel Flury, Marcin Poturalski, Panos Papadimitra...
CRYPTO
2009
Springer
122views Cryptology» more  CRYPTO 2009»
15 years 8 months ago
Utility Dependence in Correct and Fair Rational Secret Sharing
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
Gilad Asharov, Yehuda Lindell
FOCS
2007
IEEE
15 years 7 months ago
Cryptography from Sunspots: How to Use an Imperfect Reference String
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
Ran Canetti, Rafael Pass, Abhi Shelat