检索结果-南通市图书馆

Blockchain-Based Key Management Scheme Using Rational Secret Sharing

Computers, Materials & Continua 2024年第4期79卷 307-328页

作者： Xingfan Zhao changgen peng Weijie Tan Kun Niu State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China Guizhou Big Data Academy Guizhou UniversityGuiyang550025China

Traditional blockchain key management schemes store private keys in the same location,which can easily lead to security issues such as a single point of ***,decentralized threshold key management schemes have become a research focus for blockchain private key *** security of private keys for blockchain user wallet is highly related to user identity authentication and digital asset *** threshold blockchain private key management schemes based on verifiable secret sharing have made some progress,but these schemes do not consider participants’self-interested behavior,and require trusted nodes to keep private key fragments,resulting in a narrow application scope and low deployment efficiency,which cannot meet the needs of personal wallet private key escrow and recovery in public *** design a private key management scheme based on rational secret sharing that considers the self-interest of participants in secret sharing protocols,and constrains the behavior of rational participants through reasonable mechanism design,making it more suitable in distributed scenarios such as the public *** proposed scheme achieves the escrow and recovery of personal wallet private keys without the participation of trusted nodes,and simulate its implementation on smart *** to other existing threshold wallet solutions and keymanagement schemes based on password-protected secret sharing(PPSS),the proposed scheme has a wide range of applications,verifiable private key recovery,low communication overhead,higher computational efficiency when users perform one-time multi-key escrow,no need for trusted nodes,and personal rational constraints and anti-collusion attack capabilities.

关键词： Blockchain smart contract rational secret sharing key management

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Quantum-Resistant Multi-Feature Attribute-Based Proxy Re-Encryption Scheme for Cloud Services

引用

工程与科学中的计算机建模(英文) 2024年第1期138卷 917-938页

作者： Jinqiu Hou changgen peng Weijie Tan Hongfa Ding State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China Key Laboratory of Advanced Manufacturing Technology Ministry of EducationGuizhou UniversityGuiyang550025China College of Information Guizhou University of Finance and EconomicsGuiyang550025China

Cloud-based services have powerful storage functions and can provide accurate ***,the question of how to guarantee cloud-based services access control and achieve data sharing security has always been a research *** the attribute-based proxy re-encryption(ABPRE)schemes based on number theory can solve this problem,it is still difficult to resist quantum attacks and have limited expression *** address these issues,we present a novel linear secret sharing schemes(LSSS)matrix-based ABPRE scheme with the fine-grained policy on the lattice in the ***,to detect the activities of illegal proxies,homomorphic signature(HS)technology is introduced to realize the verifiability of ***,the non-interactivity,unidirectionality,proxy transparency,multi-use,and anti-quantum attack characteristics of our system are all ***,it can efficiently prevent the loss of processing power brought on by repetitive authorisation and can enable precise and safe data sharing in the ***,under the standard model,the proposed learning with errors(LWE)-based scheme was proven to be IND-sCPA secure.

关键词： Lattice learning with errors attribute-based proxy re-encryption linear secret sharing schemes

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Federated Learning Model for Auto Insurance Rate Setting Based on Tweedie Distribution

引用

工程与科学中的计算机建模(英文) 2024年第1期138卷 827-843页

作者： Tao Yin changgen peng Weijie Tan Dequan Xu Hanlin Tang State Key Laboratory of Public Big Data Guizhou UniversityGuiyang550025China Guizhou Big Data Academy Guizhou UniversityGuiyang550025China Key Laboratory of Advanced Manufacturing Technology Ministry of EducationGuizhou UniversityGuiyang550025China College of Computer Science and Technology Guizhou UniversityGuiyang550025China ChinaDataPay Company Guiyang550025China

In the assessment of car insurance claims,the claim rate for car insurance presents a highly skewed probability distribution,which is typically modeled using Tweedie *** traditional approach to obtaining the Tweedie regression model involves training on a centralized dataset,when the data is provided by multiple parties,training a privacy-preserving Tweedie regression model without exchanging raw data becomes a *** address this issue,this study introduces a novel vertical federated learning-based Tweedie regression algorithm for multi-party auto insurance rate setting in data *** algorithm can keep sensitive data locally and uses privacy-preserving techniques to achieve intersection operations between the two parties holding the *** determining which entities are shared,the participants train the model locally using the shared entity data to obtain the local generalized linear model intermediate *** homomorphic encryption algorithms are introduced to interact with and update the model intermediate parameters to collaboratively complete the joint training of the car insurance rate-setting *** tests on two publicly available datasets show that the proposed federated Tweedie regression algorithm can effectively generate Tweedie regression models that leverage the value of data fromboth partieswithout exchanging *** assessment results of the scheme approach those of the Tweedie regressionmodel learned fromcentralized data,and outperformthe Tweedie regressionmodel learned independently by a single party.

关键词： Rate setting Tweedie distribution generalized linear models federated learning homomorphic encryption

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

