[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/1755688.1755730acmconferencesArticle/Chapter ViewAbstractPublication Pagesasia-ccsConference Proceedingsconference-collections
research-article

Oblivious enforcement of hidden information release policies

Published: 13 April 2010 Publication History

Abstract

In a computing system, sensitive data must be protected by release policies that determine which principals are authorized to access that data. In some cases, such a release policy could refer to information about the requesting principal that is unavailable to the information provider. Furthermore, the release policy itself may contain sensitive information about the resource that it protects. In this paper we describe a scheme for enforcing information release policies whose satisfaction cannot be verified by the entity holding the protected information, but only by the entity requesting this information. Not only does our scheme prevent the information provider from learning whether the policy was satisfied, but it also hides the information release policy being enforced from the requesting principal. Unlike previous approaches, our construction requires no guesswork or wasted computation on the part of the information requester. The information release policies that we consider can contain third-party assertions that themselves have release conditions that must be satisfied; we show that our system functions correctly even when these dependencies form cycles.

References

[1]
D. Boneh. The decision Diffie-Hellman problem. In Proceedings of the Third International Symposium on Algorithmic Number Theory, pages 48--63, 1998.
[2]
R. W. Bradshaw, J. E. Holt, and K. E. Seamons. Concealing complex policies with hidden credentials. In Proceedings of the 11th ACM Conference on Computer and Communications Security, pages 146--157, 2004.
[3]
M. Chase. Multi-authority attribute based encryption. In Proceedings of the Fourth Theory of Cryptography Conference, pages 515--534, 2007.
[4]
M. Chase and S. S. M. Chow. Improving privacy and security in multi-authority attribute-based encryption. In Proceedings of the 16th ACM Conference on Computer and Communications Security, pages 121--130, 2009.
[5]
T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469--472, 1985.
[6]
K. Frikken, M. Atallah, and J. Li. Attribute-based access control with hidden policies and hidden credentials. IEEE Transactions on Computers, 55(10):1259--1270, 2006.
[7]
J. E. Holt, R. W. Bradshaw, K. E. Seamons, and H. Orman. Hidden credentials. In Proceedings of the 2003 ACM Workshop on Privacy in the Electronic Society, pages 1--8, 2003.
[8]
A. J. Lee, K. Minami, and N. Borisov. Confidentiality-preserving distributed proofs of conjunctive queries. In Proceedings of the Fourth ACM Symposium on Information, Computer, and Communications Security, pages 287--297, 2009.
[9]
N. Li, W. Du, and D. Boneh. Oblivious signature-based envelope. Distributed Computing, 17(4):293--302, 2005.

Cited By

View all
  • (2011)Eyeing your exposureProceedings of the Seventh Symposium on Usable Privacy and Security10.1145/2078827.2078846(1-14)Online publication date: 20-Jul-2011
  • (2011)Improving Efficiency in Privacy-Preserving Automated Trust Negotiation with Conjunctive PoliciesProceedings of the 2011 14th International Conference on Network-Based Information Systems10.1109/NBiS.2011.114(679-684)Online publication date: 7-Sep-2011

Index Terms

  1. Oblivious enforcement of hidden information release policies

        Recommendations

        Comments

        Please enable JavaScript to view thecomments powered by Disqus.

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        ASIACCS '10: Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
        April 2010
        363 pages
        ISBN:9781605589367
        DOI:10.1145/1755688
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 13 April 2010

        Permissions

        Request permissions for this article.

        Check for updates

        Author Tags

        1. distributed proof
        2. hidden credentials
        3. hidden policies

        Qualifiers

        • Research-article

        Funding Sources

        Conference

        ASIA CCS '10
        Sponsor:

        Acceptance Rates

        ASIACCS '10 Paper Acceptance Rate 25 of 166 submissions, 15%;
        Overall Acceptance Rate 418 of 2,322 submissions, 18%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)1
        • Downloads (Last 6 weeks)1
        Reflects downloads up to 16 Dec 2024

        Other Metrics

        Citations

        Cited By

        View all
        • (2011)Eyeing your exposureProceedings of the Seventh Symposium on Usable Privacy and Security10.1145/2078827.2078846(1-14)Online publication date: 20-Jul-2011
        • (2011)Improving Efficiency in Privacy-Preserving Automated Trust Negotiation with Conjunctive PoliciesProceedings of the 2011 14th International Conference on Network-Based Information Systems10.1109/NBiS.2011.114(679-684)Online publication date: 7-Sep-2011

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media