@InProceedings{Agat:Sands:Confidentiality,
  author =       "J. Agat and David Sands",
  title =        "On Confidentiality and Algorithms",
  pages =        "64--77",
  editor =       "Francis M. Titsworth",
  booktitle =    "Proceedings of the 2001 {IEEE} Symposium on Security
                 and Privacy ({S}\&{P}-01)",
  month =        "May",
  publisher =    "IEEE Computer Society",
  abstract = {Recent interest in methods for certifying programs for secure
information flow (noninterference) 
have failed to raise a key question: can efficient algorithms
be written so as to satisfy the requirements of secure information flow? 
In this paper we discuss how algorithms for searching and sorting can be
adapted to work on collections of secret data without leaking any
confidential information, either directly, indirectly, 
or through timing behaviour.
We pay particular attention to the issue of timing channels caused by cache
behaviour, and argue that it is necessary to 
disable the effect of the cache in order to 
construct algorithms manipulating pointers to objects
in such a way that they satisfy the conditions of noninterference.
},
  url_Paper = {http://www.cse.chalmers.se/~dave/papers/agat-sands-SP01.pdf},
  year =         "2001"
}

{"_id":"WEvx3B7z3HXtdudxQ","bibbaseid":"agat-sands-onconfidentialityandalgorithms-2001","downloads":0,"creationDate":"2017-02-03T08:24:26.824Z","title":"On Confidentiality and Algorithms","author_short":["Agat, J.","Sands, D."],"year":2001,"bibtype":"inproceedings","biburl":"http://www.cse.chalmers.se/~dave/davewww2016.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["J."],"propositions":[],"lastnames":["Agat"],"suffixes":[]},{"firstnames":["David"],"propositions":[],"lastnames":["Sands"],"suffixes":[]}],"title":"On Confidentiality and Algorithms","pages":"64--77","editor":[{"firstnames":["Francis","M."],"propositions":[],"lastnames":["Titsworth"],"suffixes":[]}],"booktitle":"Proceedings of the 2001 IEEE Symposium on Security and Privacy (S&P-01)","month":"May","publisher":"IEEE Computer Society","abstract":"Recent interest in methods for certifying programs for secure information flow (noninterference) have failed to raise a key question: can efficient algorithms be written so as to satisfy the requirements of secure information flow? In this paper we discuss how algorithms for searching and sorting can be adapted to work on collections of secret data without leaking any confidential information, either directly, indirectly, or through timing behaviour. We pay particular attention to the issue of timing channels caused by cache behaviour, and argue that it is necessary to disable the effect of the cache in order to construct algorithms manipulating pointers to objects in such a way that they satisfy the conditions of noninterference. ","url_paper":"http://www.cse.chalmers.se/~dave/papers/agat-sands-SP01.pdf","year":"2001","bibtex":"@InProceedings{Agat:Sands:Confidentiality,\n author = \"J. Agat and David Sands\",\n title = \"On Confidentiality and Algorithms\",\n pages = \"64--77\",\n editor = \"Francis M. Titsworth\",\n booktitle = \"Proceedings of the 2001 {IEEE} Symposium on Security\n and Privacy ({S}\\&{P}-01)\",\n month = \"May\",\n publisher = \"IEEE Computer Society\",\n abstract = {Recent interest in methods for certifying programs for secure\ninformation flow (noninterference) \nhave failed to raise a key question: can efficient algorithms\nbe written so as to satisfy the requirements of secure information flow? \nIn this paper we discuss how algorithms for searching and sorting can be\nadapted to work on collections of secret data without leaking any\nconfidential information, either directly, indirectly, \nor through timing behaviour.\nWe pay particular attention to the issue of timing channels caused by cache\nbehaviour, and argue that it is necessary to \ndisable the effect of the cache in order to \nconstruct algorithms manipulating pointers to objects\nin such a way that they satisfy the conditions of noninterference.\n},\n url_Paper = {http://www.cse.chalmers.se/~dave/papers/agat-sands-SP01.pdf},\n year = \"2001\"\n}\n\n","author_short":["Agat, J.","Sands, D."],"editor_short":["Titsworth, F. M."],"key":"Agat:Sands:Confidentiality","id":"Agat:Sands:Confidentiality","bibbaseid":"agat-sands-onconfidentialityandalgorithms-2001","role":"author","urls":{" paper":"http://www.cse.chalmers.se/~dave/papers/agat-sands-SP01.pdf"},"downloads":0},"search_terms":["confidentiality","algorithms","agat","sands"],"keywords":[],"authorIDs":["58943e3a2f18920f4c000022"],"dataSources":["SBHWXKotbthoEYKJv"]}