Filters








1,105 Hits in 3.8 sec

Homomorphic Comparison for Point Numbers with User-Controllable Precision and Its Applications

Heewon Chung, Myungsun Kim, Ahmad Al Badawi, Khin Mi Mi Aung, Bharadwaj Veeravalli
2020 Symmetry  
This work is mainly interested in ensuring users' privacy in asymmetric computing, such as cloud computing.  ...  However, as FHE schemes operate in specific domains, such as that of congruent integers, most FHE-based solutions focus only on homomorphic comparisons of integers.  ...  ., in [2] , developed an approach to encode rational numbers as integers and to perform computations on the encoded rational numbers, secure noninteger computations have received significant attention  ... 
doi:10.3390/sym12050788 fatcat:to53m24blzay5c3khp4r3ua67y

A comparative study of combining deep learning and homomorphic encryption techniques

Emad Alsaedi, Alaa Kadhim
2022 Al-Qadisiyah Journal Of Pure Science  
Deep learning simulation necessitates a considerable amount of internal computational resources and fast training for large amounts of data.  ...  Modern encryption schemes maintain personal secrecy and are the best method for protecting data stored on a server and data sent from an unauthorized third party.  ...  However, there are a limited number of easy operations on rational numbers in deep learning models. Hence their mathematical formulation is complex.  ... 
doi:10.29350/qjps.2022.27.1.1452 fatcat:xg3updgwzfgbnpelqsvd4tagc4

Accelerating Homomorphic Evaluation on Reconfigurable Hardware [chapter]

Thomas Pöppelmann, Michael Naehrig, Andrew Putnam, Adrian Macias
2015 Lecture Notes in Computer Science  
Homomorphic encryption allows computation on encrypted data and makes it possible to securely outsource computational tasks to untrusted environments.  ...  We propose an architecture to accelerate schemes based on the ring learning with errors (RLWE) problem and specifically implemented the somewhat homomorphic encryption scheme YASHE, which was proposed  ...  Decrypt(f , c): Compute [fc] q modulo q, scale it down by t/q over the rational numbers, round it and reduce it modulo t, i.e. output m = t Add(c 1 , c 2 ): Add the two ciphertexts modulo q, i.e. output  ... 
doi:10.1007/978-3-662-48324-4_8 fatcat:bjju6o7pkfejhkvwkvqijjlt4i

High-Performance FV Somewhat Homomorphic Encryption on GPUs: An Implementation using CUDA

Ahmad Al Badawi, Bharadwaj Veeravalli, Chan Fook Mun, Khin Mi Mi Aung
2018 Transactions on Cryptographic Hardware and Embedded Systems  
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.  ...  A common feature in the previous implementations is that only some parts of HE computation, usually polynomial multiplication, run on the hardware accelerator.  ... 
doi:10.13154/tches.v2018.i2.70-95 dblp:journals/tches/BadawiVMA18 fatcat:r3pazuxa5nesnlicqub7mmxmqy

SecureGBM: Secure Multi-Party Gradient Boosting [article]

Zhi Fengy, Haoyi Xiong, Chuanyuan Song, Sijia Yang, Baoxin Zhao, Licheng Wang, Zeyu Chen, Shengwen Yang, Liping Liu, Jun Huan
2019 arXiv   pre-print
In this paper, we proposed a novel Gradient Boosting Machines (GBM) framework SecureGBM built-up with a multi-party computation model based on semi-homomorphic encryption, where every involved party can  ...  than 3% AUC, using the same number of iterations for gradient boosting, on a wide range of benchmark datasets.  ...  of computation are encrypted with homomorphic encryption.  ... 
arXiv:1911.11997v1 fatcat:fexgdbtlw5a4nhnslunrrf6lsq

Logistic regression over encrypted data from fully homomorphic encryption

Hao Chen, Ran Gilad-Bachrach, Kyoohyung Han, Zhicong Huang, Amir Jalali, Kim Laine, Kristin Lauter
2018 BMC Medical Genomics  
Methods: Our solution to this problem has several novelties: we use a multi-bit plaintext space in fully homomorphic encryption together with fixed point number encoding; we combine bootstrapping in fully  ...  Conclusions: We demonstrate the feasibility but high computational cost of training over encrypted data.  ...  Then a fixed point number is a rational number x of the form x = l−1 i=−f x i p i , with x i ∈[ −(p − 1)/2, . . . , (p − 1)/2] ∩Z.  ... 
doi:10.1186/s12920-018-0397-z pmid:30309350 pmcid:PMC6180402 fatcat:lkncb3c6mvcmlf3usn4tjptebm

An Efficient Privacy-Preserving Outsourced Calculation Toolkit With Multiple Keys

Ximeng Liu, Robert H. Deng, Kim-Kwang Raymond Choo, Jian Weng
2016 IEEE Transactions on Information Forensics and Security  
Moreover, encrypted data belonging to multiple users can be processed without compromising on the security of the individual user's (original) data and the final computed results.  ...  We then prove that the proposed EPOM achieves the goal of secure integer number processing without resulting in privacy leakage of data to unauthorized parties.  ...  We can also use GPU [37] , [38] to accelerate the computation.  ... 
doi:10.1109/tifs.2016.2573770 fatcat:uxbkur6u5rcx3o7ijyfkrfe6ca

A Comprehensive Survey on Secure Outsourced Computation and its Applications

