A Novel Approach to Ensure Data Confidentiality Using Encryption and Obfuscation
Abstract— In information society, data is become one of the most important part to company or individual. Documented file is one of the forms for storing data on a storage media, especially for use by computers. Thus, documented file protection has become urgent. This paper presents a novel approach to protect documented files from unauthorized access by combining encryption and obfuscation. Encryption is used to protect the confidentiality of document content, and obfuscation provides a way to protect program code by making it unreadable and use to control access. The proposed system protects documented files not only content confidentiality but files access control methods, and can reduce the chance of data leakage at utmost.
|
Tài liệu tham khảo [1]. B. Barak, O. Goldreich, R. Impagliazzo, S. Rucich, A. Sahai, S. Vadhan, and K. Yang, “On the (Im) possibility of obfuscating programs”, J. ACM, vol. 59, no. 2, pp. 1-48, May 2012. [2]. Federal Agency on Technical Regulating and Metrology, “Information technology. Cryptographic data security. Block ciphers. GOST R 34.12-2015”, 2015. [3]. S. Garg, C. Gentry, S. Halevi , Candidate “Indistinguishability Obfuscation and Functional Encryption for all circuits”. IACR Cryptology ePrint Archive, no. 451, 2013. [4]. I. Goldberg, D. Wagner, R. Thoms and E.A. Brewer, “A secure environment for untrusted helper applications: confining the wily hacker”, In USENIX Security Symposium. [5]. Z. Liang, V. Venkatakrishanan and R. Sekar, “Isolated program execution: An application transparent approach for executing untrusted programs”, In Proceedings of Annual Computer Security Applications Conference. [6]. D. Boneh and A. Silverberg, “Applications of multilinear forms to cryptography”, vol. 324, no. 1, pp. 71-90, 2003. [7]. S. Garg, C. Gentry and S. Halevi, “Candidate multilinear maps from ideal lattices”. In Advances in Cryptology – EUROCRYPT, pp. 1-17, 2013. [8]. J. S. Coron, T. Lepoint and M. Tibouchi, “Practical multilinear maps over the integers”, In Advances in Cryptology – CRYPTO, pp.476-493, 2013. [9]. M. Sauerhoff, I. Wegener and R. Werchner, “Relating branching program size and formula size over the full binary basis” In Proceedings of 16th STACS. pp. 57-67, 1999. [10]. A. V. Kozachok, M. V. Bochkov and L. M. Tuan, “Indistinguishable obfuscation security theoretical proof”, Cybersecurity issues, no. 1(14), pp. 36-46, 2016. |
Alexander Kozachok
