Emanuele Cesena, G. Ramunno, Roberto Sassu, Davide Vernizzi, A. Lioy
{"title":"论远程认证的可扩展性","authors":"Emanuele Cesena, G. Ramunno, Roberto Sassu, Davide Vernizzi, A. Lioy","doi":"10.1145/2046582.2046588","DOIUrl":null,"url":null,"abstract":"Among the problems of binary remote attestation, scalability has often been mentioned in literature because a verifier must know all possible measurements considered acceptable. In this paper, we show that scalability is a manageable issue when attesting a Linux distribution. The main issues remain identifying, with low time impact, the scripts executed, the configuration of components and other files types.","PeriodicalId":401412,"journal":{"name":"Scalable Trusted Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"On scalability of remote attestation\",\"authors\":\"Emanuele Cesena, G. Ramunno, Roberto Sassu, Davide Vernizzi, A. Lioy\",\"doi\":\"10.1145/2046582.2046588\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Among the problems of binary remote attestation, scalability has often been mentioned in literature because a verifier must know all possible measurements considered acceptable. In this paper, we show that scalability is a manageable issue when attesting a Linux distribution. The main issues remain identifying, with low time impact, the scripts executed, the configuration of components and other files types.\",\"PeriodicalId\":401412,\"journal\":{\"name\":\"Scalable Trusted Computing\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scalable Trusted Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2046582.2046588\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scalable Trusted Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2046582.2046588","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Among the problems of binary remote attestation, scalability has often been mentioned in literature because a verifier must know all possible measurements considered acceptable. In this paper, we show that scalability is a manageable issue when attesting a Linux distribution. The main issues remain identifying, with low time impact, the scripts executed, the configuration of components and other files types.