Sciweavers

118 search results - page 13 / 24
» Ideal Secret Sharing Schemes from Permutations
Sort
View
INFOCOM
2011
IEEE
12 years 12 months ago
Physical layer wireless security made fast and channel independent
Abstract – There is a growing interest in physical layer security. Recent work has demonstrated that wireless devices can generate a shared secret key by exploiting variations in...
Shyamnath Gollakota, Dina Katabi
MOBISYS
2005
ACM
14 years 8 months ago
Shake them up!: a movement-based pairing protocol for CPU-constrained devices
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...
Claude Castelluccia, Pars Mutaf
NETWORKING
2004
13 years 9 months ago
Efficient, Authenticated, and Fault-Tolerant Key Agreement for Dynamic Peer Groups
We present an efficient authenticated and fault-tolerant protocol (AFTD) for tree-based key agreement. Our approach is driven by the insight that when a Diffie-Hellman blinded key ...
Li Zhou, Chinya V. Ravishankar
IMA
1999
Springer
69views Cryptology» more  IMA 1999»
14 years 21 days ago
Some Applications of Bounds for Designs to the Cryptography
Recent years have seen numerous examples when designs play an important role in the study of such topics in cryptography as secrecy and authentication codes, secret sharing scheme...
Svetla Nikova, Ventzislav Nikov
TIFS
2010
184views more  TIFS 2010»
13 years 6 months ago
Information-theoretically secret key generation for fading wireless channels
—The multipath-rich wireless environment associated with typical wireless usage scenarios is characterized by a fading channel response that is time-varying, location-sensitive, ...
Chunxuan Ye, Suhas Mathur, Alex Reznik, Yogendra S...