Information privacy deals with protecting individuals against potential violations of their rights due to collection, storage, and use of personal information by the government and private sector organizations. The privacy protection laws enacted in the 1970s are inadequate and limited in scope. New applications of computer-communications technology involving personal information are now emerging for the decade of the 1990s and create new potentials for privacy violations. The basics of privacy protection, examples of the new technologies, and the need for new privacy laws are discussed.>

Privacy is a term with multiple meanings. However, in the context of automated record-keeping systems which contain personal data about individuals, "privacy" refers to the rights of individuals regarding the collection, storage, processing, circulation, and use of personal information about themselves (1-4). Synonymous terms in use are "fair information practices" and, in many countries abroad, "data protection" (5,6). Privacy protection is achieved when privacy rights are granted to individuals by legislative means or voluntarily by record- keeping organizations, and their enforcement is implemented by procedural and technical means

Included in the scope of the term "transborder data flows is the transmission over computer-communicational systems of automated data to be processed and stored in foreign data processing systems. A number of issues, including privacy protection and data security, arise in various transborder data flow (TDF) situations and are discussed in this paper, especially the potential effects on TDF of national privacy protection laws and pending international agreements. Sets of associated technical requirements are examined.

Laws now in effect in the United States grant certain privacy rights to individual citizens vis-a-vis federal agencies, state government agencies in several states, and certain organizations in the private sector that maintain personal information on them in automated record-keeping systems. Pending are bills to extend privacy protection to the entire private sector. Implementation of privacy protection requirements involves numerous technical considerations that are discussed in this paper. Unless these technical aspects and their limitations are taken into account when the privacy protection requirements are legislated, implementation of the requirements may turn out to be technically infeasible or economically unacceptable and, correspondingly, protection provided may be largely illusory.

A law now in effect in the United States requires protection of individual privacy in computerized personal information record-keeping systems maintained by the federal government. Similar laws apply in certain state and local governments. Legislation has also been introduced to extend the requirements for privacy protection to the private sphere. Central in privacy protection are the rights of an individual to know what data are maintained on him, challenge their veracity and relevance, limit their nonroutine use or dissemination, and be assured that their quality, integrity, and confidentiality are maintained. In all computer systems that maintain and process valuable information, or provide services to multiple users concurrently, it is necessary to provide security safeguards against unauthorized access, use, or modifications of any data file. This difficult problem has not yet been solved in the general case. Computer systems must also be protected against unauthorized use, disruption of operations, and physical damage. The growing number of computer applications involving valuable information or assets plus the growing number of criminal actions directed against computer applications and systems or perpetrated by using computers underscore the need for finding effective solutions to the computer security problem. In the future, concerns for privacy and security must become integral in the planning and design of computer systems and their applications.

article Free AccessA Generalization of Shift-Register Sequence Generators Authors: I. S. Reed The Rand Corporation, Santa Monica, California The Rand Corporation, Santa Monica, CaliforniaView Profile , Rein Turn The Rand Corporation, Santa Monica, California The Rand Corporation, Santa Monica, CaliforniaView Profile Authors Info & Claims Journal of the ACMVolume 16Issue 3July 1969 pp 461–473https://doi.org/10.1145/321526.321535Published:01 July 1969Publication History 3citation460DownloadsMetricsTotal Citations3Total Downloads460Last 12 Months7Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Pragmatic problem studies predict gains in computation speeds in a variety of computational tasks when executed on appropriate problem-oriented configurations of the variable structure computer. The economic feasibility of the system is based on utilization of essentially the same hardware in a variety of special purpose structures. This capability is achieved by programmed or physical restructuring of a part of the hardware. Existence of important classes of problems which the variable structure computer system promises to render practically computable, as well as use of the system for experiments in computer organization and for evaluation of new circuits and devices warrant construction of a variable structure computer. This paper describes the organization, programming, and hardware of a variable structure computer system presently under construction at UCLA.

The problem of optimal assignment of subcomputations of a computational task to autonomous computing structures of a variable structure computing system is investigated. In particular, it is desired to determine which computing structures should be constructed from the hardware inventory of the variable structure computing system and which subcomputations should be executed on which computing structures, and in what sequence, so as to minimize the total cost of computation (cost of restructuring of the system and the cost of the actual execution time). A successive approximation assigmnent procedure is formulated. The procedure requires representation of the computational task by a directed graph and an estimate of the number of traversals of each computational loop, as well as the branching probabilities of each conditional branching operation. Computer programs for automatic execution of the assignment procedure have been written. A numerical experiment on a problem from the area of the x-ray diffraction analysis of crystal structures indicates that the procedure is computationally practical, and also demonstrates that execution of the problem in a variable structure system leads to a considerable gain over a system of three modern high-speed general purpose computers.

Sequential table look-up algorithms are proposed for the evaluation of ln x and exp x. Tables of pre-computed constants are utilized in transforming the argument into a range where the function may be approximated by a simpler polynomial. In the case of ln x, x is transformed so that it falls into a close neighborhood of 1; in the case of exp x, x is transformed to a close neighborhood of 0. These algorithms are particularly effective when mechanized so as to carry out the predetermined sequence of operations without waste manipulation. Such special purpose organization is reasonable within the variable structure part of UCLA's proposed Fixed-Plus-Variable structure computer, as the same equipment may be reorganized for use in other special purpose configurations at other times. In this paper the sequential table look-up algorithms and their speed advantages over existing subroutine approximation procedures are described. The design of special purpose configurations which leads to another factor of speed increase as compared to a stored program implementation of the algorithms is presented. The properties of the supervisory control which integrate the operation of the ``fixed structure'' general purpose computer and the ``variable structure'' special purpose configurations are specified and the over-all computational gains evaluated. An order-of-magnitude increase in speed compared to existing subroutines is predicted in both cases.