{"title":"使用代数签名进行远程数据占有检查","authors":"Lanxiang Chen","doi":"10.1109/CyberC.2011.56","DOIUrl":null,"url":null,"abstract":"Outsourcing storage enables users to access their data anywhere and at any time. It also can comply with a growing number of regulations. However, because of security and reliability, outsourcing storage is not widely adopted. When users store their data in outsourced storage server, they mostly concern about whether the data is intact. This is the goal of remote data possession checking (RDPC) schemes. This paper proposes an algebraic signature based RDPC scheme. Algebraic signature can improve efficiency and the running of algebraic signature can achieve tens to hundreds of megabytes per second. It allows verification without the need for the challenger to compare against the original data. The challenge/response protocol transmits a small, constant amount of data. The user needs to store only two secret keys and several random numbers. The algebraic property of algebraic signatures makes it possible to propose an efficient challenge updating method. Finally, experiment results reveal that the performance is bounded by disk I/O and not by algebraic signature and cryptographic computation.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Using Algebraic Signatures for Remote Data Possession Checking\",\"authors\":\"Lanxiang Chen\",\"doi\":\"10.1109/CyberC.2011.56\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Outsourcing storage enables users to access their data anywhere and at any time. It also can comply with a growing number of regulations. However, because of security and reliability, outsourcing storage is not widely adopted. When users store their data in outsourced storage server, they mostly concern about whether the data is intact. This is the goal of remote data possession checking (RDPC) schemes. This paper proposes an algebraic signature based RDPC scheme. Algebraic signature can improve efficiency and the running of algebraic signature can achieve tens to hundreds of megabytes per second. It allows verification without the need for the challenger to compare against the original data. The challenge/response protocol transmits a small, constant amount of data. The user needs to store only two secret keys and several random numbers. The algebraic property of algebraic signatures makes it possible to propose an efficient challenge updating method. Finally, experiment results reveal that the performance is bounded by disk I/O and not by algebraic signature and cryptographic computation.\",\"PeriodicalId\":227472,\"journal\":{\"name\":\"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CyberC.2011.56\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberC.2011.56","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Using Algebraic Signatures for Remote Data Possession Checking
Outsourcing storage enables users to access their data anywhere and at any time. It also can comply with a growing number of regulations. However, because of security and reliability, outsourcing storage is not widely adopted. When users store their data in outsourced storage server, they mostly concern about whether the data is intact. This is the goal of remote data possession checking (RDPC) schemes. This paper proposes an algebraic signature based RDPC scheme. Algebraic signature can improve efficiency and the running of algebraic signature can achieve tens to hundreds of megabytes per second. It allows verification without the need for the challenger to compare against the original data. The challenge/response protocol transmits a small, constant amount of data. The user needs to store only two secret keys and several random numbers. The algebraic property of algebraic signatures makes it possible to propose an efficient challenge updating method. Finally, experiment results reveal that the performance is bounded by disk I/O and not by algebraic signature and cryptographic computation.