Sciweavers

448 search results - page 23 / 90
» k-anonymous message transmission
Sort
View
CRYPTO
1999
Springer
109views Cryptology» more  CRYPTO 1999»
14 years 2 months ago
Coding Constructions for Blacklisting Problems without Computational Assumptions
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
ISPAN
2009
IEEE
14 years 4 months ago
Chaining Clock Synchronization: An Energy-Efficient Clock Synchronization Scheme for Wireless Sensor Networks
— Since WSNs have restricted energy sources, the energy efficiency of a synchronization scheme is as important as the accuracy of a clock. To accomplish both the energy efficienc...
Sang Hoon Lee, Lynn Choi
COMPSEC
2008
138views more  COMPSEC 2008»
13 years 10 months ago
SMSSec: An end-to-end protocol for secure SMS
Short Message Service is usually used to transport unclassified information, but with the rise of mobile commerce it has become an integral tool for conducting business. However S...
Johnny Li-Chang Lo, Judith Bishop, Jan H. P. Eloff
TIT
2010
99views Education» more  TIT 2010»
13 years 4 months ago
Capacity of Channels With Action-Dependent States
We consider channels with action-dependent states: Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the channel state...
Tsachy Weissman
CORR
2011
Springer
231views Education» more  CORR 2011»
13 years 1 months ago
Capacity of Discrete Molecular Diffusion Channels
Abstract—In diffusion-based molecular communications, messages can be conveyed via the variation in the concentration of molecules in the medium. In this paper, we intend to anal...
Arash Einolghozati, Mohsen Sardari, Ahmad Beirami,...