1983 IEEE Symposium on Security and Privacy最新文献

{"title":"Program Chairman's Message","authors":"C. Bye","doi":"10.1109/PLANS.2004.1308962","DOIUrl":"https://doi.org/10.1109/PLANS.2004.1308962","url":null,"abstract":"This conference provides a unique opportunity for you to share your knowledge and to learn and grow. We have set up several social events intended, in part, to provide you with an opportunity to meet your technical peers from around the world. The PLANS symposium has a long history of attracting high quality technical papers and the PLANS 2004 program has carried on this tradition. The technical papers form the cornerstone of the symposium. Therefore, to provide much deserved recognition to the significant contributions of the authors, we have several awards for manuscripts. The awards arc the Walter Fried Award for best paper, best student paper, and best track paper. The four distinguished Track Chairs have assembled an excellent program with multiple tracks running simultaneously throughout the conference. The content of the program is diverse, including sensor technology, integrated navigation systems, satellite-based navigation, and advanced navigation. We have added several special features to this program including a workshop on MEMS, a plmcl discussion on GPS modernization, and a special session dedicated to research in academia. 1 want to thank the Track Chairs and Session Chairs for their hard work in developing this outstanding technical program.","PeriodicalId":236986,"journal":{"name":"1983 IEEE Symposium on Security and Privacy","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121584914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Recent Advances in the design and implementation of Large Integer Factorization Algorithms","authors":"M. Wunderlich","doi":"10.1109/SP.1983.10014","DOIUrl":"https://doi.org/10.1109/SP.1983.10014","url":null,"abstract":"The latest and possibly fastest of the general factoring methods for large composite numbers is the quadratic sieve of Carl Pomerance. A variation of the algorithm is described and an implementation is suggested which combines the forces of a fast pipeline computer such as the Cray I, and a high speed highly parallel array processor such as the Goodyear MPP. A running time analysis, which is based on empirical data rather than asymptotic estimates, suggests that this method could be capable of factoring a 60 digit number in as little as 10 minutes and a 100 digit number is as little as 60 days of continuous computer time.","PeriodicalId":236986,"journal":{"name":"1983 IEEE Symposium on Security and Privacy","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114407051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Evaluating Security Properties of Computer Systems","authors":"R. Schell","doi":"10.1109/SP.1983.10013","DOIUrl":"https://doi.org/10.1109/SP.1983.10013","url":null,"abstract":"The Department of Defense has recently published Trusted Computer System Evaluation Criteria that provide the basis for evaluating the effectiveness of security controls built into computer systems. This paper summarizes basic security requirements and the technical criteria that are used to classify systems into eight hierarchical classes of enhanced security protection. These criteria are used in specifying security requirements during acquisition, guiding the design and development of trusted systems and evaluating systems used to process sensitive information.","PeriodicalId":236986,"journal":{"name":"1983 IEEE Symposium on Security and Privacy","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131387881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Message Authentication with Manipulation Detection Code","authors":"R. R. Jueneman, S. Matyas, C. H. Meyer","doi":"10.1109/SP.1983.10005","DOIUrl":"https://doi.org/10.1109/SP.1983.10005","url":null,"abstract":"In many applications of cryptography, assuring the authenticity of communications is as important as protecting their secrecy. A well known and secure method of providing message authentication is to compute a Message Authentication Code (MAC) by encrypting the message. If only one key is used to both encrypt and authenticate a message, however, the system is subject to several forms of cryptographic attack. Techniques have also been sought for combining secrecy and authentication in only one encryption pass, using a Manipulation Detection Code generated by noncryptographic means. Previous investigations have shown that a proposed MDC technique involving block-by-block Exclusive-ORing is not secure when used with the Cipher Block Chaining (CBC) mode of operation of the Data Encryption Standard (DES]. It is shown here that the Cipher Feedback (CFEI) mode of operation exhibits similar weaknesses. A linear addition modulo 264 MDC is analyzed, including discussion of several novel attack scenarios. A Quadratic Congruential Manipulation Detection Code is proposed to avoid the problems of previous schemes.","PeriodicalId":236986,"journal":{"name":"1983 IEEE Symposium on Security and Privacy","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131865971","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"SDC Secure Release Terminal Project","authors":"T. Hinke, Jose Althouse, R. Kemmerer","doi":"10.1109/SP.1983.10011","DOIUrl":"https://doi.org/10.1109/SP.1983.10011","url":null,"abstract":"The SDC Secure Release Terminal SRT) project provides a useful view of the process involved in constructing software whose code is intended to be formally verified to satisfy desired security properties. The purpose of the SRT is to move appropriately classified data from a processing environment at one security level to a processing environment at another level in machine readable form. This paper discusses the design process for the SRT which was carried out using the SDC Formal Development Methodology (FDM). the SRT project is the first application of the FDM code level verification capabilities. However, since the code level verification has not yet been performed this paper concentrates on the design problems inherent in targeting a system for code level verification.","PeriodicalId":236986,"journal":{"name":"1983 IEEE Symposium on Security and Privacy","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132628180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"New Key Generation Algorithms for Multilevel Security","authors":"Stephen J. MacKinnon, S. Akl","doi":"10.1109/SP.1983.10012","DOIUrl":"https://doi.org/10.1109/SP.1983.10012","url":null,"abstract":"This paper addresses one aspect of the problem of access control in a hierarchy. A general scheme is described which allows a user to generate from his own key the keys of users below him in the hierarchy. Two implementations of this scheme are then proposed and compared in terms of security and efficiency to an existing one.","PeriodicalId":236986,"journal":{"name":"1983 IEEE Symposium on Security and Privacy","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133915069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Securing Networks: End-to-End Encrpytion vs. Link Encryption and Trusted Systems","authors":"W. Diffie","doi":"10.1109/SP.1983.10021","DOIUrl":"https://doi.org/10.1109/SP.1983.10021","url":null,"abstract":"Today, two components are prominent in the technology of communication network security: cryptography and trusted systems. Reflection on the roles of these two components shows that both are essential, that some element of each must occur in any secure network. At the same time, there is an element of competition and some network designs treat encryption as primary, supported by only the minimum of trusted software, while others take the opposite course. At one extreme, a network can employ end-to-end encryption as its primary security mechanism. In such a network, two users in secure contact rely on their exclusive possession of a common key to guarantee that their messages cannot be understood or imitated by others, regardless of whether intervening components of the network perform correctly or not. Here, trusted systems are limited to the role in which they cannot be avoided: decisions on how keys are to be distributed. At the other extreme, a network can employ cryptography only to create the appearance of overall physical security. Link encryption is used to protect the exposed communication paths and for no other purpose. The problem is reduced to that of designing a multi-level secure operating system; the fact that it may span continents is concealed. In arguing for the cryptographic approach, one could point out that trusted system technology is new and its products are prone to the performance and cost problems common with new technologies. They would say that cryptography, by comparison, is a well developed art. The trusted system people, on the other hand, would assert that cryptography is inflexible and cannot adequately support the complex security policies required. Despite the value of many of these implementation arguments, the actual distinction lies more in the network builders notions of trust and authority. The user of a system that relies primarily on trusted system technology may be extremely well protected from opponents outside the network, but can have no true security from the network builders and administrators. This sense of security is perhaps best suited to users who are employees and act within a hierarchical authority structure. The user of an end-to-end encrypted network on the other hand can be very certain that his traffic is protected from everyone except the person he is conversing with. This situation is more closely aligned with our notions of a user who is part of a voluntary association. 136 CH18S2-O/83/0000/0136$01 .00@ 1983 IEEE","PeriodicalId":236986,"journal":{"name":"1983 IEEE Symposium on Security and Privacy","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115636528","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The Channel Assignment Problem","authors":"B. Fam, J. Millen","doi":"10.1109/SP.1983.10015","DOIUrl":"https://doi.org/10.1109/SP.1983.10015","url":null,"abstract":"An optimization problem exists in the context of local area network security. The network provides a number of physical or logical \"channels\", each carrying a set of levels or compartments of information. A channel is accessible to users cleared for all the levels it carries. The problem is to assign the set of levels to be carried by each channel so as to minimize the total number of channels, under the constraint that each pair of users with a level in common can communicate over some channel. This problem was found to be equivalent to a known NP-complete problem, the set basis problem.The main result is an approximate algorithm that runs in polynomial time and finds one solution. It has succeeded in finding an optimal solution in all of the test cases small enough to confirm the optimality independently.","PeriodicalId":236986,"journal":{"name":"1983 IEEE Symposium on Security and Privacy","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124687048","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Modified Architecture for the Sub-Keys Model","authors":"K. A. Omar, D. L. Wells","doi":"10.1109/SP.1983.10008","DOIUrl":"https://doi.org/10.1109/SP.1983.10008","url":null,"abstract":"A secure implementation for subkey database encryption is presented. Both Vertical and Horizontal access to the control encrypted date are defined and described. Communication protocols between user and system are also provided.","PeriodicalId":236986,"journal":{"name":"1983 IEEE Symposium on Security and Privacy","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124804733","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Joint Encryption and Error-Correction Coding","authors":"S. Kak","doi":"10.1109/SP.1983.10017","DOIUrl":"https://doi.org/10.1109/SP.1983.10017","url":null,"abstract":"This paper considers the problem of joint encryption and error-correction coding and proposes a solution using D-sequences, which are œdecimal' expansions of fractions. The encryption operation considered is equivalent to exponentiation which forms the basis of several public-key schemes. Several new results on D-sequences are also presented which make the applications to encryption and error coding possible.","PeriodicalId":236986,"journal":{"name":"1983 IEEE Symposium on Security and Privacy","volume":"40 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1983-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122500744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}