检索结果-南通市图书馆

Secure Scheme for Locating Disease-Causing Genes Based on Multi-key Homomorphic encryption

Tsinghua Science and Technology 2022年第2期27卷 333-343页

作者： Tanping Zhou Wenchao Liu Ningbo Li Xiaoyuan Yang Yiliang Han Shangwen Zheng Tanping Zhou is with the College of Cryptography Engineering Engineering University of People’s Armed PoliceXi’an 710086China TCA Laboratory State Key Laboratory of Computer ScienceInstitute of SoftwareChinese Academy of SciencesBeijing 100080China the College of Cryptography Engineering Engineering University of People’s Armed PoliceXi’an 710086China the People’s Armed Police Command College China Tianjin 300100China

Genes have great significance for the prevention and treatment of some diseases.A vital consideration is the need to find a way to locate pathogenic genes by analyzing the genetic data obtained from different medical institutions while protecting the privacy of patients’genetic *** this paper,we present a secure scheme for locating disease-causing genes based on Multi-key Homomorphic encryption(MKHE),which reduces the risk of leaking genetic ***,we combine MKHE with a frequency-based pathogenic gene location *** medical institutions use MKHE to encrypt their genetic *** cloud then homomorphically evaluates specific gene-locating circuits on the encrypted genetic ***,whereas most location circuits are designed only for locating monogenic diseases,we propose two location circuits(TH-intersection and Top-q)that can locate the disease-causing genes of polygenic ***,we construct a directed decryption protocol in which the users involved in the homomorphic evaluation can appoint a target user who can obtain the final decryption *** experimental results show that compared to the JWB+17 scheme published in the journal Science,our scheme can be used to diagnose polygenic diseases,and the participants only need to upload their encrypted genetic data once,which reduces the communication traffic by a few hundred-fold.

关键词： public key encryption Multi-key Homomorphic encryption(MKHE) fully homomorphic encryption disease-causing genes secure location of disease-causing genes

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A Fully Homomorphic encryption Scheme with Better key Size

引用

China Communications 2014年第9期11卷 82-92页

作者： CHEN Zhigang WANG Jian ZHANG ZengNian SONG Xinxia College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 210016 P.R. China College of Computer and Information Zhejiang Wanli University Zhejiang NingBo 315100 P.R. China Faculty of Electronic and Information Engineering Zhejiang Wanli University Zhejiang NingBo 315100 RR. China. College of Junior. Zhejiang Wanli University Zhejiang Ningbo 31510 P.R.China Information Security Group Royal Holloway University of LondonUK.

Fully homomorphic encryption is faced with two problems now. One is candidate fully homomorphic encryption schemes are few. Another is that the efficiency of fully homomorphic encryption is a big question. In this paper, we propose a fully homomorphic encryption scheme based on LWE, which has better key size. Our main contributions are：（1） According to the binary-LWE recently, we choose secret key from binary set and modify the basic encryption scheme proposed in Linder and Peikert in 2010. We propose a fully homomorphic encryption scheme based on the new basic encryption scheme. We analyze the correctness and give the proof of the security of our scheme. The public key, evaluation keys and tensored ciphertext have better size in our scheme. （2） Estimating parameters for fully homomorphic encryption scheme is an important work. We estimate the concert parameters for our scheme. We compare these parameters between our scheme and Bral2 scheme. Our scheme have public key and private key that smaller by a factor of about logq than in Bral2 scheme. Tensored ciphertext in our scheme is smaller by a factor of about log2q than in Bral2 scheme. key switching matrix in our scheme is smaller by a factor of about log3q than in Bra12 scheme.

关键词： fully homomorphic encryption public key encryption learning with error concert parameters

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Cryptanalysis of public key Cryptosystems Based on Non-Abelian Factorization Problems

引用

Tsinghua Science and Technology 2016年第3期21卷 344-351页

作者： Jinhui Liu Aiwan Fan Jianwei Jia Huanguo Zhang Houzhen Wang Shaowu Mao Computer School of Wuhan University Wuhan 430072China Computer School of Pingdingshan University Pingdingshan 467001China

Advances in quantum computers threaten to break public-key cryptosystems （e.g., RSA, ECC, and EIGamal）, based on the hardness of factoring or taking a discrete logarithm. However, no quantum algorithms have yet been found for solving certain mathematical problems in non-commutative algebraic structures. Recently, two novel public-key encryption schemes, BKT-B cryptosystem and BKT-FO cryptosystem, based on factorization problems have been proposed at Security and Communication Networks in 2013. In this paper we show that these two schemes are vulnerable to structural attacks and linearization equations attacks, and that they only require polynomial time complexity to obtain messages from associated public keys. We conduct a detailed analysis of the two attack methods and show corresponding algorithmic descriptions and efficiency analyses. In addition, we provide some improvement suggestions for the two public-key encryption schemes.

