[1] |
BABCOCK C . 9 worst cloud security threats[N]. 2014. .
|
[2] |
ATENIESE G , BURNS R , CURTMOLA R ,et al. Provable data possession at untrusted stores[C]// ACM Conference on Computer and communications security. ACM, 2007: 598-609.
|
[3] |
JUELS A , KALISKI JR B S . Pors:proofs of retrievability for large files[C]// ACM Conference on Computer and Communications Security. ACM, 2007: 584-597.
|
[4] |
SHACHAM H , WATERS B . Compact proofs of retrievability[C]// International Conference on the Theory and Application of Cryptology and Information Security. Springer, 2008: 90-107.
|
[5] |
WANG Q , WANG C , REN K ,et al. Enabling public auditability and data dynamics for storage security in cloud computing[J]. IEEE Transactions on Parallel and Distributed Systems, 2011,22(5): 847-859.
|
[6] |
WANG C , CHOW S S M , WANG Q ,et al. Privacy-preserving public auditing for secure cloud storage[J]. IEEE Transactions on Computers, 2013,62(2): 362-375.
|
[7] |
XU Y , DING R , CUI J ,et al. Intrusion-resilient public auditing protocol for data storage in cloud computing[C]// Australasian Conference on Information Security and Privacy. Springer, 2018: 399-416.
|
[8] |
WANG H , WU Q , QIN B ,et al. Identity-based remote data possession checking in public clouds[J]. IET Information Security, 2014,8(2): 114-121.
|
[9] |
YU Y , ZHANG Y , MU Y ,et al. Provably secure identity based provable data possession[C]// International Conference on Provable Security. Springer, 2015: 310-325.
|
[10] |
TIAN M , YE S , ZHONG H ,et al. Identity-based proofs of storage with enhanced privacy[C]// International Conference on Algorithms and Architectures for Parallel Processing. Springer, 2018: 461-480.
|
[11] |
SHAMIR A , . Identity-based cryptosystems and signature schemes[C]// Annual International Cryptology Conference. Springer, 1984: 47-53.
|
[12] |
SHOR P W . Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J]. SIAM Journal on Computing, 1997,26(5): 1484-1509.
|
[13] |
REGEV O , . Lattice-based cryptography[C]// Annual International Cryptology Conference. Springer, 2006: 131-141.
|
[14] |
XU W , FENG D , LIU J . Public verifiable proof of storage protocol from lattice assumption[C]// International Conference on Intelligent Control,Automatic Detection and High-End Equipment. IEEE, 2012: 133-137.
|
[15] |
MICCIANCIO D , REGEV O . Worst-case to average-case reductions based on Gaussian measures[C]// Symposium on Foundations of Computer Science. IEEE, 2004: 372-381.
|
[16] |
LIU H , CAO W . Public proof of cloud storage from lattice assumption[J]. Chinese Journal of Electronics, 2014,23(1): 186-190.
|
[17] |
ZHANG X , XU C , ZHANG Y ,et al. Insecurity of a public proof of cloud storage from lattice assumption[J]. Chinese Journal of Electronics, 2017,26(1): 88-92.
|
[18] |
LIU Z , LIAO Y , YANG X ,et al. Identity-based remote data integrity checking of cloud storage from lattices[C]// International Conference on Big Data Computing and Communications. IEEE, 2017: >128-135.
|
[19] |
GORBUNOV S , VAIKUNTANATHAN V , WICHS D . Leveled fully homomorphic signatures from standard lattices[C]// Annual ACM Symposium on Theory of Computing. ACM, 2015: 469-477.
|
[20] |
MICCIANCIO D , PEIKERT C . Trapdoors for lattices:simpler,tighter,faster,smaller[C]// Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 2012: 700-718.
|
[21] |
DUCAS L , MICCIANCIO D . Improved short lattice signatures in the standard model[C]// Annual International Cryptology Conference. Springer, 2014: 335-352.
|
[22] |
LYUBASHEVSKY V , MICCIANCIO D . Generalized compact knapsacks are collision resistant[C]// International Colloquium on Automata,Languages,and Programming. Springer, 2006: 144-155.
|
[23] |
PEIKERT C , ROSEN A . Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices[C]// Theory of Cryptography Conference. Springer, 2006: 145-166.
|
[24] |
REGEV O . New lattice-based cryptographic constructions[J]. Journal of the ACM, 2004,51(6): 899-942.
|
[25] |
GENTRY C , PEIKERT C , VAIKUNTANATHAN V . Trapdoors for hard lattices and new cryptographic constructions[C]// Annual ACM Symposium on Theory of Computing. ACM, 2008: 197-206.
|
[26] |
AGUILAR-MELCHOR C , BARRIER J , GUELTON S ,et al. NFLlib:NTT-based fast lattice library[C]// Cryptographers’ Track at the RSA Conference. Springer, 2016: 341-356.
|
[27] |
GENISE N , MICCIANCIO D . Faster gaussian sampling for trapdoor lattices with arbitrary modulus[C]// Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 2018: 174-203.
|
[28] |
RUCKERT M , SCHNEIDER M . Estimating the Security of Lattice-based Cryptosystems[J].,2010,20101006:091355. IACR Cryptology ePrint Archive, 2010,20101006:091355.
|