Citation: | ZHANG Xiaojun, XU Chunxiang, ZHANG Yuan, et al., “Insecurity of a Public Proof of Cloud Storage from Lattice Assumption,” Chinese Journal of Electronics, vol. 26, no. 1, pp. 88-92, 2017, doi: 10.1049/cje.2016.11.008 |
Q. Wang, C. Wang, K. Ren, W. Lou and J. Li, "Enabling public auditability and data dynamics for storage security in cloud computing", IEEE Transactions on Parallel and Distributed Systems, Vol.22, No.5, pp.847-859, 2011.
|
C. Wang, Q. Wang, K. Ren and W. Lou, "Towards secure and dependable storage services in cloud computing", IEEE Transactions on Service Computing, Vol.5, No.2, pp.220-232, 2012.
|
C. Wang, S.M. Chow, Q. Wang, K. Ren and W. Lou, "Privacypreserving public auditing for secure cloud storage", IEEE Transactions on Computers, Vol.62, No.2, pp.362-375, 2013.
|
K. Yang and X. Jia, "An efficient and secure dynamic auditing protocol for data storage in cloud computing", IEEE Transactions on Parallel and Distributed Systems, Vol.24, No.9, pp.1717-1726, 2013.
|
G.W. Solomon, C. Xu, J. Zhao and X. He, "Secure and efficient privacy-preserving public auditing scehme for cloud storage", Computers and Electrical Engineering, Vol.40, No.5, pp.1703-1713, 2014.
|
H. Wang, Q. Wu, B. Qin and J. Domingo-Ferrer, "Identitybased remote data possession checking in public clouds", IET Information Security, Vol.8, No.2, pp.114-121, 2014.
|
Z. Ren, L. Wang, Q. Wu and R. Deng, "Data dynamics enabled privacy-preserving public batch auditing in cloud storage", Chinese Journal of Electronics, Vol.23, pp.297-301, 2014.
|
D. Boneh and D.M. Freeman, "Linearly homomorphic signatures over binary fields and new tools for lattice-based signature", Proceeding of PKC 2011, LNCS, Springer-Verlag, Berlin, Vol.6571, pp.1-16, 2011.
|
F. Wang, Y. Hu and B. Wang, "Lattice-based linearly homomorphic signature scheme over binary field", Science China Information Sciences, Vol.55, pp.1-9, 2012.
|
H. Liu and W. Cao, "Public proof of cloud storage from lattice assumption", Chinese Journal of Electronics, Vol.23, No.1, pp.186-190, 2014.
|
V. Lyubashevsky and D. Micciancio, "Asymptotically efficient lattice-based digital signatures", Proceeding of the TCC, LNCS, Vol.4948, pp.37-54, Springer-Verlag, Berlin, 2008.
|
C. Gentry, C. Peikert and V. Vaikuntanathan, "Trapdoors for hard lattices and new cryptographic constructions", Proceeding of the 40th annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, pp.197-206, 2008.
|
O. Regev, "On lattices, learning with errors, random linear codes, and cryptography", H.N. Gabow and R. Fagin, (Ed.), STOC, ACM, pp.84-93, 2005.
|