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 with received data, and generates an encryption key iteratively with a one-way hash function. The key is, then, used to encrypt the first transmission from one party to the other. After each transmission, the key is updated iteratively based on data received. The relationships between the model and intelligent systems are discussed.
Date of creation, presentation, or exhibit
Department, Program, or Center
Department of Computing Security (GCCIS)
"An Asymptotic secrecy model and intelligent systems," Proceedings of the International Conference on Intelligent Systems and Knowledge Engineering. Held at Donghua University: Shanghai, China: 6-7 April 2006.
RIT – Main Campus