Name
Abstract | ||
|---|---|---|
We develop a scheme for providing strong cryptographic authentication on a stream of messages which consumes very little bandwidth (as little as one bit per message) and is robust in the presence of dropped messages. Such a scheme should be useful for extremely low-power, low-bandwidth wireless sensor networks and "smart dust" applications. The tradeoffs among security, memory, bandwidth, and tolerance for missing messages give rise to several new optimization problems. We report on experimental results and derive bounds on the performance of the scheme. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-85912-3_21 | SETA |
Keywords | Field | DocType |
new optimization problem,smart dust,derive bound,distance-avoiding sequences,strong cryptographic authentication,missing message,sensor network,extremely low-bandwidth authentication,low-bandwidth wireless,wireless sensor network,memory bandwidth,optimization problem | Authentication,Message authentication code,Cryptography,Computer science,Computer network,Bandwidth (signal processing),Erasure code,Wireless sensor network,Optimization problem,Smart dust,Distributed computing | Conference |
Volume | ISSN | Citations |
5203 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael J. Collins | 1 | 163 | 24.59 |
| Scott Mitchell | 2 | 0 | 0.34 |