Yang Yang, Xindi Huang, XiMeng Liu, Hongju Cheng, Jian Weng, Xiangyang Luo, Victor Chang
2019 IEEE Access  
Then, we focus on the theories and evolution of homomorphic encryption, as well as the applications of the basic operations and application-specific tasks.  ...  INDEX TERMS Secure outsourced computing, privacy preserving, homomorphic encryption, secure outsourced machine learning, data processing.  ...  Similarly, the authors further designed a framework [10] to support basic computations on integer and rational numbers.  ... 
doi:10.1109/access.2019.2949782 fatcat:ternbyhqezgd5cvhtfqfggqdqq

Modular arithmetic and finite field theory

E. Horowitz
1971 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation - SYMSAC '71  
It is simple to compute (a I .... ,a r) from an integer a by means of the division command on any computer.  ...  Though the definition of mod holds when a and b are arbitrary real numbers, from now on we will restrict their values to be integers.  ... 
doi:10.1145/800204.806287 fatcat:dhyhlimhefcshjsgacfnbmptie

seIMC: A GSW-based Secure and Efficient Integer Matrix Computation Scheme with Implementation

Yanan Bai, Xiaoyu Shi, Wenyuan Wu, JingWei Chen, Yong Feng
2020 IEEE Access  
To address these issues, this paper proposes seIMC, an integer matrix computation scheme based on the Gentry-Sahai-Waters (GSW) scheme, to cope with privacy protection and secure computation of large-scale  ...  As atomic operations, secure matrix-based computations using homomorphic encryption (HE) have attracted much attention in cloud-based machine learning.  ...  NOTATIONS We use the symbol Q to denote the set of rational numbers, and R is the set of real numbers, while N and Z are the sets of natural numbers and integers, respectively.  ... 
doi:10.1109/access.2020.2996000 fatcat:sdchqoc3prgjnmvijb4ix56lyq

A privacy protection-oriented parallel fully homomorphic encryption algorithm in cyber physical systems

Zhaoe Min, Geng Yang, Arun Kumar Sangaiah, Shuangjie Bai, Guoxiu Liu
2019 EURASIP Journal on Wireless Communications and Networking  
encryption algorithm, but also meets the requirements for the efficient homomorphic encryption of floating-point numbers in cloud computing environment.  ...  To address this limitation, we propose a parallel fully homomorphic encryption algorithm that supports floating-point numbers.  ...  [44, 45] designed a computation framework and toolkit that support privacy protection, this scheme supports multi-key encryption, and it can be expanded to rational number computation.  ... 
doi:10.1186/s13638-018-1317-9 fatcat:aaj67awz5fadfawuiawjqgleiy

Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization [chapter]

J. Howard Johnson
2011 Lecture Notes in Computer Science  
Access and use of this website and the material on it are subject to the Terms and Conditions set forth at Uniformizing rational relations for natural language applications using weighted determinization  ...  Rational functions (or single-valued finite state transductions) have many applications in natural language processing.  ...  First of all our rational relation expressed in the form of a transducer (Definition 10). Each weight is replaced by its natural homomorphic image in GM(∆ * ).  ... 
doi:10.1007/978-3-642-18098-9_19 fatcat:gilc7k3ufffmxbxyurghgvn52m

SCOR: A secure international informatics infrastructure to investigate COVID-19

J L Raisaro, Francesco Marino, Juan Troncoso-Pastoriza, Raphaelle Beau-Lejdstrom, Riccardo Bellazzi, Robert Murphy, Elmer V Bernstam, Henry Wang, Mauro Bucalo, Yong Chen, Assaf Gottlieb, Arif Harmanci (+22 others)
2020 JAMIA Journal of the American Medical Informatics Association  
We hope our effort will make a change and accelerate research in future pandemics with broad and diverse samples on an international scale.  ...  consortium initiatives, the scientific community still lacks a secure and privacy-preserving infrastructure to support auditable data sharing and facilitate automated and legally compliant federated analysis on  ...  PRIVACY-PRESERVING TECHNOLOGICAL ENABLERS Homomorphic encryption Homomorphic encryption (HE) 16 supports computation on encrypted data (ciphertexts).  ... 
doi:10.1093/jamia/ocaa172 pmid:32918447 pmcid:PMC7454652 fatcat:kol6vnbybvaz5i4sca322kcy4e

Cryptoleq: A Heterogeneous Abstract Machine for Encrypted and Unencrypted Computation

Oleg Mazonka, Nektarios Georgios Tsoutsos, Michail Maniatakos
2016 IEEE Transactions on Information Forensics and Security  
Leveraging the power of encryption, in this paper we introduce Cryptoleq: an abstract machine based on the concept of One Instruction Set Computer, capable of performing general-purpose computation on  ...  The program operands are protected using the Paillier partially homomorphic cryptosystem, which supports addition on the encrypted domain.  ...  Since OISC has only one instruction, it is an attractive choice for homomorphic computations for several reasons.  ... 
doi:10.1109/tifs.2016.2569062 fatcat:n2jztvxbfneaxac73enzkmrqgy

The rational canonical form of a matrix

J. S. Devitt, R. A. Mollin
1986 International Journal of Mathematics and Mathematical Sciences  
The purpose of this paper is to provide an efficient algorithmic means of determining the rational canonical form of a matrix using computational symbolic algebraic manipulation packages, and is in fact  ...  of Fermi acceleration, and computational and numerical methods for exploring these structures and applications are welcome.  ...  The algorithm outlined above for computing the rational canonical form has PERFORCE OF THE ALGORITH.  ... 
doi:10.1155/s0161171286000303 fatcat:y2phw236frgbtgyez7asbandni
« Previous Showing results 1 — 15 out of 1,105 results