secure outsourcing
Recently Published Documents


TOTAL DOCUMENTS

134
(FIVE YEARS 46)

H-INDEX

14
(FIVE YEARS 6)

Sensors ◽  
2021 ◽  
Vol 21 (20) ◽  
pp. 6821
Author(s):  
Mingyang Song ◽  
Yingpeng Sang

Computing the determinant of large matrix is a time-consuming task, which is appearing more and more widely in science and engineering problems in the era of big data. Fortunately, cloud computing can provide large storage and computation resources, and thus, act as an ideal platform to complete computation outsourced from resource-constrained devices. However, cloud computing also causes security issues. For example, the curious cloud may spy on user privacy through outsourced data. The malicious cloud violating computing scripts, as well as cloud hardware failure, will lead to incorrect results. Therefore, we propose a secure outsourcing algorithm to compute the determinant of large matrix under the malicious cloud mode in this paper. The algorithm protects the privacy of the original matrix by applying row/column permutation and other transformations to the matrix. To resist malicious cheating on the computation tasks, a new verification method is utilized in our algorithm. Unlike previous algorithms that require multiple rounds of verification, our verification requires only one round without trading off the cheating detectability, which greatly reduces the local computation burden. Both theoretical and experimental analysis demonstrate that our algorithm achieves a better efficiency on local users than previous ones on various dimensions of matrices, without sacrificing the security requirements in terms of privacy protection and cheating detectability.


2021 ◽  
Author(s):  
Miran Kim ◽  
Su Wang ◽  
Xiaoqian Jiang ◽  
Arif Ozgun Harmanci

Background: Sequencing of thousands of samples provides genetic variants with allele frequencies spanning a very large spectrum and gives invaluable insight for genetic determinants of diseases. Protecting the genetic privacy of participants is challenging as only a few rare variants can easily re-identify an individual among millions. In certain cases, there are policy barriers against sharing genetic data from indigenous populations and stigmatizing conditions. Results: We present SVAT, a method for secure outsourcing of variant annotation and aggregation, which are two basic steps in variant interpretation and detection of causal variants. SVAT uses homomorphic encryption to encrypt the data at the client-side. The data always stays encrypted while it is stored, in-transit, and most importantly while it is analyzed. SVAT makes use of a vectorized data representation to convert annotation and aggregation into efficient vectorized operations in a single framework. Also, SVAT utilizes a secure re-encryption approach so that multiple disparate genotype datasets can be combined for federated aggregation and secure computation of allele frequencies on the aggregated dataset. Conclusions: Overall, SVAT provides a secure, flexible, and practical framework for privacy-aware outsourcing of annotation, filtering, and aggregation of genetic variants. SVAT is publicly available for download from https://github.com/harmancilab/SVAT .


Cell Systems ◽  
2021 ◽  
Author(s):  
Miran Kim ◽  
Arif Ozgun Harmanci ◽  
Jean-Philippe Bossuat ◽  
Sergiu Carpov ◽  
Jung Hee Cheon ◽  
...  

2021 ◽  
pp. 102416
Author(s):  
Yanli Ren ◽  
Xiao Xu ◽  
Guorui Feng ◽  
Xinpeng Zhang

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Mingyang Song ◽  
Yingpeng Sang ◽  
Yuying Zeng ◽  
Shunchao Luo

The efficiency of fully homomorphic encryption has always affected its practicality. With the dawn of Internet of things, the demand for computation and encryption on resource-constrained devices is increasing. Complex cryptographic computing is a major burden for those devices, while outsourcing can provide great convenience for them. In this paper, we firstly propose a generic blockchain-based framework for secure computation outsourcing and then propose an algorithm for secure outsourcing of polynomial multiplication into the blockchain. Our algorithm for polynomial multiplication can reduce the local computation cost to O n . Previous work based on Fast Fourier Transform can only achieve O n log n for the local cost. Finally, we integrate the two secure outsourcing schemes for polynomial multiplication and modular exponentiation into the fully homomorphic encryption using hidden ideal lattice and get an outsourcing scheme of fully homomorphic encryption. Through security analysis, our schemes achieve the goals of privacy protection against passive attackers and cheating detection against active attackers. Experiments also demonstrate our schemes are more efficient in comparisons with the corresponding nonoutsourcing schemes.


Author(s):  
Yerzhan N. Seitkulov ◽  
Seilkhan N. Boranbayev ◽  
Gulden B. Ulyukova ◽  
Banu B. Yergaliyeva ◽  
Dina Satybaldina

We study new methods of secure cloud processing of big data when solving applied computationally-complex problems with secret parameters. This is one of the topical issues of secure client-server communication. As part of our research work, we model the client-server interactions: we give specific definitions of such concepts as “solvable by the protocol”, “secure protocol”, “correct protocol”, as well as actualize the well-known concepts-“active attacks” and “passive attacks”. First, we will outline the theory and methods of secure outsourcing for various abstract equations with secret parameters, and then present the results of using these methods in solving applied problems with secret parameters, arising from the modeling of economic processes. Many economic tasks involve processing a large set of economic indicators. Therefore, we are considering a typical economic problem that can only be solved on very powerful computers.


Sign in / Sign up

Export Citation Format

Share Document