检索结果-南通市图书馆

EMPSI:Efficient multiparty private set intersection(with cardinality)

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2024年第1期18卷 199-213页

作者： Yunbo YANG xiaolei dong zhenfu cao Jiachen SHEN Ruofan LI Yihao YANG Shangmin DOU Shanghai Key Laboratory of Trustworthy Computing East China Normal UniversityShanghai 200062China Kunyao Academy of Shanghai Kunyao Network Technology Co. Ltd.Shanghai 201203China PwC US Advisory Shanghai AC Shanghai 200233China

Multiparty private set intersection(PSI)allows several parties,each holding a set of elements,to jointly compute the intersection without leaking any additional *** the development of cloud computing,PSI has a wide range of applications in privacy ***,it is complex to build an efficient and reliable scheme to protect user *** address this issue,we propose EMPSI,an efficient PSI(with cardinality)protocol in a multiparty *** avoids using heavy cryptographic primitives(mainly rely on symmetric-key encryption)to achieve better *** addition,both PSI and PSI with the cardinality of EMPSI are secure against semi-honest adversaries and allow any number of colluding clients(at least one honest client).We also do experiments to compare EMPSI with some state-of-the-art *** experimental results show that proposed EMPSI(-CA)has better performance and is scalable in the number of clients and the set size.

关键词： intersection cardinal primitive

轻量级多用户可验证隐私保护基因序列分析方案

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

计算机研究与发展 2024年第10期61卷 2448-2466页

作者：胡云舒周俊曹珍富董晓蕾华东师范大学软件工程学院密码与网络安全系上海200062

随着云计算、大数据等新兴网络服务的蓬勃发展,数据要素在智慧医疗、科学研究等领域中占据重要地位.基因组测序技术通过对病人基因组序列进行处理来判断病人的患病原因和类别,在多个领域有广泛应用.由于存储、计算资源受限,本地用户通... 详细信息

随着云计算、大数据等新兴网络服务的蓬勃发展,数据要素在智慧医疗、科学研究等领域中占据重要地位.基因组测序技术通过对病人基因组序列进行处理来判断病人的患病原因和类别,在多个领域有广泛应用.由于存储、计算资源受限,本地用户通常需要租用资源丰富但工作在不可信环境下的云服务器来完成复杂的大规模基因组测序处理函数计算任务.为了保护用户数据隐私及验证计算结果的正确性,国内外现有工作通常的做法是利用公钥全同态加密或安全多方计算技术实现数据隐私保护;利用Yao混淆电路或双线性配对技术实现计算结果的正确性验证.由于密码原语的计算开销和通信开销巨大,均不适用于基因序列分析系统中存储、计算资源受限的本地用户的客观性能需求.为了解决上述挑战性问题,提出了一个轻量级多用户可验证隐私保护基因序列分析方案.首先,构造了一种高效的可验证多密钥同态数据封装机制VMK-HDEM,该方案支持在密文域上对L个不同输入实例的打包计算,用户端Sen_(i)'s公钥加密的使用次数复杂度为O(L),即与其数据集的大小无关,大大降低了资源受限的本地用户的计算开销;在可验证性方面,云服务器生成的密文计算结果正确性验证证据大小复杂度为O(deg_(F))(其中deg_(F)代表外包计算函数的阶),与用户数据集大小无关.然后,基于所构造的新型密码原语VMK-HDEM,设计了一个轻量级高效的可验证隐私保护基因序列分析方案LWPPGS,有效保护了用户基因数据集的隐私和基因序列分析结果的隐私,并高效验证其分析结果的正确性.最后,通过形式化的安全性证明和实验仿真结果表明了所构造方案VMK-HDEM和LWPPGS的安全性和实用性.

关键词：多密钥全同态数据封装机制可验证基因序列分析隐私保护高效性

Privacy-preserving large-scale systems of linear equations in outsourcing storage and computation

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2018年第3期61卷 148-156页

作者： dongmei LI xiaolei dong zhenfu cao Haijiang wang Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai Key Lab of Trustworthy Computing East China Normal University

Along with the prevalence of cloud computing, it can be realised to efficiently outsource costly storage or computations to cloud servers. Recently, secure outsourcing mechanism has received more and more attention. We focus on secure outsourcing storage and computation for large-scale systems of linear equations(LEs) in this paper. Firstly, we construct a new efficient matrix encryption scheme. Then we exploit this encryption scheme to develop a new algorithm which can implement outsourcing storage and computation for large-scale linear equations in the semi-honest setting. Compared with the previous work,the proposed algorithm requires lower storage overhead and is with competitive efficiency.

关键词： cloud computing privacy-preserving linear equations encryption security

EFFICIENT CERTIFICATELESS THRESHOLD SIGNATURES WITHOUT RANDOM ORACLES

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2010年第6期23卷 1167-1182页

作者： Piyi YANG zhenfu cao xiaolei dong Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai 200240 China.

