TY - GEN
T1 - Efficient public integrity checking for cloud data sharing with multi-user modification
AU - Yuan, Jiawei
AU - Yu, Shucheng
PY - 2014
Y1 - 2014
N2 - In past years a body of data integrity checking techniques have been proposed for securing cloud data services. Most of these works assume that only the data owner can modify cloud-stored data. Recently a few attempts started considering more realistic scenarios by allowing multiple cloud users to modify data with integrity assurance. However, these attempts are still far from practical due to the tremendous computational cost on cloud users. Moreover, collusion between misbehaving cloud servers and revoked users is not considered. This paper proposes a novel data integrity checking scheme characterized by multi-user modification, collusion resistance and a constant computational cost of integrity checking for cloud users, thanks to our novel design of polynomial-based authentication tags and proxy tag update techniques. Our scheme also supports public checking and efficient user revocation and is provably secure. Numerical analysis and extensive experimental results show the efficiency and scalability of our proposed scheme.
AB - In past years a body of data integrity checking techniques have been proposed for securing cloud data services. Most of these works assume that only the data owner can modify cloud-stored data. Recently a few attempts started considering more realistic scenarios by allowing multiple cloud users to modify data with integrity assurance. However, these attempts are still far from practical due to the tremendous computational cost on cloud users. Moreover, collusion between misbehaving cloud servers and revoked users is not considered. This paper proposes a novel data integrity checking scheme characterized by multi-user modification, collusion resistance and a constant computational cost of integrity checking for cloud users, thanks to our novel design of polynomial-based authentication tags and proxy tag update techniques. Our scheme also supports public checking and efficient user revocation and is provably secure. Numerical analysis and extensive experimental results show the efficiency and scalability of our proposed scheme.
UR - http://www.scopus.com/inward/record.url?scp=84904430603&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84904430603&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2014.6848154
DO - 10.1109/INFOCOM.2014.6848154
M3 - Conference contribution
AN - SCOPUS:84904430603
SN - 9781479933600
T3 - Proceedings - IEEE INFOCOM
SP - 2121
EP - 2129
BT - IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
T2 - 33rd IEEE Conference on Computer Communications, IEEE INFOCOM 2014
Y2 - 27 April 2014 through 2 May 2014
ER -