Institutional Repository
| homomorphic linear authentication schemes for proofs of retrievability | |
| Liu Shengli; Chen Kefei | |
| 2011 | |
| Conference Name | 3rd IEEE International Conference on Intelligent Networking and CollaborativeSystems, INCoS 2011 |
| Source | Proceedings - 3rd IEEE International Conference on Intelligent Networking and Collaborative Systems, INCoS 2011 |
| Pages | 258-262 |
| Conference Date | November 30, 2011 - December 2, 2011 |
| Conference Place | Fukuoka, Japan |
| Indexed Type | EI |
| ISBN | 9780769545790 |
| Department | (1) Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China; (2) State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China |
| English Abstract | In a proof of retrievability (POR) system, interactive POR protocols are executed between a storage server and clients, so that clients can be convinced that their data is available at the storage server, ready to be retrieved when needed. In an interactive POR protocol, clients initiate challenges to the server, and the server feedbacks responses to clients with input of the stored data. Retrievability means that it should be possible for a client to extract the his/her data from the server's valid responses. An essential stepstone leading to retrievability is server's unforgeability of valid responses, i.e, any server coming up valid responses to a client's challenges is actually storing the client's data with overwhelming probability. Unforgeability can be achieved with authentication schemes like MAC, Digital Signature, etc. With homomorphic linear authentication schemes, the authenticators can be aggregated into one tag for the challenges, hence reducing the communication complexity. In this paper, we explore some new homomorphic linear authenticator schemes in POR to provide unforgeability. Compared with the recent work of Shacham and Waters, our scheme enjoys the same shortest responses, but reduces the local storage from O(s) to O(1). © 2011 IEEE.; In a proof of retrievability (POR) system, interactive POR protocols are executed between a storage server and clients, so that clients can be convinced that their data is available at the storage server, ready to be retrieved when needed. In an interactive POR protocol, clients initiate challenges to the server, and the server feedbacks responses to clients with input of the stored data. Retrievability means that it should be possible for a client to extract the his/her data from the server's valid responses. An essential stepstone leading to retrievability is server's unforgeability of valid responses, i.e, any server coming up valid responses to a client's challenges is actually storing the client's data with overwhelming probability. Unforgeability can be achieved with authentication schemes like MAC, Digital Signature, etc. With homomorphic linear authentication schemes, the authenticators can be aggregated into one tag for the challenges, hence reducing the communication complexity. In this paper, we explore some new homomorphic linear authenticator schemes in POR to provide unforgeability. Compared with the recent work of Shacham and Waters, our scheme enjoys the same shortest responses, but reduces the local storage from O(s) to O(1). © 2011 IEEE. |
| Keyword | Electronic Document Identification Systems Image Quality |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16293 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Liu Shengli,Chen Kefei. homomorphic linear authentication schemes for proofs of retrievability[C],2011:258-262. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment