Bibliographies thématiques / Somewhat homomorphic encryption / Articles de revues

Articles de revues sur le sujet « Somewhat homomorphic encryption »

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Somewhat homomorphic encryption.
Auteur : Grafiati
Publié le 14 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 30 meilleurs articles de revues pour votre recherche sur le sujet « Somewhat homomorphic encryption ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les articles de revues sur diverses disciplines et organisez correctement votre bibliographie.

1

Yang, Jing, Mingyu Fan, Guangwei Wang et Zhiyin Kong. « Simulation Study Based on Somewhat Homomorphic Encryption ». Journal of Computer and Communications 02, no 02 (2014) : 109–11. http://dx.doi.org/10.4236/jcc.2014.22019.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Kosieradzki, Shane, Xiaofeng Zhao, Hiroaki Kawase, Yingxin Qiu, Kiminao Kogiso et Jun Ueda. « Secure Teleoperation Control Using Somewhat Homomorphic Encryption ». IFAC-PapersOnLine 55, no 37 (2022) : 593–600. http://dx.doi.org/10.1016/j.ifacol.2022.11.247.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Sun, Xiaoqiang, Ting Wang, Zhiwei Sun, Ping Wang, Jianping Yu et Weixin Xie. « An Efficient Quantum Somewhat Homomorphic Symmetric Searchable Encryption ». International Journal of Theoretical Physics 56, no 4 (12 janvier 2017) : 1335–45. http://dx.doi.org/10.1007/s10773-017-3275-0.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Jung Hee Cheon et Jinsu Kim. « A Hybrid Scheme of Public-Key Encryption and Somewhat Homomorphic Encryption ». IEEE Transactions on Information Forensics and Security 10, no 5 (mai 2015) : 1052–63. http://dx.doi.org/10.1109/tifs.2015.2398359.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Mikuš, Michal. « Experiments with the Plaintext Space in Gentry’S Somewhat Homomorphic Scheme ». Tatra Mountains Mathematical Publications 53, no 1 (1 décembre 2012) : 147–54. http://dx.doi.org/10.2478/v10127-012-0044-6.

Texte intégral
Résumé :
ABSTRACT In this paper we propose an improvement of the implementation of the original Gentry-Halevi somewhat homomorphic scheme. We suggest to choose a bigger plaintext space, by changing the underlying ideal from I = (2) to I = (p) for some bigger prime p. Our analysis shows that bigger plaintext space will improve the homomorphic computation of the somewhat homomorphic scheme while it only slightly increases the complexity of the key generation procedure. The encryption and decryption functions have the same complexity. We provide also some experimental computations that support the analysis.
Styles APA, Harvard, Vancouver, ISO, etc.
6

杨, 竞. « A Proof Based on the Somewhat Homomorphic Encryption Scheme ». Software Engineering and Applications 02, no 02 (2013) : 43–46. http://dx.doi.org/10.12677/sea.2013.22008.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Subramaniyaswamy, V., V. Jagadeeswari, V. Indragandhi, Rutvij H. Jhaveri, V. Vijayakumar, Ketan Kotecha et Logesh Ravi. « Somewhat Homomorphic Encryption : Ring Learning with Error Algorithm for Faster Encryption of IoT Sensor Signal-Based Edge Devices ». Security and Communication Networks 2022 (24 février 2022) : 1–10. http://dx.doi.org/10.1155/2022/2793998.

Texte intégral
Résumé :
In recent years, Homomorphic Encryption (HE) has shown the possibility of securely running a computation arbitrarily without performing the data decryption. Many authors have shown Somewhat Homomorphic Encryption (SHE) or Fully Homomorphic Encryption (FHE) schemes implemented practically on both the addition and multiplication operations for SHE. The recent methods for implementing the FHE methods completely depend on arbitrarily reducing the time taken to perform the encrypted multiplication operation to increase the computation power required by SHE methods. This paper aims to accelerate the encryption primitives in an integer-based SHE based on the duration between each data transmission from the sensor and data packaging method. If the number of sensors increases exponentially in an edge device environment, the signals have to be encrypted faster in a packed mode in the edge environment and transferred to the cloud without a loss in data. The presented SHE method reduces the time taken for encryption based on the input number from the sensor and invariably increases the performance of the edge device. This advantage also helps the deploying healthcare application obtain end-to-end privacy in transmitting sensitive patient data.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Bozduman, Hanife Çağıl, et Erkan Afacan. « Simulation of a Homomorphic Encryption System ». Applied Mathematics and Nonlinear Sciences 5, no 1 (10 avril 2020) : 479–84. http://dx.doi.org/10.2478/amns.2020.1.00046.

Texte intégral
Résumé :
AbstractCryptology is defined as the science of making communication incomprehensible to third parties who have no right to read and understand the data or messages. Cryptology consists of two parts, namely, cryptography and cryptanalysis. Cryptography analyzes methods of encrypting messages, and cryptanalysis analyzes methods of decrypting encrypted messages. Encryption is the process of translating plaintext data into something that appears to be random and meaningless. Decryption is the process of converting this random text into plaintext. Cloud computing is the legal transfer of computing services over the Internet. Cloud services let individuals and businesses to use software and hardware resources at remote locations. Widespread use of cloud computing raises the question of whether it is possible to delegate the processing of data without giving access to it. However, homomorphic encryption allows performing computations on encrypted data without decryption. In homomorphic encryption, only the encrypted version of the data is given to the untrusted computer to process. The computer will perform the computation on this encrypted data, without knowing anything on its real value. Finally, it will send back the result, and whoever has the proper deciphering key can decrypt the cryptogram correctly. The decrypted result will be equal to the intended computed value. In this paper, homomorphic encryption and their types are reviewed. Also, a simulation of somewhat homomorphic encryption is examined.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Saha, Tushar Kanti, Mayank Rathee et Takeshi Koshiba. « Efficient private database queries using ring-LWE somewhat homomorphic encryption ». Journal of Information Security and Applications 49 (décembre 2019) : 102406. http://dx.doi.org/10.1016/j.jisa.2019.102406.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Yasuda, Masaya, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama et Takeshi Koshiba. « New packing method in somewhat homomorphic encryption and its applications ». Security and Communication Networks 8, no 13 (12 janvier 2015) : 2194–213. http://dx.doi.org/10.1002/sec.1164.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
11

Chen, Hu, Yupu Hu, Zhizhu Lian, Huiwen Jia et Xu An Wang. « An Additively Homomorphic Encryption over Large Message Space ». International Journal of Information Technology and Web Engineering 10, no 3 (juillet 2015) : 82–102. http://dx.doi.org/10.4018/ijitwe.2015070106.

Texte intégral
Résumé :
Fully homomorphic encryption schemes available are not efficient enough to be practical, and a number of real-world applications require only that a homomorphic encryption scheme is somewhat homomorphic, even additively homomorphic and has much larger message space for efficiency. An additively homomorphic encryption scheme based heavily on Smart-Vercauteren encryption scheme (SV10 scheme, PKC 2010) is put forward, where both schemes each work with two ideals I and J. As a contribution of independent interest, a two-element representation of the ideal I is given and proven by factoring prime numbers in a number field. This two-element representation serves as the public key. The authors' scheme allows working over much larger message space than that of SV10 scheme by selecting the ideal I with larger decryption radius to generate public/private key pair, instead of choosing the ideal J as done in the SV10 scheme. The correctness and security of the scheme are shown, followed by setting parameters and computational results. The results indicate that this construction has much larger message space than SV10 scheme.
Styles APA, Harvard, Vancouver, ISO, etc.
12

Wei, Zhang. « A Pairing-based Homomorphic Encryption Scheme for Multi-User Settings ». International Journal of Technology and Human Interaction 12, no 2 (avril 2016) : 72–82. http://dx.doi.org/10.4018/ijthi.2016040106.

Texte intégral
Résumé :
A new method is presented to privately outsource computation of different users. As a significant cryptographic primitive in cloud computing, homomorphic encryption (HE) can evaluate on ciphertext directly without decryption, thus avoid information leakage. However, most of the available HE schemes are single-user, which means that they could only evaluate on ciphertexts encrypted by the same public key. Adopting the idea of proxy re-encryption, and focusing on the compatibility of computation, the authors provide a pairing-based multi-user homomorphic encryption scheme. The scheme is a somewhat homomorphic one, which can do infinite additions and one multiplication operation. Security of the scheme is based on subgroup decision problem. The authors give a concrete security model and detailed security analysis.
Styles APA, Harvard, Vancouver, ISO, etc.
13

Duong, Dung Hoang, Pradeep Kumar Mishra et Masaya Yasuda. « Efficient Secure Matrix Multiplication Over LWE-Based Homomorphic Encryption ». Tatra Mountains Mathematical Publications 67, no 1 (1 septembre 2016) : 69–83. http://dx.doi.org/10.1515/tmmp-2016-0031.

Texte intégral
Résumé :
Abstract Homomorphic encryption enables various calculations while preserving the data confidentiality. In this paper, we apply the somewhat homomorphic encryption scheme proposed by Brakerski and Vaikuntanathan (CRYPTO 2011) to secure matrix multiplication between two matrices. To reduce both the ciphertext size and the computation cost, we propose a new method to pack a matrix into a single ciphertexts so that it also enables efficient matrix multiplication over the packed ciphertexts. Our packing method generalizes Yasuda et al.’s methods (Security Comm. Networks 2015 and ACISP 2015), which are for secure inner product. We also implement our methods and give a comparison with previous packing methods.
Styles APA, Harvard, Vancouver, ISO, etc.
14

Xiong, Lizhi, Danping Dong, Zhihua Xia et Xianyi Chen. « High-Capacity Reversible Data Hiding for Encrypted Multimedia Data With Somewhat Homomorphic Encryption ». IEEE Access 6 (2018) : 60635–44. http://dx.doi.org/10.1109/access.2018.2876036.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
15

Khamsemanan, Nirattaya, Rafail Ostrovsky et William E. Skeith. « On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols ». SIAM Journal on Discrete Mathematics 30, no 1 (janvier 2016) : 266–95. http://dx.doi.org/10.1137/110858835.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
16

Fauzi, Prastudy, Martha Norberg Hovd et Håvard Raddum. « On the IND-CCA1 Security of FHE Schemes ». Cryptography 6, no 1 (17 mars 2022) : 13. http://dx.doi.org/10.3390/cryptography6010013.

Texte intégral
Résumé :
Fully homomorphic encryption (FHE) is a powerful tool in cryptography that allows one to perform arbitrary computations on encrypted material without having to decrypt it first. There are numerous FHE schemes, all of which are expanded from somewhat homomorphic encryption (SHE) schemes, and some of which are considered viable in practice. However, while these FHE schemes are semantically (IND-CPA) secure, the question of their IND-CCA1 security is much less studied, and we therefore provide an overview of the IND-CCA1 security of all acknowledged FHE schemes in this paper. To give this overview, we grouped the SHE schemes into broad categories based on their similarities and underlying hardness problems. For each category, we show that the SHE schemes are susceptible to either known adaptive key recovery attacks, a natural extension of known attacks, or our proposed attacks. Finally, we discuss the known techniques to achieve IND-CCA1-secure FHE and SHE schemes. We concluded that none of the proposed schemes were IND-CCA1-secure and that the known general constructions all had their shortcomings.
Styles APA, Harvard, Vancouver, ISO, etc.
17

Boulila, Wadii, Manel Khazri Khlifi, Adel Ammar, Anis Koubaa, Bilel Benjdira et Imed Riadh Farah. « A Hybrid Privacy-Preserving Deep Learning Approach for Object Classification in Very High-Resolution Satellite Images ». Remote Sensing 14, no 18 (16 septembre 2022) : 4631. http://dx.doi.org/10.3390/rs14184631.

Texte intégral
Résumé :
Deep learning (DL) has shown outstanding performances in many fields, including remote sensing (RS). DL is turning into an essential tool for the RS research community. Recently, many cloud platforms have been developed to provide access to large-scale computing capacity, consequently permitting the usage of DL architectures as a service. However, this opened the door to new challenges associated with the privacy and security of data. The RS data used to train the DL algorithms have several privacy requirements. Some of them need a high level of confidentiality, such as satellite images related to public security with high spatial resolutions. Moreover, satellite images are usually protected by copyright, and the owner may strictly refuse to share them. Therefore, privacy-preserving deep learning (PPDL) techniques are a possible solution to this problem. PPDL enables training DL on encrypted data without revealing the original plaintext. This study proposes a hybrid PPDL approach for object classification for very-high-resolution satellite images. The proposed encryption scheme combines Paillier homomorphic encryption (PHE) and somewhat homomorphic encryption (SHE). This combination aims to enhance the encryption of satellite images while ensuring a good runtime and high object classification accuracy. The method proposed to encrypt images is maintained through the public keys of PHE and SHE. Experiments were conducted on real-world high-resolution satellite images acquired using the SPOT6 and SPOT7 satellites. Four different CNN architectures were considered, namely ResNet50, InceptionV3, DenseNet169, and MobileNetV2. The results showed that the loss in classification accuracy after applying the proposed encryption algorithm ranges from 2% to 3.5%, with the best validation accuracy on the encrypted dataset reaching 92%.
Styles APA, Harvard, Vancouver, ISO, etc.
18

Wamser, Markus Stefan, Stefan Rass et Peter Schartner. « Oblivious Lookup-Tables ». Tatra Mountains Mathematical Publications 67, no 1 (1 septembre 2016) : 191–203. http://dx.doi.org/10.1515/tmmp-2016-0039.

Texte intégral
Résumé :
Abstract Evaluating arbitrary functions on encrypted data is one of the holy grails of cryptography, with Fully Homomorphic Encryption (FHE) being probably the most prominent and powerful example. FHE, in its current state is, however, not efficient enough for practical applications. On the other hand, simple homomorphic and somewhat homomorphic approaches are not powerful enough to support arbitrary computations. We propose a new approach towards a practicable system for evaluating functions on encrypted data. Our approach allows to chain an arbitrary number of computations, which makes it more powerful than existing efficient schemes. As with basic FHE we do not encrypt or in any way hide the function, that is evaluated on the encrypted data. It is, however, sufficient that the function description is known only to the evaluator. This situation arises in practice for software as a Software as a Service (SaaS)-scenarios, where an evaluator provides a function only known to him and the user wants to protect his data. Another application might be the analysis of sensitive data, such as medical records. In this paper we restrict ourselves to functions with only one input parameter, which allow arbitrary transformations on encrypted data.
Styles APA, Harvard, Vancouver, ISO, etc.
19

Xiong, Lizhi, et Danping Dong. « Reversible data hiding in encrypted images with somewhat homomorphic encryption based on sorting block-level prediction-error expansion ». Journal of Information Security and Applications 47 (août 2019) : 78–85. http://dx.doi.org/10.1016/j.jisa.2019.04.005.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
20

Lawrence, Jinsha. « Shortest Distance Queries on Encrypted Graph Data Based on GENOA ». International Journal for Research in Applied Science and Engineering Technology 10, no 1 (31 janvier 2022) : 911–17. http://dx.doi.org/10.22214/ijraset.2022.39876.

Texte intégral
Résumé :
Abstract: In the execution time of the nearest distance queries, which means shortest distance queries on the encrypted graph data that stored in external storage like cloud storage, in previous scheme there are some challenges as how to figure the accurate shortest distance in efficient and secure way. In previous work a novel scheme of Somewhat Homomorphic Encryption (SWHE) is implemented to overcome the issues mentioned above and this SWHE is used for encryption. The SWHE will encrypt the output values (shortest distance) by 2-hop cover labeling (2HCL). The storage space of this SWHE is not sufficient for the data owner and it mostly gives the negative results and very low efficient. So, to provide the best efficient, accurate result and better storage for data owner a new novel scheme is implemented in this paper. A new proposed scheme called Graph Encryption scheme for shortest distance queries (GENOA) and the 2HCL index is also implemented. This GENOA is for execution of the shortest distance queries of graph data, this proposed scheme is highly efficient, and give the accurate result as per the queries. This new scheme help in storage and security also. Index Terms: Graph encryption; 2-hop cover labelling; Graph Encryption scheme for shortest distance queries (GENOA); Shortest distance queries.
Styles APA, Harvard, Vancouver, ISO, etc.
21

Wang, Jiafan, et Sherman S. M. Chow. « Forward and Backward-Secure Range-Searchable Symmetric Encryption ». Proceedings on Privacy Enhancing Technologies 2022, no 1 (20 novembre 2021) : 28–48. http://dx.doi.org/10.2478/popets-2022-0003.

Texte intégral
Résumé :
Abstract Dynamic searchable symmetric encryption (DSSE) allows a client to query or update an outsourced encrypted database. Range queries are commonly needed. Previous range-searchable schemes either do not support updates natively (SIGMOD’16) or use file indexes of many long bit-vectors for distinct keywords, which only support toggling updates via homomorphically flipping the presence bit. (ESORICS’18). We propose a generic upgrade of any (inverted-index) DSSE to support range queries (a.k.a. range DSSE), without homomorphic encryption, and a specific instantiation with a new trade-off reducing client-side storage. Our schemes achieve forward security, an important property that mitigates file injection attacks. Moreover, we identify a variant of injection attacks against the first somewhat dynamic scheme (ESORICS’18). We also extend the definition of backward security to range DSSE and show that our schemes are compatible with a generic upgrade of backward security (CCS’17). We comprehensively analyze the computation and communication overheads, including implementation details of client-side index-related operations omitted by prior schemes. We show high empirical efficiency for million-scale databases over a million-scale keyword space.
Styles APA, Harvard, Vancouver, ISO, etc.
22

Utsunomiya, Yasuhito, Kentaroh Toyoda et Iwao Sasase. « LPCQP : Lightweight Private Circular Query Protocol with Divided POI-table and Somewhat Homomorphic Encryption for Privacy-Preserving k-NN Search ». Journal of Information Processing 24, no 1 (2016) : 109–22. http://dx.doi.org/10.2197/ipsjjip.24.109.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
23

Saha, Tushar Kanti, et Takeshi Koshiba. « Efficient Private Conjunctive Query Protocol Over Encrypted Data ». Cryptography 5, no 1 (18 janvier 2021) : 2. http://dx.doi.org/10.3390/cryptography5010002.

Texte intégral
Résumé :
Conjunctive queries play a key role in retrieving data from a database. In a database, a query containing many conditions in its predicate, connected by an “and/&/∧” operator, is called a conjunctive query. Retrieving the outcome of a conjunctive query from thousands of records is a heavy computational task. Private data access to an outsourced database is required to keep the database secure from adversaries; thus, private conjunctive queries (PCQs) are indispensable. Cheon, Kim, and Kim (CKK) proposed a PCQ protocol using search-and-compute circuits in which they used somewhat homomorphic encryption (SwHE) for their protocol security. As their protocol is far from being able to be used practically, we propose a practical batch private conjunctive query (BPCQ) protocol by applying a batch technique for processing conjunctive queries over an outsourced database, in which both database and queries are encoded in binary format. As a main technique in our protocol, we develop a new data-packing method to pack many data into a single polynomial with the batch technique. We further enhance the performances of the binary-encoded BPCQ protocol by replacing the binary encoding with N-ary encoding. Finally, we compare the performance to assess the results obtained by the binary-encoded BPCQ protocol and the N-ary-encoded BPCQ protocol.
Styles APA, Harvard, Vancouver, ISO, etc.
24

Tan, Si-Hui, Yingkai Ouyang et Peter P. Rohde. « Practical somewhat-secure quantum somewhat-homomorphic encryption with coherent states ». Physical Review A 97, no 4 (5 avril 2018). http://dx.doi.org/10.1103/physreva.97.042308.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
25

Badawi, Ahmad Al, Bharadwaj Veeravalli, Chan Fook Mun et Khin Mi Mi Aung. « High-Performance FV Somewhat Homomorphic Encryption on GPUs : An Implementation using CUDA ». IACR Transactions on Cryptographic Hardware and Embedded Systems, 8 mai 2018, 70–95. http://dx.doi.org/10.46586/tches.v2018.i2.70-95.

