Homomorphic Linear Authentication Schemes from (\$textbackslashepsilon\$)-Authentication Codes
| Title | Homomorphic Linear Authentication Schemes from (\$textbackslashepsilon\$)-Authentication Codes |
| Publication Type | Conference Paper |
| Year of Publication | 2016 |
| Authors | Han, Shuai, Liu, Shengli, Zhang, Fangguo, Chen, Kefei |
| Conference Name | Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security |
| Publisher | ACM |
| Conference Location | New York, NY, USA |
| ISBN Number | 978-1-4503-4233-9 |
| Keywords | authentication code, coding theory, composability, homomorphic linear authentication scheme, Metrics, proofs of data possession, proofs of retrievability, pubcrawl, Resiliency, security |
| Abstract | Proofs of Data Possession/Retrievability (PoDP/PoR) schemes are essential to cloud storage services, since they can increase clients' confidence on the integrity and availability of their data. The majority of PoDP/PoR schemes are constructed from homomorphic linear authentication (HLA) schemes, which decrease the price of communication between the client and the server. In this paper, a new subclass of authentication codes, named e-authentication codes, is proposed, and a modular construction of HLA schemes from e-authentication codes is presented. We prove that the security notions of HLA schemes are closely related to the size of the authenticator/tag space and the successful probability of impersonation attacks (with non-zero source states) of the underlying e-authentication codes. We show that most of HLA schemes used for the PoDP/PoR schemes are instantiations of our modular construction from some e-authentication codes. Following this line, an algebraic-curves-based e-authentication code yields a new HLA scheme. |
| URL | http://doi.acm.org/10.1145/2897845.2897859 |
| DOI | 10.1145/2897845.2897859 |
| Citation Key | han_homomorphic_2016 |