Confidential greedy graph algorithm
Abstract
Confidential algorithm for the approximate graph vertex covering problem is presented in this article. It can preserve privacy of data at every stage of the computation, which is very important in context of cloud computing. Security of~our solution is based on fully homomorphic encryption scheme. The time complexity and the security aspects of considered algorithm are described.
References
R. M. Karp, “Reducibility among combinatorial problems”, in Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations, held March 20–22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, Mathematics Program, IBM World Trade Corporation, and the IBM Research Mathematical Sciences Department, R. E. Miller, J. W. Thatcher, and J. D. Bohlinger, Eds. Boston, MA: Springer US, 1972, pp. 85–103, ISBN: 978-1-4684-2001-2. DOI: 10.1007/ 978- 1- 4684- 2001- 2 9. [Online]. Available: http://dx. doi.org/10.1007/978-1-4684-2001-2 9.
A. C. Yao, “Protocols for secure computations”, Washington, DC, USA: IEEE Computer Society, 1982, pp. 160–164.
O. Regev, “On lattices, learning with errors, random linear codes, and cryptography”, in Proceedings of the Thirty-seventh Annual ACM Symposium on Theory of Computing, ser. STOC ’05, Baltimore, MD, USA: ACM, 2005, pp. 84–93, ISBN: 1-58113-960-8. DOI: 10. 1145/1060590.1060603. [Online]. Available: http://doi. acm.org/10.1145/1060590.1060603.
W. Stein and D. Joyner, “Sage: System for algebra and geometry experimentation”, ACM SIGSAM Bulletin, vol. 39, no. 2, pp. 61–64, 2005. [Online]. Available: http : / / modular . math . washington . edu / sage / misc / sage sigsam updated.pdf.
C. Gentry, “Fully homomorphic encryption using ideal lattices”, in Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, ser. STOC ’09, Bethesda, MD, USA: ACM, 2009, pp. 169–178, ISBN: 978-1-60558-506-2. DOI: 10 . 1145/ 1536414 . 1536440. [Online]. Available: http : / / doi . acm . org / 10 . 1145 / 1536414.1536440.
Z. Brakerski, C. Gentry, and V. Vaikuntanathan, “(leveled) fully homomorphic encryption without bootstrapping”, in Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, ser. ITCS ’12, Cambridge, Massachusetts: ACM, 2012, pp. 309–325, ISBN: 978-1-4503-1115-1. DOI: 10 . 1145 / 2090236 . 2090262. [Online]. Available: http:// doi.acm. org/ 10. 1145/2090236.2090262.
J. Fan and F. Vercauteren, Somewhat practical fully homomorphic encryption, Cryptology ePrint Archive, Report 2012/144, http://eprint.iacr.org/2012/144, 2012.
S. Halevi and V. Shoup, “Algorithms in helib”, in Advances in Cryptology – CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part I, J. A. Garay and R. Gennaro, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014, pp. 554–571, ISBN: 978-3- 662-44371-2. DOI: 10.1007/978 - 3 - 662 - 44371 - 2 31. [Online]. Available: https://doi.org/10.1007/978-3-662- 44371-2 31.
X. Liao, S. Uluagac, and R. A. Beyah, “S-match: Verifiable privacy-preserving profile matching for mobile social services”, in 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Jun. 2014, pp. 287–298. DOI: 10.1109/DSN. 2014.37.
S. Chatterjee and M. P. L. Das, “Property preserving symmetric encryption revisited”, in Advances in Cryptology – ASIACRYPT 2015, T. Iwata and J. H. Cheon, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2015, pp. 658–682, ISBN: 978-3-662-48800-3.
C. Jayet-Griffon, M.-A. Cornelie, P. Maistri, P. ElbazVincent, and R. Leveugle, “Polynomial multipliers for Fully Homomorphic Encryption on FPGA”, in International Conference on ReConFigurable Computing and FPGAs (ReConFig’15), ser. Proceedings IEEE Catalog Number CFP15389-CDR, collection Persyval Lab., Mayan Riviera, Mexico: IEEE, Dec. 2015. [Online]. JOURNAL OF LATEX CLASS FILES, VOL. 6, NO. 1, JANUARY 2007 6 Available: https : / / hal . archives - ouvertes . fr / hal - 01240658.
X. Meng, S. Kamara, K. Nissim, and G. Kollios, Grecs: Graph encryption for approximate shortest distance queries, Cryptology ePrint Archive, Report 2015/266, http://eprint.iacr.org/2015/266, 2015.
Downloads
Published
Issue
Section
License
Copyright (c) 2018 International Journal of Electronics and Telecommunications
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
1. License
The non-commercial use of the article will be governed by the Creative Commons Attribution license as currently displayed on https://creativecommons.org/licenses/by/4.0/.
2. Author’s Warranties
The author warrants that the article is original, written by stated author/s, has not been published before, contains no unlawful statements, does not infringe the rights of others, is subject to copyright that is vested exclusively in the author and free of any third party rights, and that any necessary written permissions to quote from other sources have been obtained by the author/s. The undersigned also warrants that the manuscript (or its essential substance) has not been published other than as an abstract or doctorate thesis and has not been submitted for consideration elsewhere, for print, electronic or digital publication.
3. User Rights
Under the Creative Commons Attribution license, the author(s) and users are free to share (copy, distribute and transmit the contribution) under the following conditions: 1. they must attribute the contribution in the manner specified by the author or licensor, 2. they may alter, transform, or build upon this work, 3. they may use this contribution for commercial purposes.
4. Rights of Authors
Authors retain the following rights:
- copyright, and other proprietary rights relating to the article, such as patent rights,
- the right to use the substance of the article in own future works, including lectures and books,
- the right to reproduce the article for own purposes, provided the copies are not offered for sale,
- the right to self-archive the article
- the right to supervision over the integrity of the content of the work and its fair use.
5. Co-Authorship
If the article was prepared jointly with other authors, the signatory of this form warrants that he/she has been authorized by all co-authors to sign this agreement on their behalf, and agrees to inform his/her co-authors of the terms of this agreement.
6. Termination
This agreement can be terminated by the author or the Journal Owner upon two months’ notice where the other party has materially breached this agreement and failed to remedy such breach within a month of being given the terminating party’s notice requesting such breach to be remedied. No breach or violation of this agreement will cause this agreement or any license granted in it to terminate automatically or affect the definition of the Journal Owner. The author and the Journal Owner may agree to terminate this agreement at any time. This agreement or any license granted in it cannot be terminated otherwise than in accordance with this section 6. This License shall remain in effect throughout the term of copyright in the Work and may not be revoked without the express written consent of both parties.
7. Royalties
This agreement entitles the author to no royalties or other fees. To such extent as legally permissible, the author waives his or her right to collect royalties relative to the article in respect of any use of the article by the Journal Owner or its sublicensee.
8. Miscellaneous
The Journal Owner will publish the article (or have it published) in the Journal if the article’s editorial process is successfully completed and the Journal Owner or its sublicensee has become obligated to have the article published. Where such obligation depends on the payment of a fee, it shall not be deemed to exist until such time as that fee is paid. The Journal Owner may conform the article to a style of punctuation, spelling, capitalization and usage that it deems appropriate. The Journal Owner will be allowed to sublicense the rights that are licensed to it under this agreement. This agreement will be governed by the laws of Poland.
By signing this License, Author(s) warrant(s) that they have the full power to enter into this agreement. This License shall remain in effect throughout the term of copyright in the Work and may not be revoked without the express written consent of both parties.