Texte intégral
Résumé :
Homomorphic encryption (HE) offers great capabilities that can solve a wide range of privacy-preserving computing problems. This tool allows anyone to process encrypted data producing encrypted results that only the decryption key’s owner can decrypt. Although HE has been realized in several public implementations, its performance is quite demanding. The reason for this is attributed to the huge amount of computation required by secure HE schemes. In this work, we present a CUDAbased implementation of the Fan and Vercauteren (FV) Somewhat HomomorphicEncryption (SHE) scheme. We demonstrate several algebraic tools such as the Chinese Remainder Theorem (CRT), Residual Number System (RNS) and Discrete Galois Transform (DGT) to accelerate and facilitate FV computation on GPUs. We also show how the entire FV computation can be done on GPU without multi-precision arithmetic. We compare our GPU implementation with two mature state-of-the-art implementations: 1) Microsoft SEAL v2.3.0-4 and 2) NFLlib-FV. Our implementation outperforms them and achieves on average 5.37x, 7.37x, 22.22x, 5.11x and 13.18x (resp. 2.03x, 2.94x, 27.86x, 8.53x and 18.69x) for key generation, encryption, decryption, homomorphic addition and homomorphic multiplication against SEAL-FVRNS (resp. NFLlib-FV).
Styles APA, Harvard, Vancouver, ISO, etc.
26

Yasuda, Masaya, Takeshi Shimoyama et Jun Kogure. « Secret computation of purchase history data using somewhat homomorphic encryption ». Pacific Journal of Mathematics for Industry 6, no 1 (14 octobre 2014). http://dx.doi.org/10.1186/s40736-014-0005-x.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
27

Migliore, Vincent, Guillaume Bonnoron et Caroline Fontaine. « Practical Parameters for Somewhat Homomorphic Encryption (SHE) Schemes on Binary Circuits ». IEEE Transactions on Computers, 2018, 1. http://dx.doi.org/10.1109/tc.2018.2808962.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
28

Rauthan, J. S. « Fully homomorphic encryption : A case study ». Journal of Intelligent & ; Fuzzy Systems, 17 septembre 2022, 1–21. http://dx.doi.org/10.3233/jifs-221454.

Texte intégral
Résumé :
Fully Homomorphic Encryption (FHE) is the holy grail of encrypted communications. It opens the door to several advanced functionalities to overcome the security and trust issues of the IT world. After 2009, once Craig Gentry had shown that FHE could be achieved, a study in this field boomed, and significant improvement was made in identifying more efficient and realistic programs. FHE is primitive cryptography that enables arbitrary functions to be calculated via encrypted data. These systems are applicable in different ways since they permit users to encrypt their private information securely while still outsourcing the processing of protected data without fearing disclosing the real data. In 2012, LTV12 presented the first multi-key FHE system and demonstrated the possibility of using multi-key systems in somewhat homomorphic encryption (SHE). Like in the one key context, there have been many advances in the field, but no effort has been made to develop the multi-key methods. This paper presents a discussion of FHE and MKFHE with a specific focus on the current techniques and three implementations, comprising the first in the multi-key setups, to the extent of our understanding.
Styles APA, Harvard, Vancouver, ISO, etc.
29

Yasuda, Masaya, Kazuhiro Yokoyama, Takeshi Shimoyama, Jun Kogure et Takeshi Koshiba. « On the exact decryption range for Gentry–Halevi's implementation of fully homomorphic encryption ». Journal of Mathematical Cryptology 8, no 3 (1 janvier 2014). http://dx.doi.org/10.1515/jmc-2013-0024.

Texte intégral
Résumé :
AbstractIn this paper, we revisit the fully homomorphic encryption (FHE) scheme implemented by Gentry and Halevi, which is just an instantiation of Gentry's original scheme based on ideal lattices. Their FHE scheme starts from a somewhat homomorphic encryption (SHE) scheme, and its decryption range is deeply related with the FHE construction. Gentry and Halevi gave an experimental evaluation of the decryption range, but theoretical evaluations have not been given so far. Moreover, we give a theoretical upper bound, and reconsider suitable parameters for theoretically obtaining an FHE scheme. In particular, while Gentry and Halevi use the Euclidean norm evaluation in the noise management of ciphertexts, our theoretical bound enables us to use the ∞-norm evaluation, and hence it helps to lower the difficulty of controlling the noise density of ciphertexts.
Styles APA, Harvard, Vancouver, ISO, etc.
30

Jin, Xin, Hongyu Zhang, Xiaodong Li, Haoyang Yu, Beisheng Liu, Shujiang Xie, Amit Kumar Singh et Yujie Li. « Confused Modulo Projection based Somewhat Homomorphic Encryption -Cryptosystem, Library and Applications on Secure Smart Cities ». IEEE Internet of Things Journal, 2021, 1. http://dx.doi.org/10.1109/jiot.2020.3015032.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie