Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/566726.566775acmconferencesArticle/Chapter ViewAbstractPublication PagesewConference Proceedingsconference-collections
Article
Free access

Caching trust rather than content

Published: 17 September 2000 Publication History
  • Get Citation Alerts
  • Abstract

    Caching, one of the oldest ideas in computer science, often improves performance and sometimes improves availability [1, 3]. Previous uses of caching have focused on data content. It is the presence of a local copy of data that reduces access latency and masks server or network failures. This position paper puts forth the idea that it can sometimes be useful to merely cache knowledge sufficient to recognize valid data. In other words, we do not have a local copy of a data item, but possess a substitute that allows us to verify the content of that item if it is offered to us by an untrusted source. We refer to this concept as caching trust.Mobile computing is a champion application domain for this concept. Wearable and handheld computers are constantly under pressure to be smaller and lighter. However, the potential volume of data that is accessible to such devices over a wireless network keeps growing. Something has to give. In this case, it is the assumption that all data of potential interest can be hoarded on the mobile client [1, 2, 6]. In other words, such clients have to be prepared to cope with cache misses during normal use. If they are able to cache trust, then any untrusted site in the fixed infrastructure can be used to stage data for servicing cache misses --- one does not have to go back to a distant server, nor does one have to compromise security. The following scenario explores this in more detail.

    References

    [1]
    Kistler, J. J., Satyanarayanan, M. Disconnected Operation in the Coda File System. ACM Transactions on Computer Systems 10(1), February, 1992.]]
    [2]
    Kuenning, G. H., Popek, G. J. Automated Hoarding for Mobile Computers. In Proceedings of the 16th ACM Symposium on Operating Systems Principles, pages 264-275. Saint-Malo, France, October, 1997.]]
    [3]
    Lampson, B. W. Hints for Computer System Design. In Proceedings of the 9th ACM Symposium on Operating System Principles. Bretton Woods, NH, October, 1983.]]
    [4]
    Lee, Y., Leung, K. S., Satyanarayanan, M. Operation-based Update Propagation in a Mobile File System. In Proceedings of the USENIX Annual Technical Conference. Monterey, CA, June, 1999.]]
    [5]
    Rivest, R. The MD5 Message-Digest Algorithm, Internet RFC 1321. Available from http://theory.lcs.mit.edu/~rivest/publications.html. 1992.]]
    [6]
    Tait, C. D., Lei, H., Acharya, S., Chang, H. Intelligent File Hoarding for Mobile Computers. In Proceedings of MobiCom'95: The First Annual International Conference on Mobile Computing and Networking, pages 119-125. Berkeley, CA, November, 1995.]]

    Cited By

    View all
    • (2001)Security Issues in M—Commerce: A Usage—Based TaxonomyE-Commerce Agents10.1007/3-540-45370-9_16(264-282)Online publication date: 25-Apr-2001

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    EW 9: Proceedings of the 9th workshop on ACM SIGOPS European workshop: beyond the PC: new challenges for the operating system
    September 2000
    249 pages
    ISBN:9781450373562
    DOI:10.1145/566726
    • General Chair:
    • Marc Shapiro
    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: 17 September 2000

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Conference

    EW00
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 37 of 37 submissions, 100%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)8
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 12 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2001)Security Issues in M—Commerce: A Usage—Based TaxonomyE-Commerce Agents10.1007/3-540-45370-9_16(264-282)Online publication date: 25-Apr-2001

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media