homomorphic linear authentication schemes for proofs of retrievability
文献类型：会议论文
| 作者 | Liu Shengli ; Chen Kefei |
| 出版日期 | 2011 |
| 会议名称 | 3rd IEEE International Conference on Intelligent Networking and CollaborativeSystems, INCoS 2011 |
| 会议日期 | November 30, 2011 - December 2, 2011 |
| 会议地点 | Fukuoka, Japan |
| 关键词 | Electronic document identification systems Image quality |
| 页码 | 258-262 |
| 中文摘要 | 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. |
| 收录类别 | EI |
| 会议录 | Proceedings - 3rd IEEE International Conference on Intelligent Networking and Collaborative Systems, INCoS 2011
 |
| 语种 | 英语 |
| ISBN号 | 9780769545790 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16293]  |
| 专题 | 软件研究所_软件所图书馆_会议论文 |
| 推荐引用方式 GB/T 7714 | Liu Shengli,Chen Kefei. homomorphic linear authentication schemes for proofs of retrievability[C]. 见:3rd IEEE International Conference on Intelligent Networking and CollaborativeSystems, INCoS 2011. Fukuoka, Japan. November 30, 2011 - December 2, 2011. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。