{"title":"Verification of the security of a secure network component","authors":"Edward A. Schneider","doi":"10.1109/CSAC.1991.213011","DOIUrl":"https://doi.org/10.1109/CSAC.1991.213011","url":null,"abstract":"The author formally proves using a mechanical verifier that a security multiplexer for a network is secure and has no timing channels. While this multiplexer is only a small piece of a system, it handles multiple security levels and contains a process and two procedures that interact with other parts of the system. Security is expressed using an information flow model, extended to handle time. He shows how the multiplexer is specified in this model, describes the synchronous deterministic security model used, and discuss the security proof.<<ETX>>","PeriodicalId":108621,"journal":{"name":"Proceedings Seventh Annual Computer Security Applications Conference","volume":"1984 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130371090","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":"An implementation of access control using a salient feature of primes","authors":"D. A. Moir","doi":"10.1109/CSAC.1991.213018","DOIUrl":"https://doi.org/10.1109/CSAC.1991.213018","url":null,"abstract":"A method of implementing access control for computer resources is presented, along with examples and possible enhancements. An appropriate application for such resource control can be found in computer operating systems. Thus, the need for resource control is described first, followed by descriptions of some common implementations and the impetus for their development. In light of this discussion, the alternative implementation proposed is presented, followed by a discussion of what improvements over the classical implementations are offered. This done, a series of possible extensions are presented.<<ETX>>","PeriodicalId":108621,"journal":{"name":"Proceedings Seventh Annual Computer Security Applications Conference","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131950371","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":"A distributed implementation of the extended schematic protection model","authors":"P. Ammann, R. Sandhu, Gurpreet S. Suri","doi":"10.1109/CSAC.1991.213009","DOIUrl":"https://doi.org/10.1109/CSAC.1991.213009","url":null,"abstract":"Protection models provide a formalism for specifying control over access to information and other resources in a multi-user computer system. One such model, the extended schematic protection model (ESPM) has expressive power equivalent to the monotonic access matrix model of Harrison, Ruzzo, and Ullman (1976). Yet ESPM retains tractable safety analysis for many cases of practical interest. Thus ESPM is a very general model, and it is of interest whether ESPM can be implemented in a reasonable manner. The authors outline a distributed implementation for ESPM. The implementation is capability-based, with an architecture where servers act as mediators to all subject and object access. Capabilities are made nontransferable by burying the identity of subjects in them, and unforgeable by using a public key encryption algorithm. Timestamps and public keys are used as mechanisms for revocation.<<ETX>>","PeriodicalId":108621,"journal":{"name":"Proceedings Seventh Annual Computer Security Applications Conference","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117308478","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":"Rebus passwords","authors":"Maria M. King","doi":"10.1109/CSAC.1991.213000","DOIUrl":"https://doi.org/10.1109/CSAC.1991.213000","url":null,"abstract":"The paper discusses a mechanism to aid users in the memorization of randomly generated nonsense passwords. The mechanism uses association and pictures and is based on techniques that have long been used as a means of memorizing information. The motivation for this work is the increased need to make passwords more difficult to guess and the necessity to keep them easy to remember. This mechanism makes an existing mechanism user-friendly, an area of computer security often ignored.<<ETX>>","PeriodicalId":108621,"journal":{"name":"Proceedings Seventh Annual Computer Security Applications Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121101685","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}