流密码框架下的SM4专用认证加密算法

引用

计算机工程与应用 2024年第2期60卷 272-278页

作者：李胡彭长根侯金秋公共大数据国家重点实验室贵阳550025 贵州大学计算机科学与技术学院贵阳550025

认证加密算法是能同时满足数据机密性与完整性的对称密码算法,在数据安全领域具有广泛应用。针对基于分组密码的认证加密算法的安全性以及效率需求,提出一种基于SM4轮函数的专用认证加密算法SMRAE。算法采用流密码思想,从SM4底层部件出... 详细信息

认证加密算法是能同时满足数据机密性与完整性的对称密码算法,在数据安全领域具有广泛应用。针对基于分组密码的认证加密算法的安全性以及效率需求,提出一种基于SM4轮函数的专用认证加密算法SMRAE。算法采用流密码思想,从SM4底层部件出发,结合Feistel结构设计状态更新函数用于轮变换,处理256 bit消息只需调用4个SM4轮函数指令。在初始化阶段将初始向量和密钥经过16轮迭代,使差分充分随机化;利用SM4加密消息,将生成的密文参与轮变换,实现状态更新和加密并行;解密时先进行消息认证,降低时间消耗,提高算法安全性。安全性分析与实验结果表明SMRAE能够抵抗伪造攻击、差分攻击和猜测攻击等主流攻击,效率高于AES-GCM,与SM4效率相当,具备一定的实用性。

关键词： SM4 认证加密分组密码 Feistel结构流密码

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Spark框架下支持差分隐私保护的K-means++聚类方法

引用

信息安全研究 2024年第8期10卷 712-718页

作者：石江南彭长根谭伟杰公共大数据国家重点实验室(贵州大学) 贵阳550025 现代制造技术教育部重点实验室(贵州大学) 贵阳550025

针对差分隐私聚类算法在处理海量数据时其隐私性和可用性之间的矛盾,提出了一种分布式环境下支持差分隐私的K-means++聚类算法.该算法通过内存计算引擎Spark,创建弹性分布式数据集,利用转换算子及行动算子操作数据进行运算,并在选取初... 详细信息

针对差分隐私聚类算法在处理海量数据时其隐私性和可用性之间的矛盾,提出了一种分布式环境下支持差分隐私的K-means++聚类算法.该算法通过内存计算引擎Spark,创建弹性分布式数据集,利用转换算子及行动算子操作数据进行运算,并在选取初始化中心点及迭代更新中心点的过程中,通过综合利用指数机制和拉普拉斯机制,以解决初始聚类中心敏感及隐私泄露问题,同时减少计算过程中对数据实施的扰动.根据差分隐私的特性,从理论角度对整个算法进行证明,以满足ε-差分隐私保护.实验结果证明了该方法在确保聚类结果可用性的前提下,具备出色的隐私保护能力和高效的运行效率.

关键词：数据挖掘聚类算法差分隐私 Spark框架指数机制

来源：

维普期刊数据库博看期刊

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An incentive-compatible rational secret sharing scheme using blockchain and smart contract

引用

Science China(Information Sciences) 2021年第10期64卷 221-241页

作者： Zerui CHEN Youliang TIAN changgen peng State Key Laboratory of Public Big Date College of Computer Science and Technology Guizhou University Institute of Cryptography and Data Security Guizhou University

In the rational cryptographic protocol, the two rational players often fall into the prisoner’s dilemma, which is also the case for the rational secret sharing we consider in this paper. First, it is proved that rational secret sharing has a sequential equilibrium in the natural state, so that rational participants will fall into the prisoner’s dilemma, resulting in no participants being able to reconstruct the secret ***, to solve this problem, we propose an incentive-compatible rational secret scheme. Specifically, the game tree with imperfect information is constructed to facilitate our analysis and proof, and the strictly dominated strategies are directly eliminated to simplify the game tree. Further more, we describe the motivation of the verifier. Then, we prove that rational players have no motivation to deviate from honest behavior using sequential equilibrium so that rational players can reconstruct the secret correctly. Finally, we complete the simulation using the smart contract and analyze our entire scheme. In addition, the game of our scheme does not need to be repeated multiple times to reach sequential equilibrium, i.e., the game always follows the rational path.

关键词： rational secret sharing game theory sequential equilibrium incentive-compatible smart contract

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Certificateless Public Key Encryption with Keyword Search

引用

China Communications 2014年第11期11卷 100-113页

作者： peng Yanguo CUI Jiangtao peng changgen YING Zuobin School of Computer Science and Technology Xidian University Xi'an 710071 Shaanxi Province P. R. China College of Science Guizhou University Guiyang 550025 Guizhou Province P. R. China

