检索结果-南通市图书馆

Multi-party privacy-preserving decision tree training with a privileged party

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2024年第8期67卷 253-268页

作者： Yiwen TONG Qi FENG Min LUO debiao he Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Shanghai Technology Innovation Centre of Distributed Privacy-Preserving Artificial Intelligence Matrix Elements Technologies Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center Qilu University of Technology(Shandong Academy of Sciences)

Currently, a decision tree is the most commonly used data mining algorithm for classification tasks. While a significant number of studies have investigated privacy-preserving decision trees, the methods proposed in these studies often have shortcomings in terms of data privacy breach or efficiency. Additionally,these methods typically only apply to symmetric frameworks, which consist of two or more parties with equal privilege, and are not suitable for asymmetric scenarios where parties have unequal privilege. In this paper,we propose SecureCART, a three-party privacy-preserving decision tree training scheme with a privileged party. We adopt the existing pMPL framework and design novel secure interactive protocols for division,comparison, and asymmetric multiplication. Compared to similar schemes, our division protocol is 93.5–560.4× faster, with the communication overhead reduced by over 90%; further, our multiplication protocol is approximately 1.5× faster, with the communication overhead reduced by around 20%. Our comparison protocol based on function secret sharing maintains good performance when adapted to pMPL. Based on the proposed secure protocols, we implement SecureCART in C++ and analyze its performance using three real-world datasets in both LAN and WAN environments. he experimental results indicate that SecureCART is significantly faster than similar schemes proposed in past studies, and that the loss of accuracy while using SecureCART remains within an acceptable range.

关键词： decision trees privacy protection privileged party secret sharing secure multi-party computation

同方期刊数据库

在线全文

学校读者我要写书评

暂无评论

一种面向工业物联网的远程安全指令控制方案

计算机工程 2024年第3期50卷 28-35页

作者：陈纪成包子健罗敏何德彪武汉大学国家网络安全学院空天信息安全与可信计算教育部重点实验室湖北武汉430072

随着工业领域对智能化要求的不断提高,工业物联网(IIoT)得到了快速发展,其可以有效提高工业生产中的流程效率和决策质量,具有广阔的应用前景。然而,近年来IIoT的安全问题逐渐凸显。针对远程指令控制这一应用场景,设计一种基于SM9标识密... 详细信息

随着工业领域对智能化要求的不断提高,工业物联网(IIoT)得到了快速发展,其可以有效提高工业生产中的流程效率和决策质量,具有广阔的应用前景。然而,近年来IIoT的安全问题逐渐凸显。针对远程指令控制这一应用场景,设计一种基于SM9标识密码算法的两方协同群签名算法,并结合区块链实现面向IIoT的远程安全指令控制方案,以保障IIoT中远程指令操作的安全性。该方案基于国密SM9标准,群管理员审核指令,并与发起指令签署请求的用户协同完成群签名,群签名在保护签名者身份隐私的同时可以由群管理员在必要时公开签名者身份。通过引入区块链技术,实现IIoT平台的去中心化管理,并通过智能合约获取指令执行历史数据,方便后续审计与追责。此外,方案在签名验证阶段通过批量验证来有效减少计算消耗。安全性及性能分析结果表明:在签名数量超过20条时,该方案通过批量验证的方式可以使得计算量减少50%以上;相较对比方案,所提方案在IIoT环境下安全性和实用性更高。

关键词： SM9标识密码算法群签名两方协同签名工业物联网区块链

在线全文

学校读者我要写书评

暂无评论

基于AVX512的格密码高速并行实现

计算机工程 2024年第2期50卷 15-24页

作者：雷斗威何德彪罗敏彭聪武汉大学国家网络安全学院湖北武汉430072

量子计算的迅速发展可能对当前广泛使用的公钥密码算法造成严重威胁。格密码因优秀的抗量子安全性和高效的计算效率在后量子密码中占据重要地位。美国国家标准技术研究院于2022年5月公布4个后量子密码标准,其中3个是格密码算法,Kyber算... 详细信息

