TY - GEN

T1 - Information security for sensors by overwhelming random sequences and permutations

AU - Dolev, Shlomi

AU - Gilboa, Niv

AU - Kopeetsky, Marina

AU - Persiano, Giuseppe

AU - Spirakis, Paul G.

PY - 2010/12/16

Y1 - 2010/12/16

N2 - We propose efficient schemes for information-theoretically secure key exchange in the Bounded Storage Model (BSM), where the adversary is assumed to have limited storage. Our schemes generate a secret One Time Pad (OTP) shared by the sender and the receiver, from a large number of public random bits produced by the sender or by an external source. Our schemes initially generate a small number of shared secret bits, using known techniques. We introduce a new method to expand a small number of shared bits to a much longer, shared key. Our schemes are tailored to the requirements of sensor nodes and wireless networks. They are simple, efficient to implement and take advantage of the fact that practical wireless protocols transmit data in frames, unlike previous protocols, which assume access to specific bits in a stream of data. Indeed, our main contribution is twofold. On the one hand, we construct schemes that are attractive in terms of simplicity, computational complexity, number of bits read from the shared random source and expansion factor of the initial key to the final shared key. On the other hand, we show how to transformany existing scheme for key exchange in BSM into a more efficient scheme in the number of bits it reads from the shared source, given that the source is transmitted in frames.

AB - We propose efficient schemes for information-theoretically secure key exchange in the Bounded Storage Model (BSM), where the adversary is assumed to have limited storage. Our schemes generate a secret One Time Pad (OTP) shared by the sender and the receiver, from a large number of public random bits produced by the sender or by an external source. Our schemes initially generate a small number of shared secret bits, using known techniques. We introduce a new method to expand a small number of shared bits to a much longer, shared key. Our schemes are tailored to the requirements of sensor nodes and wireless networks. They are simple, efficient to implement and take advantage of the fact that practical wireless protocols transmit data in frames, unlike previous protocols, which assume access to specific bits in a stream of data. Indeed, our main contribution is twofold. On the one hand, we construct schemes that are attractive in terms of simplicity, computational complexity, number of bits read from the shared random source and expansion factor of the initial key to the final shared key. On the other hand, we show how to transformany existing scheme for key exchange in BSM into a more efficient scheme in the number of bits it reads from the shared source, given that the source is transmitted in frames.

KW - Bounded storage model

KW - Information theoretic security

KW - Wireless network

UR - http://www.scopus.com/inward/record.url?scp=78650008718&partnerID=8YFLogxK

U2 - 10.1145/1866307.1866392

DO - 10.1145/1866307.1866392

M3 - Conference contribution

AN - SCOPUS:78650008718

SN - 9781450302449

T3 - Proceedings of the ACM Conference on Computer and Communications Security

SP - 669

EP - 671

BT - CCS'10 - Proceedings of the 17th ACM Conference on Computer and Communications Security

T2 - 17th ACM Conference on Computer and Communications Security, CCS'10

Y2 - 4 October 2010 through 8 October 2010

ER -