Lakehead University Library Logo
    • Login
    View Item 
    •   Knowledge Commons
    • Electronic Theses and Dissertations
    • Retrospective theses
    • View Item
    •   Knowledge Commons
    • Electronic Theses and Dissertations
    • Retrospective theses
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.
    quick search

    Browse

    All of Knowledge CommonsCommunities & CollectionsBy Issue DateAuthorTitleSubjectDisciplineAdvisorCommittee MemberThis CollectionBy Issue DateAuthorTitleSubjectDisciplineAdvisorCommittee Member

    My Account

    Login

    Statistics

    View Usage Statistics

    Access control scheme for partially ordered set hierarchy with provable security

    Thumbnail

    View/Open

    WuJ2005m-1a.pdf (1.935Mb)

    Date

    2005

    Author

    Wu, Jiang

    Degree

    Master of Science

    Discipline

    Computer Science

    Subject

    Computers Access control
    Cryptography
    Data encryption (Computer science)

    Metadata

    Show full item record

    Abstract

    In many multi-user information systems, the users are organized as a hierarchy. Each user is a subordinate, superior and/or coordinate of some others. In such systems, a user has access to the information if and only if the information belongs to the user or his/her subordinates. Hierarchical access control schemes are designed to enforce such access policy. In the past years, hierarchical access control schemes based on cryptography are intensively researched. Much progress has been made in improving the schemes’ performance and security. The main contribution of this thesis is a new hierarchical access control scheme. This is the first one that provides strict security proof under a comprehensive security model that covers all possible cryptographic attacks to a hierarchical access control scheme. The scheme is designed and analyzed based on the modern cryptography approach, i.e., defining the security model, constructing the scheme based on cryptography primitives, and proving the security of the scheme by reducing the cryptography primitives to the scheme. Besides the security property, this scheme also achieves good performance in consuming small storage space, supporting arbitrary and dynamic hierarchial structures. In the thesis, we also introduce the background in cryptography and review the previous schemes.

    URI

    http://knowledgecommons.lakeheadu.ca/handle/2453/3314

    Collections

    • Retrospective theses

    Lakehead University Library
    Contact Us | Send Feedback

     


    Lakehead University Library
    Contact Us | Send Feedback