{"_id":"QSRkg3xpniperJTkr","bibbaseid":"tedesco-sands-ausermodelforinformationerasure-2009","downloads":0,"creationDate":"2017-02-03T08:24:26.801Z","title":"A User Model for Information Erasure","author_short":["Tedesco, F. D.","Sands, D."],"year":2009,"bibtype":"inproceedings","biburl":"http://www.cse.chalmers.se/~dave/davewww2016.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Filippo","Del"],"propositions":[],"lastnames":["Tedesco"],"suffixes":[]},{"firstnames":["David"],"propositions":[],"lastnames":["Sands"],"suffixes":[]}],"title":"A User Model for Information Erasure","optcrossref":"","optkey":"","booktitle":"SecCo'09, 7th International Workshop on Security Issues in Concurrency","optpages":"","year":"2009","opteditor":"","optvolume":"","optnumber":"","series":"Electronic Proceedings in Theoretical Computer Science","optaddress":"","optmonth":"","optorganization":"","optpublisher":"","note":"To appear","abstract":"Hunt and Sands (ESOP'08) studied a notion of \\emphinformation erasure for systems which receive secrets intended for limited-time use. Erasure demands that once a secret has fulfilled its purpose the subsequent behaviour of the system should reveal no information about the erased data. In this paper we address a shortcoming in that work: for erasure to be possible the user who provides data must also play his part, but previously that role was only specified informally. Here we provide a formal model of the user and a collection of requirements called \\empherasure friendliness. We prove that an erasure-friendly user can be composed with an erasing system (in the sense of Hunt and Sands) to obtain a combined system which is \\emphjointly erasing in an appropriate sense. In doing so we identify stronger requirements on the user than those informally described in the previous work. ","url_paper":"http://www.cse.chalmers.se/~dave/papers/DelTedescoSandsSecCo09.pdf","bibtex":"@InProceedings{DelTedesco:Sands:Secco09,\n author = \t {Filippo Del Tedesco and David Sands},\n title = \t {A User Model for Information Erasure},\n OPTcrossref = {},\n OPTkey = \t {},\n booktitle = {SecCo'09, 7th International Workshop on Security Issues in Concurrency},\n OPTpages = \t {},\n year = \t {2009},\n OPTeditor = \t {},\n OPTvolume = \t {},\n OPTnumber = \t {},\n series = \t {Electronic Proceedings in Theoretical Computer Science},\n OPTaddress = \t {},\n OPTmonth = \t {},\n OPTorganization = {},\n OPTpublisher = {},\n note = \t {To appear},\n abstract = \t { Hunt and Sands (ESOP'08) studied a notion of \\emph{information\n erasure} for systems which receive secrets intended for\n limited-time use. Erasure demands that once a secret has fulfilled\n its purpose the subsequent behaviour of the system should reveal\n no information about the erased data. In this paper we address a\n shortcoming in that work: for erasure to be possible the user who\n provides data must also play his part, but previously that role was\n only specified informally. Here we provide a formal model of the\n user and a collection of requirements called \\emph{erasure\n friendliness}. We prove that an erasure-friendly user can be\n composed with an erasing system (in the sense of Hunt and Sands) to\n obtain a combined system which is \\emph{jointly erasing} in an\n appropriate sense. In doing so we identify stronger requirements on the user than those informally described in the previous work. },\nurl_Paper = \t {http://www.cse.chalmers.se/~dave/papers/DelTedescoSandsSecCo09.pdf}}\n","author_short":["Tedesco, F. D.","Sands, D."],"key":"DelTedesco:Sands:Secco09","id":"DelTedesco:Sands:Secco09","bibbaseid":"tedesco-sands-ausermodelforinformationerasure-2009","role":"author","urls":{" paper":"http://www.cse.chalmers.se/~dave/papers/DelTedescoSandsSecCo09.pdf"},"downloads":0},"search_terms":["user","model","information","erasure","tedesco","sands"],"keywords":[],"authorIDs":[],"dataSources":["SBHWXKotbthoEYKJv"]}