检索结果-南通市图书馆

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

新绛孝陵遗址的分期及制陶专业化研究

中原文物 2024年第3期 86-93页

作者：董霄雷中国社会科学院考古研究所北京100101

本文通过对新绛孝陵遗址出土的典型陶器进行分期研究,将孝陵遗址龙山时代遗存划分为荆村文化、东关文化和三里桥文化三个发展阶段,并对遗址各时期陶窑与周围附属设施的平面布局结构进行研究。认为孝陵遗址的制陶业在荆村文化阶段处于繁... 详细信息

本文通过对新绛孝陵遗址出土的典型陶器进行分期研究,将孝陵遗址龙山时代遗存划分为荆村文化、东关文化和三里桥文化三个发展阶段,并对遗址各时期陶窑与周围附属设施的平面布局结构进行研究。认为孝陵遗址的制陶业在荆村文化阶段处于繁盛时期,至东关文化阶段开始由盛转衰,到三里桥文化阶段,此地或许已经不再从事与制陶相关的活动。在此基础上,对孝陵遗址制陶专业化水平等问题进行讨论,认为孝陵遗址的陶器生产已经具备了规模化、专门化等特征,专业化程度已经达到相当高的程度。

关键词：孝陵遗址分期布局结构制陶专业化

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

在线全文

学校读者我要写书评

暂无评论

计算机研究与发展 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的安全性和实用性.

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

在线全文

学校读者我要写书评

暂无评论

卧式沉降离心机参数对固体回收率的影响研究

煤质技术 2024年第4期39卷 92-96页

作者：董晓磊中煤科工集团唐山研究院有限公司河北唐山063012 河北省煤炭洗选工程技术研究中心河北唐山063012

煤炭领域细粒煤泥处理属于行业煤泥处理的主要难题,卧式沉降离心机在煤炭领域上具有广泛的应用,其适用于各种固液分离,尤其应用于细粒级煤炭回收以及降低煤炭水分。为有效降低部分细煤泥处理费用,增加回收后细煤泥的增值利用,以河北、... 详细信息

煤炭领域细粒煤泥处理属于行业煤泥处理的主要难题,卧式沉降离心机在煤炭领域上具有广泛的应用,其适用于各种固液分离,尤其应用于细粒级煤炭回收以及降低煤炭水分。为有效降低部分细煤泥处理费用,增加回收后细煤泥的增值利用,以河北、山西、内蒙古地区3个洗煤厂细煤泥为试验对象并开展离心机参数变量对固体回收率的试验研究,重点探究转鼓转速、转速差、堰高、入料质量分数和粒度组成对回收率的影响规律。试验结果表明:转速增加将提高回收率、降低分级粒径,极限转速后变化不显著;随着速度差的增加则回收率逐步增加,较高的入料质量分数下则回收率变化较小;一定范围内增加堰高有利于回收,需调整堰高至合理区间;随着入料质量分数上升则回收率逐步上升,其质量分数超过40%,回收率上升趋势变化较小;回收率随物料粒度变大而增加,而分级粒径变化很小。

关键词：卧式沉降离心机固体回收率离心机参数固液分离试验转鼓转速粒度组成

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.

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

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

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

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

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.