Daniel D. McCracken
Pages 587-588
This paper addresses the question: What does a person know following learning of BASIC programming? Several underlying conceptual structures are identified: (1) a transaction is an event that occurs in the computer and involves …
Richard E. Mayer
Pages 589-593
This paper describes the history of the design of the password security scheme on a remotely accessed time-sharing system. The present design was the result of countering observed attempts to penetrate the system. The result
…
Robert Morris, Ken Thompson
Pages 594-597
Substitution ciphers are codes in which each letter of the alphabet has one fixed substitute, and the word divisions do not change. In this paper the problem of breaking substitution ciphers is represented as a probabilistic
…
Shmuel Peleg, Azriel Rosenfeld
Pages 598-605
The problem of storing and searching large sparse tables is ubiquitous in computer science. The standard technique for storing such tables is hashing, but hashing has poor worst-case performance. We propose a good worst-case
n …
Robert Endre Tarjan, Andrew Chi-Chih Yao
Pages 606-611
In this paper we show how to divide data
D into
n pieces in such a way that
D is easily reconstructable from any
k pieces, but even complete knowledge of
k - 1 pieces reveals absolutely no information about
D. This technique
…
Adi Shamir
Pages 612-613
Robert L. Ashenhurst
Pages 621-630
