40
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      A More Efficient Fully Homomorphic Encryption Scheme Based on GSW and DM Schemes

      1 , 1 , 2 , 2
      Security and Communication Networks
      Hindawi Limited

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Achieving both simplicity and efficiency in fully homomorphic encryption (FHE) schemes is important for practical applications. In the simple FHE scheme proposed by Ducas and Micciancio (DM), ciphertexts are refreshed after each homomorphic operation. And ciphertext refreshing has become a major bottleneck for the overall efficiency of the scheme. In this paper, we propose a more efficient FHE scheme with fewer ciphertext refreshings. Based on the DM scheme and another simple FHE scheme proposed by Gentry, Sahai, and Waters (GSW), ciphertext matrix operations and ciphertext vector additions are both applied in our scheme. Compared with the DM scheme, one more homomorphic NOT AND (NAND) operation can be performed on ciphertexts before ciphertext refreshing. Results show that, under the same security parameters, the computational cost of our scheme is obviously lower than that of GSW and DM schemes for a depth-2 binary circuit with NAND gates. And the error rate of our scheme is kept at a sufficiently low level.

          Related collections

          Most cited references14

          • Record: found
          • Abstract: not found
          • Book Chapter: not found

          Fully Homomorphic Encryption over the Integers

            Bookmark
            • Record: found
            • Abstract: not found
            • Book Chapter: not found

            Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Internet of things forensics: Recent advances, taxonomy, requirements, and open challenges

                Bookmark

                Author and article information

                Journal
                Security and Communication Networks
                Security and Communication Networks
                Hindawi Limited
                1939-0114
                1939-0122
                December 16 2018
                December 16 2018
                : 2018
                : 1-14
                Affiliations
                [1 ]Beijing Laboratory of Advanced Information Networks, Beijing University of Posts and Telecommunications, Beijing 100876, China
                [2 ]Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, Beijing 100876, China
                Article
                10.1155/2018/8706940
                d8db69ae-86f7-48f8-a702-42e5735dcbba
                © 2018

                http://creativecommons.org/licenses/by/4.0/

                History

                Comments

                Comment on this article