量子计算的迅速发展可能对当前广泛使用的公钥密码算法造成严重威胁。格密码因优秀的抗量子安全性和高效的计算效率在后量子密码中占据重要地位。美国国家标准技术研究院于2022年5月公布4个后量子密码标准,其中3个是格密码算法,Kyber算法便是其中之一。随着后量子密码标准的确定,Kyber算法高效实现的需求日益增加。基于512位高级向量扩展(AVX512),对Kyber算法进行优化与高速并行实现。使用惰性模约减、优化的蒙哥马利模约减及优化的快速数论变化等技术,充分利用计算机的存储空间,减少大量不必要的模约减操作,提高多项式计算的效率与并行性。采用冗余比特技术,增强多项式抽样过程中比特的并行处理能力。通过AVX512的512 bit位宽和8路并行实现哈希运算,并对其产生的伪随机比特串进行合理调度,充分发挥并行性能。基于AVX512指令集高速并行实现Kyber上的多项式计算和抽样,并进一步实现整个Kyber公钥加密方案。性能测试结果表明,与C语言实现相比,基于AVX512实现的密钥生成和加密算法获得了10~16倍的加速,解密算法获得了约56倍的加速。

关键词：后量子密码格密码公钥加密 512位高级向量扩展指令集并行计算

基于SM2数字签名的区块链匿名密钥交换协议

在线全文

学校读者我要写书评

暂无评论

信息安全学报 2024年第3期9卷 19-28页

作者：黄佩达林超伍玮何德彪福建师范大学计算机与网络空间安全学院福州350117 福建师范大学数学与统计学院福州350117 武汉大学国家网络安全学院武汉430072

区块链技术因其去中心化、匿名性、不可篡改、不可伪造等优点,已经成为我国的一项前沿技术,在各领域得到广泛的应用。虽然用户可利用区块链发布匿名交易,有效隐藏交易双方的身份信息,但双方交易完成后传输交易相关数据可能破坏匿名性。... 详细信息

区块链技术因其去中心化、匿名性、不可篡改、不可伪造等优点,已经成为我国的一项前沿技术,在各领域得到广泛的应用。虽然用户可利用区块链发布匿名交易,有效隐藏交易双方的身份信息,但双方交易完成后传输交易相关数据可能破坏匿名性。这是因为在数据传输过程中,为了保证双方通信安全,往往使用认证密钥交换协议认证双方身份,计算会话密钥建立安全信道。由于传统的认证密钥交换协议涉及双方的长期公私钥对信息,所以将泄露交易双方的身份信息。虽然区块链匿名密钥交换可基于交易双方的历史链上交易完成密钥交换,有效保障交易双方的匿名性,但现有区块链匿名密钥交换协议主要基于国外密码算法设计,难以适用于国产区块链平台,不符合我国密码核心技术自主可控的要求。为丰富国产商用密码算法在区块链匿名密钥交换方面的研究,满足区块链交易后双方匿名安全通信的需求,本文以SM2数字签名算法和区块链为基础,构造非交互式和交互式两种区块链匿名密钥交换协议。并在CK安全模型中证明非交互式的协议满足会话密钥安全,交互式的协议满足有前向安全性的会话密钥安全。最后通过理论分析和编程实现结果表明,本文协议在没有比现有协议消耗更多的计算开销与通信代价的前提下,可适用于国产化区块链平台。

关键词：密钥交换协议 SM2数字签名区块链 CK安全模型

在线全文

学校读者我要写书评

暂无评论

基于区块链和SM9数字签名的代理投票方案

信息网络安全 2024年第1期 36-47页

作者：朱郭诚何德彪安浩杨彭聪武汉大学国家网络安全学院武汉430072 武汉大学空天信息安全与可信计算教育部重点实验室武汉430072

