Application homomorphic cryptographic algorithm for encrypting data in the cloud storage
dc.citation.epage | 44 | |
dc.citation.issue | 908 | |
dc.citation.journalTitle | Вісник Національного університету “Львівська політехніка”. Серія: Комп’ютерні системи проектування теорія і практика | |
dc.citation.spage | 35 | |
dc.contributor.affiliation | Lviv Polytechnic National University | |
dc.contributor.affiliation | Lviv institute State University “The University of Banking” | |
dc.contributor.author | Belej, O. | |
dc.contributor.author | Nestor, N. | |
dc.contributor.author | Melnyk, N. | |
dc.coverage.placename | Львів | |
dc.coverage.placename | Lviv | |
dc.date.accessioned | 2020-03-06T09:20:13Z | |
dc.date.available | 2020-03-06T09:20:13Z | |
dc.date.created | 2018-02-26 | |
dc.date.issued | 2018-02-26 | |
dc.description.abstract | Проаналізовано наявні та перспективні системи гомоморфного шифрування і їх практичне застосування. Автори розглянули деякі моделі гомоморфних криптографічних алгоритмів, що може бути корисно з практичного погляду. Однією з цікавих і практично цінних схем шифрування вважається алгоритм, побудований на матричних поліномах. Розглянуто також окремі випадки гомоморфного шифрування, модель захищеної хмарної бази даних, яка ґрунтується на повністю гомоморфній схемі шифрування. | |
dc.description.abstract | The article analyzes existing and perspective systems of homomorphic encryption and their practical application. The author considers some models of homomorphy cryptographic algorithms, which may be useful from a practical point of view. One of the interesting and practically valuable encryption schemes is cryptographic algorithm, which is constructed on matrix polynomials. Also considered are isolated cases of homomorphic encryption, a protected cloud database model based on a completely homomorphic encryption scheme. | |
dc.format.extent | 35-44 | |
dc.format.pages | 10 | |
dc.identifier.citation | Belej O. Application homomorphic cryptographic algorithm for encrypting data in the cloud storage / O. Belej, N. Nestor, N. Melnyk // Вісник Національного університету “Львівська політехніка”. Серія: Комп’ютерні системи проектування теорія і практика. — Львів : Видавництво Львівської політехніки, 2018. — № 908. — С. 35–44. | |
dc.identifier.citationen | Belej O. Application homomorphic cryptographic algorithm for encrypting data in the cloud storage / O. Belej, N. Nestor, N. Melnyk // Visnyk Natsionalnoho universytetu "Lvivska politekhnika". Serie: Kompiuterni systemy proektuvannia teoriia i praktyka. — Lviv : Vydavnytstvo Lvivskoi politekhniky, 2018. — No 908. — P. 35–44. | |
dc.identifier.uri | https://ena.lpnu.ua/handle/ntb/46927 | |
dc.language.iso | en | |
dc.publisher | Видавництво Львівської політехніки | |
dc.relation.ispartof | Вісник Національного університету “Львівська політехніка”. Серія: Комп’ютерні системи проектування теорія і практика, 908, 2018 | |
dc.relation.references | 1. Ahmad, I. Survey: homomorphic encryption schemes / I. Ahmad, D. Adiga // Proc. of 9th IRF Intern. Conf. – Pune, India, 2014. – P. 89–94. | |
dc.relation.references | 2. D. Boneh, S. Halevi, M. Hamburg, and R. Ostrovsky. Circular-Secure Encryption from Decision Diffie-Hellman. In Proc. of Crypto ’08, LNCS 5157, pages 108–125. | |
dc.relation.references | 3. Cash D., Jaeger J., Jarecki St., Jutla Ch., Krawczyk H., Rosu M.-C., Steiner M. Highlyscalable searchable symmetric encryption with support for Boolean queries // Advances in Cryptology – CRYPTO 2013 / R. Canetti, J. A. Garay, eds. – Berlin: Springer, 2013. – (Lect. Notes Comp. Sci. Security Cryptology; Vol. 8042). – P. 353–373. | |
dc.relation.references | 4. Gentry C. A Fully Homomorphic Encryption Scheme: Ph. D. thesis. – Stanford Univ., 2009. | |
dc.relation.references | 5. Song D., Wagner D., Perrig A. Practical techniques for searches on encrypted data // SP’00 Proc. 2000 IEEE Symp. Security and Privacy. – Berkeley: Univ. California, 2000. | |
dc.relation.references | 6. Gentry, C. A Fully homomorphic encryption using ideal lattices / C. Gentry // Symposium on the Theory of Computing (STOC). – Bethesda, USA, 2009. – P. 169–178. | |
dc.relation.references | 7. Gentry, C. Homomorphic Encryption from Learning With Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based / C. Gentry, A. Sahai, B. Waters // Advances in cryptology – CRYPTO-2013, 33rd Annual Cryptology Conf. – Santa Barbara, CA, USA, 2013. – Part 1. – P. 73–93. | |
dc.relation.references | 8. Stehle D., Steinfeld R. Faster fully homomorphic encryption // Advances in Cryptology – ASIACRYPT 2010: 16th Int. Conf. on the Theory and Application of Cryptology and Information Security, Singapore, December 5–9, 2010. Proc. – Berlin: Springer, 2010. – (Lect. Notes Comp. Sci.; Vol. 6477). – P. 377–394. | |
dc.relation.references | 9. Rivest, R. L. On data banks and privacy homomorphisms / R. L. Rivest, L. Adleman, M. L. Dertouzos // Foundations of secure computation. – 1978. – Vol. 32, no. 4. – P. 169–178. 7. Survey of various homomorphic encryption algorithms and schemes / P. V. Parmar [et al.] // Intern. J. of Computer Applications. – 2014. – Vol. 91, no. 8. – P. 26–32. 8. M. Prabhakaran and M. Rosulek. Homomorphic Encryption with CCA Security. In Proc. of ICALP ’08. Springer, 2008. Mikolaj Karpinski, Vitalii Chyzh, Stepan Balaban, Joanna Gancarczyk, Paweł Fałat. Increasing the level of information security in wireless sensor networks by improving their geometric models // SGEM 2018 : 18th International Multidisciplinary Scientific Geoconference : Informatics. Informatics, go informatics and remote sensing. Issue 2.1 : conference proceedings. Volume 18. – Sofia : STEF92 Technology, 2018. – S. 469–476. – P-ISSN: 1314-2704 ; p-ISBN: 978-619-7408-39-3. – DOI: 10.5593/sgem2018/2.10000019098 | |
dc.relation.referencesen | 1. Ahmad, I. Survey: homomorphic encryption schemes, I. Ahmad, D. Adiga, Proc. of 9th IRF Intern. Conf, Pune, India, 2014, P. 89–94. | |
dc.relation.referencesen | 2. D. Boneh, S. Halevi, M. Hamburg, and R. Ostrovsky. Circular-Secure Encryption from Decision Diffie-Hellman. In Proc. of Crypto ’08, LNCS 5157, pages 108–125. | |
dc.relation.referencesen | 3. Cash D., Jaeger J., Jarecki St., Jutla Ch., Krawczyk H., Rosu M.-C., Steiner M. Highlyscalable searchable symmetric encryption with support for Boolean queries, Advances in Cryptology – CRYPTO 2013, R. Canetti, J. A. Garay, eds, Berlin: Springer, 2013, (Lect. Notes Comp. Sci. Security Cryptology; Vol. 8042), P. 353–373. | |
dc.relation.referencesen | 4. Gentry C. A Fully Homomorphic Encryption Scheme: Ph. D. thesis, Stanford Univ., 2009. | |
dc.relation.referencesen | 5. Song D., Wagner D., Perrig A. Practical techniques for searches on encrypted data, SP’00 Proc. 2000 IEEE Symp. Security and Privacy, Berkeley: Univ. California, 2000. | |
dc.relation.referencesen | 6. Gentry, C. A Fully homomorphic encryption using ideal lattices, C. Gentry, Symposium on the Theory of Computing (STOC), Bethesda, USA, 2009, P. 169–178. | |
dc.relation.referencesen | 7. Gentry, C. Homomorphic Encryption from Learning With Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based, C. Gentry, A. Sahai, B. Waters, Advances in cryptology – CRYPTO-2013, 33rd Annual Cryptology Conf, Santa Barbara, CA, USA, 2013, Part 1, P. 73–93. | |
dc.relation.referencesen | 8. Stehle D., Steinfeld R. Faster fully homomorphic encryption, Advances in Cryptology – ASIACRYPT 2010: 16th Int. Conf. on the Theory and Application of Cryptology and Information Security, Singapore, December 5–9, 2010. Proc, Berlin: Springer, 2010, (Lect. Notes Comp. Sci.; Vol. 6477), P. 377–394. | |
dc.relation.referencesen | 9. Rivest, R. L. On data banks and privacy homomorphisms, R. L. Rivest, L. Adleman, M. L. Dertouzos, Foundations of secure computation, 1978, Vol. 32, no. 4, P. 169–178. 7. Survey of various homomorphic encryption algorithms and schemes, P. V. Parmar [et al.], Intern. J. of Computer Applications, 2014, Vol. 91, no. 8, P. 26–32. 8. M. Prabhakaran and M. Rosulek. Homomorphic Encryption with CCA Security. In Proc. of ICALP ’08. Springer, 2008. Mikolaj Karpinski, Vitalii Chyzh, Stepan Balaban, Joanna Gancarczyk, Paweł Fałat. Increasing the level of information security in wireless sensor networks by improving their geometric models, SGEM 2018 : 18th International Multidisciplinary Scientific Geoconference : Informatics. Informatics, go informatics and remote sensing. Issue 2.1 : conference proceedings. Volume 18, Sofia : STEF92 Technology, 2018, S. 469–476, P-ISSN: 1314-2704 ; p-ISBN: 978-619-7408-39-3, DOI: 10.5593/sgem2018/2.10000019098 | |
dc.rights.holder | © Національний університет “Львівська політехніка”, 2018 | |
dc.rights.holder | © Belej O., Nestor N., Melnyk N., 2018 | |
dc.subject | гомоморфний | |
dc.subject | криптоалгоритм | |
dc.subject | шифрування | |
dc.subject | хмарні технології | |
dc.subject | сховища даних | |
dc.subject | homomorphic | |
dc.subject | cryptographic algorithm | |
dc.subject | encryption | |
dc.subject | cloud technologies | |
dc.subject | data warehouses | |
dc.subject.udc | 004.032.26 | |
dc.title | Application homomorphic cryptographic algorithm for encrypting data in the cloud storage | |
dc.title.alternative | Застосування гомоморфного криптоалгоритму для шифрування даних у хмарному сховищі | |
dc.type | Article |
Files
License bundle
1 - 1 of 1