A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We put forth the question of whether cryptography is feasible using streaming devices. We give constructions and prove lower bounds. In streaming cryptography (not to be confused with streamciphers) everything-the keys, the messages, and the seeds-are huge compared to the internal memory of the device. These streaming algorithms have small internal memory size and make a constant number of passes over big data maintained in a constant number of read/write external tapes. Typically, the internaldoi:10.1007/978-3-662-44381-1_4 fatcat:gtjuz4j56zhhtc4ejhv5xzuqjq