This paper defines the security notion for Certificateless Threshold Signatures （CLTHS）. Different from the adversarial model defined by wang, et al. （2007）, our definition considers Type I and Type II adversary separately. At the same time, the authors develop the simulatability and relationship between certificateless threshold signature and the underlying certificateless signature. We also propose the first CLTHS scheme which is proved existentially unforgeable against adaptively chosen message attack without random oracles. Compared with the previous scheme by wang, et al. （2007）, our scheme does not use hash function and is more efficient.

关键词： Certificateless digital signature key escrow provable security threshold robustness simulatabiltiy.

Secure key-aggregation authorized searchable encryption

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2019年第3期62卷 220-222页

作者： Haijiang wang xiaolei dong zhenfu cao dongmei LI Nanyuan cao School of Information and Electronic Engineering Zhejiang University of Science and Technology Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai Key Lab for Trustworthy Computing East China Normal University

Dear editor,Selective sharing of encrypted documents with other users makes the cloud storage system more flexible and effective [1]. For safety reasons, data owners use different keys to encrypt different documents. ... 详细信息

关键词： MSK ID length

IXT: Improved searchable encryption for multi-word queries based on PSI

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2023年第5期17卷 153-163页

作者： Yunbo YANG xiaolei dong zhenfu cao Jiachen SHEN Shangmin DOU Shanghai Key Laboratory of Trustworthy Computing East China Normal UniversityShanghai 200062China Kunyao Academy of Shanghai Kunyao Network Technology Co. Ltd.Shanghai 200233China PwC US Advisory Shanghai AC Shanghai 201203China

Oblivious Cross-Tags(OXT)[1]is the first efficient searchable encryption(SE)protocol for conjunctive queries in a single-writer single-reader ***,it also has a trade-off between security and efficiency by leaking partial database information to the *** attacks on these SE schemes show that the leakages from these SE schemes can be used to recover the content of queried *** solve this problem,Lai et al.[2]propose Hidden Cross-Tags(HXT),which reduces the access pattern leakage from Keyword Pair Result Pattern(KPRP)to Whole Result Pattern(WRP).However,the WRP leakage can also be used to recover some additional contents of queried *** paper proposes Improved Cross-Tags(IXT),an efficient searchable encryption protocol that achieves access and searches pattern hiding based on the labeled private set *** also prove the proposed labeled private set intersection(PSI)protocol is secure against semi-honest adversaries,and IXT is-semi-honest secure(is leakage function).Finally,we do experiments to compare IXT with *** experimental results show that the storage overhead and computation overhead of the search phase at the client-side in IXT is much lower than those in ***,the experimental results also show that IXT is scalable and can be applied to various sizes of datasets.

关键词： searchable encryption private set intersection

Designing efficient proxy signature schemes for mobile communication

在线全文

学校读者我要写书评

暂无评论

Science in China(Series F) 2008年第2期51卷 183-195页

作者： LU RongXing dong xiaolei cao zhenfu Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200030 China

Proxy signature is an active cryptographic research area, and a wide range of literatures can be found nowadays suggesting improvement and generalization of existing protocols in various directions. However, from the efficiency view, many proposed proxy signature schemes in these literatures are not satisfying and cannot fit to the mobile communication. Therefore, there is a desire to design efficient proxy signature schemes. Based on Boneh et al＇s pairing-based short signature, this paper presents two proxy signature schemes. One is proxy-protected signature scheme, and the other is proxy aggregate signature scheme. Since both of them can achieve high efficiency, it is believed that they are specially suitable for mobile communication environment.

关键词： proxy signature proxy protected signature proxy aggregate signature bilinear pairings provable secure,efficiency

THRESHOLD PROXY RE-SIGNATURE

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2011年第4期24卷 816-824页

作者： Piyi YANG zhenfu cao xiaolei dong Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai 200240 China.

The focus of this paper is to design an efficient and secure solution addressing the semi trusted issue in proxy re-signature schemes, i.e., the proxy knows the re-signature key from user A to user B, so he is able to translate any signatures made by user A to user B, which damages the essential requirement （＂non-repudiation＂ property） of proxy re-signature schemes. In this paper, the authors first define the security model for threshold proxy re-signature scheme, and then propose two threshold proxy re-signature schemes based on Ateniese-Hohenberger＇s and Shao-cao-wang-Liang＇s approach.

关键词： Proxy re-signature robust threshold unforgeable.

Identity-based signature scheme based on quadratic residues

在线全文

学校读者我要写书评

暂无评论

Science in China(Series F) 2007年第3期50卷 373-380页

作者： CHAI ZhenChuan cao zhenfu dong xiaolei Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China

Identity-based （ID-based） cryptography has drawn great concerns in recent years, and most of ID-based schemes are constructed from bilinear parings. Therefore, ID-based scheme without pairing is of great interest in the field of cryptography. Up to now, there still remains a challenge to construct ID-based signature scheme from quadratic residues. Thus, we aim to meet this challenge by proposing a concrete scheme. In this paper, we first introduce the technique of how to calculate a 2^lth root of a quadratic residue, and then give a concrete ID-based signature scheme using such technique. We also prove that our scheme is chosen message and ID secure in the random oracle model, assuming the hardness of factoring.

关键词： ID-based signature quadratic residue factoring random oracle proven security