关键词： cryptography post-quantum cryptography public key encryption cryptanalysis linear equations

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Generative Trapdoors for public key Cryptography Based on Automatic Entropy Optimization

引用

China Communications 2021年第8期18卷 35-46页

作者： Shuaishuai Zhu Yiliang Han College of Cryptography Engineering Engineering University of People’s Armed PoliceXi’an 710086China key Laboratory of Network and Information Security under the People’s Armed Police Xi’an 710086China

Trapdoor is a key component of public key cryptography design which is the essential security foundation of modern ***,the traditional way in designing a trapdoor is to identify a computationally hard problem,such as the NPC *** the trapdoor in a public key encryption mechanism turns out to be a type of limited *** this paper,we generalize the methodology of adversarial learning model in artificial intelligence and introduce a novel way to conveniently obtain sub-optimal and computationally hard trapdoors based on the automatic information theoretic search *** basic routine is constructing a generative architecture to search and discover a probabilistic reversible generator which can correctly encoding and decoding any input *** architecture includes a trapdoor generator built on a variational autoencoder(VAE)responsible for searching the appropriate trapdoors satisfying a maximum of entropy,a random message generator yielding random noise,and a dynamic classifier taking the results of the two *** evaluation of our construction shows the architecture satisfying basic indistinguishability of outputs under chosen-plaintext attack model(CPA)and high efficiency in generating cheap trapdoors.

关键词： generative model public key encryption indistinguishability model security model deep learning

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Identity-Based encryption with keyword Search from Lattice Assumption

引用

China Communications 2018年第4期15卷 164-178页

作者： Xiaojun Zhang Chunxiang Xu Liming Mu Jie Zhao School of Computer Science Southwest Petroleum UniversityChengdu 610500China School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China

public key encryption scheme with keyword search （PEKS） enables us to search the encrypted data in a cloud server with a keyword, and no one can obtain any infor- mation about the encrypted data without the trapdoor corresponding to the keyword. The PEKS is useful to keep the management of large data storages secure such as those in a cloud. In this paper, to protect against quantum computer attacks, we present a lattice-based identity-based encryption scheme with key- word search. We have proved that our scheme can achieve ciphertext indistinguishability in the random oracle model, and our scheme can also achieve trapdoor security. In particular, our scheme can designate a unique tester to test and return the search results, therefore it does not need a secure channel. To the best of our knowledge, our scheme is the first iden- tity-based encryption scheme with keyword search from lattice assumption.

关键词： public key encryption keywordsearch ciphertext indistinguishability latticeassumption.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

The Gap between Intractable Problem and Adaptive Chosen Ciphertext Security

引用

Journal of Shanghai Jiaotong university(Science) 2009年第1期14卷 90-93页

作者：路献辉来学嘉何大可 School of Information Science and Technology Southwest Jiaotong UniversityChengdu 610031China Department of Computer Science and Engineering Shanghai Jiaotong UniversityShanghai 200240China

To describe the design approaches of IND-CCA2 （adaptive chosen ciphertext attack） secure public key encryption schemes systematically, the gaps between different kinds of intractable problems and IND-CCA2 security are studied. This paper points out that the construction of IND-CCA2 secure schemes is essentially to bridge these gaps. These gaps are categorized, analyzed and measured. Finally the methods to bridge these gaps are described. This explains the existing design approaches and gives an intuition about the difficulty of designing IND-CCA2 secure public key encryption schemes based on different types of assumptions.

关键词： public key encryption adaptive chosen ciphertext security intractable vroblem

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Dynamic Broadcast encryption Scheme with Revoking User

引用

Wuhan University Journal of Natural Sciences 2013年第6期18卷 499-503页

作者： ZOU Xiubin XIANG Jinhai College of Computer and Mathematics Jianghan University College of Science Huazhong Agricultural University

Currently, there still lacks an efficient methodology to revoke user＇s ability to decrypt ciphertext in broadcast encryption with the uncertain number of ciphertext recipients. To solve this problem, here, we present a dynamic broadcast encryption scheme with the following properties： First, the length of the ciphertext has a linear relationship with the number of revocable users, but it has no association with the total number of ciphertext recipients. Sec- ond, the scheme also works when users dynamically join. Espe- cially, compared with methods published up to date, our scheme is more efficient with a large number of ciphertext recipients. Third, the broadcaster can revoke user＇s ability to decrypt ciphertext if necessary. Fourth, the private key of users is composed of three elements in Elliptic curve group of prime order. Last, if q-Deci- sional Multi-Exponent Bilinear Diffie-Hellman assumption holds, our scheme is secure in the standard model when a polynomial time adversary selectively attacks it.

关键词： dynamic broadcast encryption revoking user bilin-ear map public key encryption

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：