Sciweavers

112 search results - page 3 / 23
» Perfect Secrecy in Wireless Networks
Sort
View
ICASSP
2011
IEEE
12 years 10 months ago
A knapsack problem formulation for relay selection in secure cooperative wireless communication
—Cooperative jamming (CJ) schemes support secure wireless communication in the presence of one or more eavesdroppers. Larger numbers of cooperative relays provide better secrecy ...
Shuangyu Luo, Hana Godrich, Athina P. Petropulu, H...
EJWCN
2011
119views more  EJWCN 2011»
13 years 2 months ago
Broadcast Secrecy via Key-Chain-Based Encryption in Single-Hop Wireless Sensor Networks
Vijay Sivaraman, Diethelm Ostry, Jaleel Shaheen, A...
PIMRC
2010
IEEE
13 years 5 months ago
A secrecy game with an informed jammer relay
A four terminal Gaussian network composed of a source, a destination, an eavesdropper and a jammer relay is investigated when the jammer relay is causally given the source message....
Melda Yuksel, Xi Liu, Elza Erkip
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 10 months ago
Percolation in the Secrecy Graph
— Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely ...
Amites Sarkar, Martin Haenggi
FSTTCS
2003
Springer
14 years 8 days 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