This paper proposes a new model for secure communication channels between two parties. The new model assumes that adversaries are storage space bounded, but not computationally bounded. At the initial phase of the secret communication, both parties exchange a large amount of random bits so that adversaries are not able to save them due to the storage space limitation. Each party only saves received data. At the second phase, each party regenerates the random bits, combines them with received data, and generates an encryption key iteratively with a one-way hash function. The key is then used to encrypt the future transmissions from one party to the other. After each transmission, the key is updated iteratively based on data received. Applications of the new model are also discussed.
Date of creation, presentation, or exhibit
Department, Program, or Center
Information Sciences and Technologies (GCCIS)
B. Yuan, "An Asymptotic Secrecy Model and Its Applications in Sensor Networks," Proceedings of the Second Upstate New York Workshop on Communications and Networking, 2005. Rochester, NY
RIT – Main Campus