随着互联网的普及,电子投票技术逐渐替代传统纸质投票技术。然而,传统的电子投票方案主要针对一人一票制来设计方案,在一些特殊的投票场景下,一人一票制投票方式不再适用。例如,投票者不具备专业知识却也需要投票的场景,投票者由于不能... 详细信息

随着互联网的普及,电子投票技术逐渐替代传统纸质投票技术。然而,传统的电子投票方案主要针对一人一票制来设计方案,在一些特殊的投票场景下,一人一票制投票方式不再适用。例如,投票者不具备专业知识却也需要投票的场景,投票者由于不能理解选举的内容而消极投票,造成选举结果不专业和不公正等问题。此外,传统的电子投票技术还存在选举过程不透明和选票不可验证等问题。针对上述问题,文章提出一种基于区块链和SM9数字签名的代理投票方案。该方案首先使用区块链技术解决选票的全局可验证问题,其次使用零知识范围证明技术解决恶意选票值的问题,然后利用基于椭圆曲线的改进ElGamal算法的同态性质实现选票加密和自计票功能,最后使用SM9数字签名算法和变色龙哈希函数设计的代理投票凭证实现投票权的转让过程。通过安全性分析,证明了文章所提方案满足鲁棒性、合法性、机密性、全局可验证性和公平性。理论分析和实验数据表明,文章所提方案性能良好,适用于需要专业知识场景下的选举。

关键词：电子代理投票区块链 SM9数字签名算法变色龙哈希函数范围证明

Efficient privacy-preserving user authentication scheme with forward secrecy for industry 4.0

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2022年第1期65卷 192-206页

作者： Chenyu WANG Ding WANG Guoai XU debiao he School of Cyber Security Beijing University of Posts and Telecommunications State Key Laboratory of Cryptology College of Cyber Science Nankai University Tianjin Key Laboratory of Network and Data Security Technology Nankai University School of Cyber Science and Engineering Wuhan University

Industry 4.0, which combines information technology, network and industrial production, is expected to have a tremendous impact on our daily lives. In such a complex and security-critical system with resource-constrained sensor nodes, the design of a secure user authentication scheme for preventing real-time data from unauthorized access is full of challenges, and the main crux lies in how to realize the important property of forward secrecy. Existing schemes either fail to achieve forward secrecy or achieve forward secrecy with high computation cost on sensor nodes. Besides, they often fail to conform to the development trend of industry 4.0 systems where a cloud center is necessary to help intelligent decision-making and alleviate computation and storage pressure. Therefore, in this paper, we propose an efficient privacy-preserving user authentication scheme with forward secrecy for industry 4.0, and formally prove its security in the random oracle model. Compared with previous schemes, it has three advantages:(1) all eleven state-of-the-art criteria are achieved;(2) its computation cost on sensor nodes is comparable to those insecure schemes that employ only symmetric cryptographic algorithms, and is superior to those that also use asymmetric cryptographic algorithms;(3) it takes the advantage of the computation and storage capabilities of the cloud center to achieve user anonymity and the resistance to offline dictionary attack without performing any asymmetric cryptographic algorithms on gateways. Our computation cost on gateways is the smallest among all state-of-the-art relevant schemes for comparison.

关键词： industry 4.0 wireless sensor networks password authentication forward secrecy offline dictionary attack

Anonymous handover authentication protocol for mobile wireless networks with conditional privacy preservation

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2017年第5期60卷 113-129页

作者： debiao he Ding WANG Qi XIE Kefei CheN State Key Laboratory of Software Engineering Computer School Wuhan University State Key Laboratory of Cryptology School of Electronics Engineering and Computer Science Peking University Hangzhou Key Laboratory of Cryptography and Network Security Hangzhou Normal University

