Efficient Identity-Based Public Auditing Scheme for Cloud Storage from Lattice Assumption
暂无分享,去创建一个
[1] Dan Boneh,et al. Efficient Lattice (H)IBE in the Standard Model , 2010, EUROCRYPT.
[2] Xiaojun Zhang,et al. Efficient fully homomorphic encryption from RLWE with an extension to a threshold encryption scheme , 2014, Future Gener. Comput. Syst..
[3] Hovav Shacham,et al. Compact Proofs of Retrievability , 2008, Journal of Cryptology.
[4] Reza Curtmola,et al. Provable data possession at untrusted stores , 2007, CCS '07.
[5] Yupu Hu,et al. Lattice-based linearly homomorphic signature scheme over binary field , 2012, Science China Information Sciences.
[6] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[7] Ari Juels,et al. Pors: proofs of retrievability for large files , 2007, CCS '07.
[8] Dan Boneh,et al. Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures , 2011, Public Key Cryptography.
[9] Vinod Vaikuntanathan,et al. Efficient Fully Homomorphic Encryption from (Standard) LWE , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[10] Chao-Yang Lee,et al. A multi-path QoS multicast routing protocol with slot assignment for mobile ad hoc networks , 2012, Inf. Sci..
[11] Dan Boneh,et al. Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE , 2010, CRYPTO.
[12] Xiaohua Jia,et al. An Efficient and Secure Dynamic Auditing Protocol for Data Storage in Cloud Computing , 2013, IEEE Transactions on Parallel and Distributed Systems.
[13] Miklós Ajtai,et al. Generating Hard Instances of the Short Basis Problem , 1999, ICALP.
[14] Mary Baker,et al. Privacy-Preserving Audit and Extraction of Digital Contents , 2008, IACR Cryptol. ePrint Arch..
[15] Chunxiang Xu,et al. Secure and efficient privacy-preserving public auditing scheme for cloud storage , 2014, Comput. Electr. Eng..
[16] David Cash,et al. Bonsai Trees, or How to Delegate a Lattice Basis , 2010, Journal of Cryptology.
[17] Craig Gentry,et al. Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..
[18] Vinod Vaikuntanathan,et al. Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages , 2011, CRYPTO.
[19] Daniele Micciancio,et al. Asymptotically Effi cient Lattice-Based Digital Signatures , 2008, IACR Cryptol. ePrint Arch..
[20] Markus Rückert,et al. Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles , 2010, PQCrypto.
[21] Chris Peikert,et al. On Ideal Lattices and Learning with Errors over Rings , 2010, JACM.
[22] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[23] Cong Wang,et al. Dynamic Data Operations with Deduplication in Privacy-Preserving Public Auditing for Secure Cloud Storage , 2017, 22017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC).
[24] Cao Wenming,et al. Public Proof of Cloud Storage from Lattice Assumption , 2014 .
[25] Adi Shamir,et al. Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.