The future work of the research topic can be in the following range:
1. Privacy-preserving approaches for Internet-of-Things. The Internet-of-Things as a new trend of research has attracted huge attention for the challenges on its security and privacy issues. The privacy-preserving applications in cloud will meet the new challenge when they are applied to IoT systems with limits on computation and communication. Thus, we plan to extend the approaches presented in this thesis to a server/edge-aided setting to cope the constrains of IoT devices.
2. Privacy-preserving solutions for Blockchain. The blockchain is a recently hot re- search topic. The privacy issue is the main concern for the user of blockchain-based applications since the blockchain is published to the public. The privacy-preserving approaches presented in this thesis are in a centralised structure. How to extend the approaches to a decentralised structure for their adoption in blockchain is one of our future works.
[1] Masayuki Abe, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, and Miyako Ohkubo. Structure-preserving signatures and commitments to group elements. In CRYPTO, pages 209–236, 2010.
[2] Noga Alon and Michael Luby. A linear time erasure-resilient code with nearly opti- mal recovery. IEEE Trans. Information Theory, 42(6):1732–1736, 1996.
[3] Mohammed A. Alzain, Ben Soh, and Eric Pardede. A new approach using redun- dancy technique to improve security in cloud computing. In 2012 International Conference on Cyber Security, Cyber Warfare and Digital Forensic, CyberSec 2012, Kuala Lumpur, Malaysia, June 26-28, 2012, pages 230–235. IEEE, 2012.
[4] Frederik Armknecht, Jens-Matthias Bohli, Ghassan O. Karame, Zongren Liu, and Christian A. Reuter. Outsourced proofs of retrievability. In Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Scottsdale, AZ, USA, November 3-7, 2014, pages 831–843, 2014.
[5] Giuseppe Ateniese, Randal C. Burns, Reza Curtmola, Joseph Herring, Lea Kissner, Zachary N. J. Peterson, and Dawn Xiaodong Song. Provable data possession at untrusted stores. In ACM CCS, pages 598–609, 2007.
[6] Giuseppe Ateniese, Seny Kamara, and Jonathan Katz. Proofs of storage from ho- momorphic identification protocols. In ASIACRYPT, pages 319–333, 2009.
[7] Giuseppe Ateniese, Roberto Di Pietro, Luigi V. Mancini, and Gene Tsudik. Scalable and efficient provable data possession. In ICST SECURECOMM, page 9, 2008.
[8] Paulo S. L. M. Barreto and Michael Naehrig. Pairing-friendly elliptic curves of prime order. In Selected Areas in Cryptography, 12th International Workshop, SAC 2005, Kingston, ON, Canada, August 11-12, 2005, Revised Selected Papers, pages 319–331, 2005.
[9] Ayad F. Barsoum and M. Anwar Hasan. Provable multicopy dynamic data posses- sion in cloud computing systems. IEEE Trans. Information Forensics and Security, 10(3):485–497, 2015.
[10] John Bethencourt, Amit Sahai, and Brent Waters. Ciphertext-policy attribute-based encryption. In IEEE Symposium on Security and Privacy (S&P), pages 321–334, 2007.
[11] Dan Boneh and Xavier Boyen. Short signatures without random oracles. In Ad- vances in Cryptology - EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004, Proceedings, pages 56–73, 2004.
[12] Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, and Giuseppe Persiano. Pub- lic key encryption with keyword search. In Advances in Cryptology - EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004, Proceedings, pages 506–522, 2004.
[13] Dan Boneh and Matthew K. Franklin. Identity based encryption from the weil pair- ing. IACR Cryptology ePrint Archive, 2001:90, 2001.
[14] Dan Boneh, Ben Lynn, and Hovav Shacham. Short signatures from the weil pairing. In ASIACRYPT, pages 514–532, 2001.
[15] Jan Camenisch, Rafik Chaabouni, and Abhi Shelat. Efficient protocols for set mem- bership and range proofs. In Advances in Cryptology - ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology and Infor- mation Security, Melbourne, Australia, December 7-11, 2008. Proceedings, pages 234–252, 2008.
[16] David Cash, Alptekin K¨upc¸¨u, and Daniel Wichs. Dynamic proofs of retrievability via oblivious RAM. In EUROCRYPT, pages 279–295, 2013.
[17] Bo Chen, Reza Curtmola, Giuseppe Ateniese, and Randal C. Burns. Remote data checking for network coding-based distributed storage systems. In Proceedings of the 2nd ACM Cloud Computing Security Workshop, CCSW 2010, Chicago, IL, USA, October 8, 2010, pages 31–42, 2010.
[18] Henry C. H. Chen and Patrick P. C. Lee. Enabling data integrity protection in regenerating-coding-based cloud storage: Theory and implementation. IEEE Trans. Parallel Distrib. Syst., 25(2):407–416, 2014.
[19] Rongmao Chen, Yi Mu, Guomin Yang, and Fuchun Guo. BL-MLE: block-level message-locked encryption for secure large file deduplication. IEEE Trans. Infor- mation Forensics and Security, 10(12):2643–2652, 2015.
[20] Rongmao Chen, Yi Mu, Guomin Yang, Fuchun Guo, and Xiaofen Wang. Dual- server public-key encryption with keyword search for secure cloud storage. IEEE Trans. Information Forensics and Security, 11(4):789–798, 2016.
[21] X. U. Chun-xiang, H. E. Xiao-hu, and Daniel Abraha. Cryptanalysis of auditing protocol proposed by wang et al. for data storage security in cloud computing. IACR Cryptology ePrint Archive, 2012:115, 2012.
[22] Ronald Cramer and Victor Shoup. A practical public key cryptosystem provably se- cure against adaptive chosen ciphertext attack. In Hugo Krawczyk, editor, Advances in Cryptology - CRYPTO ’98, 18th Annual International Cryptology Conference, Santa Barbara, California, USA, August 23-27, 1998, Proceedings, volume 1462 of Lecture Notes in Computer Science, pages 13–25. Springer, 1998.
[23] Angelo De Caro and Vincenzo Iovino. jpbc: Java pairing based cryptography. In Proceedings of the 16th IEEE Symposium on Computers and Communications, ISCC 2011, pages 850–855, Kerkyra, Corfu, Greece, June 28 - July 1, 2011. IEEE.
[24] Yves Deswarte, Jean-Jacques Quisquater, and Ayda Sa¨ıdane. Remote integrity checking - how to trust files stored on untrusted servers. In IFIP IICIS, pages 1– 11, 2003.
[25] Whitfield Diffie and Martin E. Hellman. New directions in cryptography. IEEE Trans. Information Theory, 22(6):644–654, 1976.
[26] II Ecrypt. European network of excellence in cryptology ii. Yearly Report on Algo- rithms and Keysizes (2009-2010), pages 539–556, 2010.
[27] C. Christopher Erway, Alptekin K¨upc¸¨u, Charalampos Papamanthou, and Roberto Tamassia. Dynamic provable data possession. In ACM CCS, pages 213–222, 2009.
[28] Xinyu Fan, Guomin Yang, Yi Mu, and Yong Yu. On indistinguishability in remote data integrity checking. Comput. J., 58(4):823–830, 2015.
[29] Jun Feng, Yu Chen, Wei-Shinn Ku, and Pu Liu. Analysis of integrity vulnerabilities and a non-repudiation protocol for cloud data storage platforms. In ICPP, pages 251–258, 2010.
[30] Georg Fuchsbauer, Eike Kiltz, and Julian Loss. The algebraic group model and its applications. In Advances in Cryptology - CRYPTO 2018 - 38th Annual Inter- national Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II, pages 33–62, 2018.
[31] Eiichiro Fujisaki and Tatsuaki Okamoto. Secure integration of asymmetric and sym- metric encryption schemes. In Michael J. Wiener, editor, Advances in Cryptology - CRYPTO ’99, 19th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15-19, 1999, Proceedings, volume 1666 of Lecture Notes in Computer Science, pages 537–554. Springer, 1999.
[32] Steven D Galbraith, Kenneth G Paterson, and Nigel P Smart. Pairings for cryptog- raphers. Discrete Applied Mathematics, 156(16):3113–3121, 2008.
[33] Taher El Gamal. A public key cryptosystem and a signature scheme based on dis- crete logarithms. IEEE Trans. Inf. Theory, 31(4):469–472, 1985.
[34] Essam Ghadafi. How low can you go? short structure-preserving signatures for diffie-hellman vectors. In Cryptography and Coding - 16th IMA International Con- ference, IMACC 2017, Oxford, UK, December 12-14, 2017, Proceedings, pages 185–204, 2017.
[35] Essam Ghadafi, Nigel P. Smart, and Bogdan Warinschi. Groth-sahai proofs revis- ited. In Public Key Cryptography - PKC 2010, 13th International Conference on Practice and Theory in Public Key Cryptography, Paris, France, May 26-28, 2010. Proceedings, pages 177–192, 2010.
[36] Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. A ”paradoxical” solution to the signature problem (extended abstract). In 25th Annual Symposium on Founda- tions of Computer Science, West Palm Beach, Florida, USA, 24-26 October 1984, pages 441–448. IEEE Computer Society, 1984.
[37] Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., 17(2):281–308, 1988.
[38] Bernd Grobauer, Tobias Walloschek, and Elmar St¨ocker. Understanding cloud com- puting vulnerabilities. IEEE Security & Privacy, 9(2):50–57, 2011.
[39] Jens Groth. Homomorphic trapdoor commitments to group elements. IACR Cryp- tology ePrint Archive, 2009:7, 2009.
[40] Jens Groth and Amit Sahai. Efficient non-interactive proof systems for bilinear groups. In Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008. Proceedings, pages 415–432, 2008.
[41] Kaibin Huang, Raylin Tso, Yu-Chi Chen, Sk. Md. Mizanur Rahman, Ahmad Almo- gren, and Atif Alamri. PKE-AET: public key encryption with authorized equality test. Comput. J., 58(10):2686–2697, 2015.
[42] Tibor Jager and Andy Rupp. The semi-generic group model and applications to pairing-based cryptography. In ASIACRYPT, pages 539–556, 2010.
[43] Bo Jiang, Binoy Ravindran, and Changsoo Kim. Lightweight live migration for high availability cluster service. In Shlomi Dolev, Jorge Arturo Cobb, Michael J. Fischer, and Moti Yung, editors, Stabilization, Safety, and Security of Distributed Systems - 12th International Symposium, SSS 2010, New York, NY, USA, September 20-22, 2010. Proceedings, volume 6366 of Lecture Notes in Computer Science, pages 420– 434. Springer, 2010.
[44] Peng Jiang, Yi Mu, Fuchun Guo, Xiaofen Wang, and Qiaoyan Wen. Online/offline ciphertext retrieval on resource constrained devices. Comput. J., 59(7):955–969, 2016.
[45] Ari Juels and Burton S. Kaliski Jr. Pors: proofs of retrievability for large files. In ACM CCS, pages 584–597, 2007.
[46] Seny Kamara and Kristin E. Lauter. Cryptographic cloud storage. In Financial Cryptography and Data Security, FC 2010 Workshops, RLCPS, WECSR, and WLC 2010, Tenerife, Canary Islands, Spain, January 25-28, 2010, Revised Selected Pa- pers, pages 136–149, 2010.
[47] Eike Kiltz and Julian Loss. The algebraic group model and its applications. IACR Cryptology ePrint Archive, 2017:620, 2017.
[48] Jiangtao Li, Lei Zhang, Joseph K. Liu, Haifeng Qian, and Zheming Dong. Privacy- preserving public auditing protocol for low-performance end devices in cloud. IEEE Trans. Information Forensics and Security, 11(11):2572–2583, 2016.
[49] Hongyu Liu, Leiting Chen, Zahra Davar, and Mohammad Ramezanian Pour. Insecu- rity of an efficient privacy-preserving public auditing scheme for cloud data storage. J. UCS, 21(3):473–482, 2015.
[50] Jian Liu, Kun Huang, Hong Rong, Huimei Wang, and Ming Xian. Privacy- preserving public auditing for regenerating-code-based cloud storage. IEEE Trans. Information Forensics and Security, 10(7):1513–1528, 2015.
[51] Sha Ma. Identity-based encryption with outsourced equality test in cloud computing. Inf. Sci., 328:389–402, 2016.
[52] Sha Ma, Qiong Huang, Mingwu Zhang, and Bo Yang. Efficient public key encryp- tion with equality test supporting flexible authorization. IEEE Trans. Information Forensics and Security, 10(3):458–470, 2015.
[53] Sha Ma, Mingwu Zhang, Qiong Huang, and Bo Yang. Public key encryption with delegated equality test in a multi-user setting. Comput. J., 58(4):986–1002, 2015.
[54] Daniel A. Mayer and Susanne Wetzel. Verifiable private equality test: enabling unbiased 2-party reconciliation on ordered sets in the malicious model. In 7th ACM Symposium on Information, Compuer and Communications Security, ASIACCS ’12, Seoul, Korea, May 2-4, 2012, pages 46–47, 2012.
[55] Amiya Nayak and Ivan Stojmenovic. Handbook of applied algorithms: Solving scientific, engineering, and practical problems. John Wiley & Sons, 2007.
[56] Shen Noether and Adam Mackenzie. Ring confidential transactions. Ledger, 1:1–18, 2016.
[57] Torben P. Pedersen. Non-interactive and information-theoretic secure verifiable se- cret sharing. In Advances in Cryptology - CRYPTO ’91, 11th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1991, Pro- ceedings, pages 129–140, 1991.
[58] Luigi Rizzo. Effective erasure codes for reliable computer communication protocols. Computer Communication Review, 27(2):24–36, 1997.
[59] Hovav Shacham and Brent Waters. Compact proofs of retrievability. In ASIACRYPT, pages 90–107, 2008.
[60] Adi Shamir. Identity-based cryptosystems and signature schemes. In G. R. Blakley and David Chaum, editors, Advances in Cryptology, Proceedings of CRYPTO ’84, Santa Barbara, California, USA, August 19-22, 1984, Proceedings, volume 196 of Lecture Notes in Computer Science, pages 47–53. Springer, 1984.
[61] Elaine Shi, Emil Stefanov, and Charalampos Papamanthou. Practical dynamic proofs of retrievability. In ACM CCS, pages 325–336, 2013.
[62] Victor Shoup. Lower bounds for discrete logarithms and related problems. In Ad- vances in Cryptology - EUROCRYPT ’97, International Conference on the The- ory and Application of Cryptographic Techniques, Konstanz, Germany, May 11-15, 1997, Proceeding, pages 256–266, 1997.
[63] Victor Shoup. Sequences of games: a tool for taming complexity in security proofs. IACR Cryptology ePrint Archive, 2004:332, 2004.
[64] Victor Shoup. A computational introduction to number theory and algebra. Cam- bridge University Press, 2006.
[65] Dilbag Singh, Jaswinder Singh, and Amit Chhabra. High availability of clouds: Failover strategies for cloud computing using integrated checkpointing algorithms. In 2012 International Conference on Communication Systems and Network Tech- nologies, pages 698–703. IEEE, 2012.
[66] Niharika Singh and Ashutosh Kumar Singh. Data privacy protection mechanisms in cloud. Data Science and Engineering, 3(1):24–39, 2018.
[67] Hatsukazu Tanaka. A realization scheme for the identity-based cryptosystem. In Carl Pomerance, editor, Advances in Cryptology - CRYPTO ’87, A Conference on the Theory and Applications of Cryptographic Techniques, Santa Barbara, California, USA, August 16-20, 1987, Proceedings, volume 293 of Lecture Notes in Computer Science, pages 340–349. Springer, 1987.
[68] Chunming Tang, Dingyi Pei, Zhuojun Liu, Zheng-an Yao, and Mingsheng Wang. Perfectly hiding commitment scheme with two-round from any one-way permuta- tion. IACR Cryptology ePrint Archive, 2008:34, 2008.
[69] Qiang Tang. Public key encryption schemes supporting equality test with autho- rization of different granularity. International Journal of Applied Cryptography, 2(4):304–321, 2012.
[70] Qiang Tang. Public key encryption supporting plaintext equality test and user- specified authorization. Security and Communication Networks, 5(12):1351–1362, 2012.
[71] Yangguang Tian, Shiwei Zhang, Guomin Yang, Yi Mu, and Yong Yu. Privacy- preserving k-time authenticated secret handshakes. In Information Security and Pri- vacy - 22nd Australasian Conference, ACISP 2017, Auckland, New Zealand, July 3-5, 2017, Proceedings, Part II, pages 281–300, 2017.
[72] Shigeo Tsujii and Toshiya Itoh. An id-based cryptosystem based on the discrete logarithm problem. IEEE Journal on Selected Areas in Communications, 7(4):467– 473, 1989.
[73] Cong Wang, Sherman S. M. Chow, Qian Wang, Kui Ren, and Wenjing Lou. Privacy- preserving public auditing for secure cloud storage. IEEE Trans. Computers, 62(2):362–375, 2013.
[74] Cong Wang, Qian Wang, Kui Ren, and Wenjing Lou. Privacy-preserving public auditing for data storage security in cloud computing. In INFOCOM, pages 525– 533, 2010.
[75] Huaqun Wang, Debiao He, and Shaohua Tang. Identity-based proxy-oriented data uploading and remote data integrity checking in public cloud. IEEE Trans. Informa- tion Forensics and Security, 11(6):1165–1176, 2016.
[76] Jianzong Wang, Weijiao Gong, Peter J. Varman, and Changsheng Xie. Reducing storage overhead with small write bottleneck avoiding in cloud RAID system. In 13th ACM/IEEE International Conference on Grid Computing, GRID 2012, Beijing, China, September 20-23, 2012, pages 174–183. IEEE Computer Society, 2012.
[77] Qian Wang, Cong Wang, Jin Li, Kui Ren, and Wenjing Lou. Enabling public ver- ifiability and data dynamics for storage security in cloud computing. In ESORICS, pages 355–370, 2009.
[78] Yujue Wang, Qianhong Wu, Bo Qin, Wenchang Shi, Robert H. Deng, and Jiankun Hu. Identity-based data outsourcing with comprehensive auditing in clouds. IEEE Trans. Information Forensics and Security, 12(4):940–952, 2017.
[79] Yujue Wang, Qianhong Wu, Bo Qin, Shaohua Tang, and Willy Susilo. Online/of- fline provable data possession. IEEE Trans. Information Forensics and Security, 12(5):1182–1194, 2017.
[80] Mao Wenbo. Modern cryptography: theory and practice. Publisher: Prentice Hall PTR, Copyright: Hewlett Packard, 2004.
[81] Solomon Guadie Worku, Chunxiang Xu, Jining Zhao, and Xiaohu He. Secure and efficient privacy-preserving public auditing scheme for cloud storage. Computers & Electrical Engineering, 40(5):1703–1713, 2014.
[82] Guomin Yang, Chik How Tan, Qiong Huang, and Duncan S. Wong. Probabilistic public key encryption with equality test. In Topics in Cryptology - CT-RSA 2010, The Cryptographers’ Track at the RSA Conference 2010, San Francisco, CA, USA, March 1-5, 2010. Proceedings, pages 119–131, 2010.
[83] Jia Yu, Kui Ren, and Cong Wang. Enabling cloud storage auditing with verifi- able outsourcing of key updates. IEEE Trans. Information Forensics and Security, 11(6):1362–1375, 2016.
[84] Jia Yu, Kui Ren, Cong Wang, and Vijay Varadharajan. Enabling cloud storage audit- ing with key-exposure resistance. IEEE Trans. Information Forensics and Security, 10(6):1167–1179, 2015.
[85] Jia Yu and Huaqun Wang. Strong key-exposure resilient auditing for secure cloud storage. IEEE Trans. Information Forensics and Security, 12(8):1931–1940, 2017.
[86] Yong Yu, Man Ho Au, Giuseppe Ateniese, Xinyi Huang, Willy Susilo, Yuanshun Dai, and Geyong Min. Identity-based remote data integrity checking with perfect data privacy preserving for cloud storage. IEEE Trans. Information Forensics and Security, 12(4):767–778, 2017.
[87] Yuan Zhang, Chunxiang Xu, Xiaodong Lin, and Xuemin Sherman Shen. Blockchain-based public integrity verification for cloud storage against procrasti- nating auditors. IEEE Transactions on Cloud Computing, 2019.