With the development of the wireless communication technology and the popularity of mobile devices, the mobile wireless network(MWN) has been widely used in our daily life. Through the access point(AP), users could access the Internet anytime and anywhere using their mobile devices. Therefore, MWNs can bring much convenience to us. Due to the limitation of AP’s coverage, the seamless handover frequently occurs in practical applications. How to guarantee the user’s privacy and security and identify the real identity when he/she brings harm to the system becomes very challenging. To achieve such goals, many anonymous handover authentication(AHA) protocols have been proposed in the last several years. However, most of them have high computation costs because mobile nodes need to carry out the bilinear pairing operations or the hash-to-point operations. Besides, most of them cannot satisfy some critical requirements, such as non-traceability and perfect forward secrecy. In this paper, we first outline the security requirements of AHA protocols, and then propose a new AHA protocol to eliminate weaknesses existing in previous AHA protocols. Based on the hardness of two famous mathematical problems, we demonstrate that the proposed AHA protocol is secure against different kinds of attacks and can meet a variety of security requirements. It can be seen from the details of implementations that the proposed AHA protocol also has much less computation cost than three latest AHA protocols.

关键词： mobile wireless network handover authentication anonymity conditional privacy preservation provable security

One-to-many authentication for access control in mobile pay-TV systems

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2016年第5期59卷 118-132页

作者： debiao he Neeraj KUMAR Han SheN Jong-Hyouk LEE State Key Laboratory of Software Engineering Computer School Wuhan University Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University Department of Computer Science and Engineering Thapar University Department of Computer Science and Engineering Sangmyung University

In traditional authentication schemes for access control in mobile pay-TV systems, one-to-one delivery is used, i.e., one authentication message per request is delivered from a head-end system(heS) to a subscriber. The performance of one-to-one delivery for authentication is not satisfactory as it requires frequent operations which results in high bandwidth consumption. To address this issue, one-to-many authentication for access control in mobile pay-TV systems was developed. It requires only one broadcasted authentication message from a heS to subscribers if there are many requests for the same service in a short period of ***, later it was revealed that the one-to-many authentication scheme was vulnerable to an impersonation attack, i.e., an attacker without any secret key could not only impersonate the mobile set(MS) to the heS but also impersonate the heS to the MS. Then, a new scheme has been recently introduced for secure operations of one-to-many authentication. However, as shown in this paper, the recent work for one-to-many authentication is still vulnerable to the impersonation attack. To mitigate this attack, in this paper, a new scheme for one-tomany authentication using bilinear pairing is proposed that eliminates security weaknesses in the previous *** obtained depict that the new improved scheme in this paper provides better performance in terms of computation and communication overheads.

关键词： authentication bilinear pairing conditional access system mobile pay-TV

A provable-secure and practical two-party distributed signing protocol for SM2 signature algorithm

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2020年第3期14卷 203-215页

作者： Yudi ZHANG debiao he Mingwu ZHANG Kim-Kwang Raymond CHOO Key Laboratory of Aerospace Information Security and Trusted Computing of Ministry of Education School of Cyber Science and EngineeringWuhan UniversityWuhan 430072China School of Computer Sciences Hubei University of TechnologyWuhan 430068China Department of Information Systems and Cyber Security and Department of Electrical and Computer Engineering University of Texas at San AntonioSan AntonioTX 78249USA

Mobile devices are widely used for data access,communications and ***,storing a private key for signature and other cryptographic usage on a single mobile device can be challenging,due to its computational ***,a number of(t,n)threshold secret sharing schemes designed to minimize private key from leakage have been proposed in the ***,existing schemes generally suffer from key reconstruction *** this paper,we propose an efficient and secure two-party distributed signing protocol for the SM2 signature *** latter has been mandated by the Chinese government for all electronic commerce *** proposed protocol separates the private key to storage on two devices and can generate a valid signature without the need to reconstruct the entire private *** prove that our protocol is secure under nonstandard ***,we implement our protocol using MIRACL Cryptographic SDK to demonstrate that the protocol can be deployed in practice to prevent key disclosure.

关键词： SM2 signature two-party signing wireless environment provable security threshold secret sharing