Public Key Encryption with Keyword Search （PEKS）, an indispensable part of searchable encryption, is stock-in- trade for both protecting data and providing operability of encrypted data. So far most of PEKS schemes have been established on Identity-Based Cryptography （IBC） with key escrow problem inherently. Such problem severely restricts the promotion of IBC-based Public Key Infrastructure including PEKS component. Hence, Certificateless Public Key Cryptography （CLPKC） is efficient to remove such problem. CLPKC is introduced into PEKS, and a general model of Certificateless PEKS （CLPEKS） is formalized. In addition, a practical CLPEKS scheme is constructed with security and efficiency analyses. The proposal is secure channel free, and semantically secure against adaptive chosen keyword attack and keyword guessing attack. To illustrate the superiority, massive experiments are conducted on Enron Email dataset which is famous in information retrieval field. Compared with existed constructions, CLPEKS improves the efficiency in theory and removes the key escrow problem.

关键词： provable secure certificateless public key encryption keyword search

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An Attribute-Based Signcryption Scheme and Its Application in Information Hiding

引用

Chinese Journal of Electronics 2016年第4期25卷 632-640页

作者： peng changgen WANG Weiru TIAN Youliang YUAN Zhilong College of Computer Science and Technology Guizhou University Faculty of Science and Technology University of Macau

In order to provide a secure,reliable and flexible way to hide information,a new attribute-based signcryption scheme based on ciphertext-policy and its security proof are *** scheme not only can simultaneously fulfil both authentication and confidentiality in an efficient way,but also implements a hierarchical decryption in one group and also between different groups according to user’s authority(different users satisfying the same access structure can be considered as a group).We provide a solution to information hiding using our proposed scheme which can embed ciphertext into a *** the hierarchical decryption property,different users will obtain different message from the same *** user can not get any information without private key because message existed in the carrier is *** solution can be applied in sharing important message under the public network.

关键词： Attribute-based signcryption Information hiding Access structure Hierarchical decryption

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

hOPE:improved order preserving encryption with the power to homomorphic operations of ciphertexts

引用

Science China(Information Sciences) 2017年第6期60卷 116-132页

作者： Yanguo peng Hui LI Jiangtao CUI Junwei ZHANG Jianfeng MA changgen peng School of Computer Science and Technology Xidian University School of Cyber Engineering Xidian University College of Science Guizhou University

Database applications that manage and utilize massive data must address the issues of element comparisons, the core operations in index accessing, metric computations and metric comparisons, and the core operations in result ranking. In the cloud era, to avoid private information leakage, encrypted data are subcontracted, and resolutions for the problems that arise in three operations over ciphertexts are urgently required. Indeed, it is possible to handle element comparison through order preserving encryption/encoding(OPE) or metric computation through homomorphic encryption(HE) directly over ciphertexts. Unfortunately,the simultaneous achievement of both goals(i.e., metric computation and comparison) by directly combining OPE and HE remains intractable. In this work, an improved OPE, named h OPE, is proposed to support homomorphic operations over ciphertexts in addition to comparisons. Based on h OPE, Ah OPE and Ph OPE are designed to support homomorphic addition and product, respectively. Both schemes are proved to be indistinguishable under operated and ordered chosen-plaintext attack(IND-O2CPA) secure when the adopted HE algorithm provides indistinguishable under ordered chosen-plaintext attack(IND-OCPA secure). h OPE is a general construction that supports arbitrary HE algorithms and achieves consistent security. We deploy Ah OPE and Ph OPE in practice with a trusted/untrusted third party and compare the result with the state-of-the-art methods. The results show that our presented algorithms need few interactions and fill the gap between OPE and HE.

关键词： order preserving encoding homomorphic operation B+-tree lookup table provable secure

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

PUMTD:Privacy-Preserving User-Profile Matching Protocol in Social Networks

引用

China Communications 2022年第6期19卷 77-90页

作者： Jianhong Zhang Haoting Han Hongwei Su Zhengtao Jiang changgen peng School of Information Sciences and Technology North China University of TechnologyBeijing 100043China Key Laboratory of Cryptography of Zhejiang Province Hangzhou Normal UniversityHangzhou 311121China Guizhou Provincial Key Laboratory of Public Big Data Guizhou UniversityGuiyang 550025China School of Computer and Cyber Sciences Communication University of ChinaBeijing 100025China

User profile matching can establish social relationships between different users in the social *** the user profile is matched in plaintext,the user's privacy might face a security *** there exist some schemes realizing privacypreserving user profile matching,the resource-limited users or social service providers in these schemes need to take higher computational complexity to ensure the privacy or matching of the *** overcome the problems,a novel privacy-preserving user profile matching protocol in social networks is proposed by using t-out-of n servers and the bloom filter technique,in which the computational complexity of a user is reduced by applying the Chinese Remainder Theorem,the matching users can be found with the help of any t matching servers,and the privacy of the user profile is not ***,if at most t-1 servers are allowed to collude,our scheme can still fulfill user profile privacy and user query ***,the performance of the proposed scheme is compared with the other two schemes,and the results show that our scheme is superior to them.

关键词： user profile matching Chinese remainder theorem privacy-preserving query privacy

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：