期刊文献+
共找到62篇文章
< 1 2 4 >
每页显示 20 50 100
Trusted Routing Based on Identity-Based Threshold Signature for Opportunistic Networks 被引量:1
1
作者 陈曦 田有亮 +1 位作者 李兴华 马建峰 《China Communications》 SCIE CSCD 2011年第4期132-140,共9页
In opportunistic Networks,compromised nodes can attack social context-based routing protocols by publishing false social attributes information.To solve this problem,we propose a security scheme based on the identity-... In opportunistic Networks,compromised nodes can attack social context-based routing protocols by publishing false social attributes information.To solve this problem,we propose a security scheme based on the identity-based threshold signature which allows mobile nodes to jointly generate and distribute the secrets for social attributes in a totally self-organized way without the need of any centralized authority.New joining nodes can reconstruct their own social attribute signatures by getting enough partial signature services from encounter opportunities with the initial nodes.Mobile nodes need to testify whether the neighbors can provide valid attribute signatures for their routing advertisements in order to resist potential routing attacks.Simulation results show that:by implementing our security scheme,the network delivery probability of the social context-based routing protocol can be effectively improved when there are large numbers of compromised nodes in opportunistic networks. 展开更多
关键词 opportunistic networks social context-based routing identity-based signature threshold cryptography
下载PDF
Non-interactive identity-based threshold signature scheme without random oracles 被引量:1
2
作者 Xun SUN Jian-hua LI +1 位作者 Shu-tang YANG Gong-liang CHEN 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2008年第6期727-736,共10页
A (t, n) threshold signature scheme distributes the secret key and hence the signing ability to n players in a way that any set of t+1 or more honest players can collaborate to sign, while any set of t players cannot.... A (t, n) threshold signature scheme distributes the secret key and hence the signing ability to n players in a way that any set of t+1 or more honest players can collaborate to sign, while any set of t players cannot. In this paper we propose an iden- tity-based threshold signature (IBTHS) scheme from bilinear pairings. The signing phase of our scheme is non-interactive, meaning that the signing players do not need to talk to each other. We prove our scheme secure (i.e., unforgeable and robust) in the standard model (i.e., without random oracles). No earlier proposed IBTHS scheme achieved even one of the features of being non-interactive (in the signing phase) and secure in the standard model. 展开更多
关键词 Bilinear pairings identity-based threshold signature (IBTHS) Standard model
下载PDF
A NEW GROUP-ORIENTED PUBLICLY VERIABLETHRESHOLD SIGNCRYPTION SCHEME 被引量:1
3
作者 Chen Shangdi Bian Guangxu 《Journal of Electronics(China)》 2013年第6期567-573,共7页
Through cryptanalysis of the improved scheme of a generalized group-oriented threshold signcryption schemes,it is found that the improved scheme can effectively resist conspiracy attack and forgery attack,but does not... Through cryptanalysis of the improved scheme of a generalized group-oriented threshold signcryption schemes,it is found that the improved scheme can effectively resist conspiracy attack and forgery attack,but does not have semantic security and public verification function,and sends threshold signcryption by the secret secure channel,which increases the communication costs and potential safety hazards of the system.A new group-oriented publicly verifiable threshold signcryption scheme is proposed on the basis of the improved scheme,the new scheme overcomes the drawbacks of the improved scheme,which not only provides with semantic security and public verification function,but also can send threshold signcryption by the public channel. 展开更多
关键词 Group-oriented threshold signcryption Public verifiable Semantic security
下载PDF
Identity-based searchable attribute signcryption in lattice for a blockchain-based medical system
4
作者 Huifang YU Xiaoping BAI 《Frontiers of Information Technology & Electronic Engineering》 SCIE EI CSCD 2024年第3期461-471,共11页
Electronic healthcare systems can offer convenience but face the risk of data forgery and information leakage.To solve these issues,we propose an identity-based searchable attribute signcryption in lattice for a block... Electronic healthcare systems can offer convenience but face the risk of data forgery and information leakage.To solve these issues,we propose an identity-based searchable attribute signcryption in lattice for a blockchain-based medical system(BCMS-LIDSASC).BCMS-LIDSASC achieves decentralization and anti-quantum security in the blockchain environment,and provides fine-grained access control and searchability.Furthermore,smart contracts are used to replace traditional trusted third parties,and the interplanetary file system(IPFS)is used for ciphertext storage to alleviate storage pressure on the blockchain.Compared to other schemes,BCMS-LIDSASC requires smaller key size and less storage,and has lower computation cost.It contributes to secure and efficient management of medical data and can protect patient privacy and ensure the integrity of electronic healthcare systems. 展开更多
关键词 Blockchain identity-based searchable attribute signcryption Distributed storage NTRU lattice
原文传递
Improvement of Identity-Based Threshold Proxy Signature Scheme with Known Signers
5
作者 LI Fagen HU Yupu CHEN Jie 《Wuhan University Journal of Natural Sciences》 CAS 2006年第6期1653-1656,共4页
In 2006, Bao et al proposed an identlty-based threshold proxy signature scheme with known signers. In this paper, we show that Bao et al's scheme is vulnerable to the forgery attack. An adversary can forge a valid th... In 2006, Bao et al proposed an identlty-based threshold proxy signature scheme with known signers. In this paper, we show that Bao et al's scheme is vulnerable to the forgery attack. An adversary can forge a valid threshold proxy signature for any message with knowing a previously valid threshold proxy signature. In addition, their scheme also suffers from the weakness that the proxy signers might change the threshold value. That is, the proxy signers can arbitrarily modify the threshold strategy without being detected by the original signer or verifiers, which might violate the original signer's intent. Furthermore, we propose an improved scheme that remedies the weaknesses of Bao et al's scheme. The improved scheme satisfies all secure requirements for threshold proxy signature. 展开更多
关键词 identity-based cryptography threshold proxy signature bilinear pairings
下载PDF
Improvement on threshold proxy signcryption scheme
6
作者 TAN Zuo-wen 《通讯和计算机(中英文版)》 2007年第5期40-46,共7页
关键词 阈代理签名 信息传输 保密通信 密码学 公匙
下载PDF
Provably Secure General Aggregate Signcryption Scheme in the Random Oracle Model 被引量:13
7
作者 Qi Zhenghua Ren Xunyi Yang Geng 《China Communications》 SCIE CSCD 2012年第11期107-116,共10页
To reduce the size of certificate chains and the ciphertext size in secure routing protocols, a General Aggregate Signcryption Scheme (GASC) is presented. In GASC, an identity-based signcryption algorithm and an aggre... To reduce the size of certificate chains and the ciphertext size in secure routing protocols, a General Aggregate Signcryption Scheme (GASC) is presented. In GASC, an identity-based signcryption algorithm and an aggregate signature algorithm are combined in a practical and secure manner to form the general aggregate signcryption scheme's schema and concept, and a new secure, efficiently general aggregate signcryption scheme, which allows the aggregation of n distinct signcryptions by n distinct users on n distinct messages, is proposed. First, the correction of the GASC scheme is analyzed. Then, we formally prove the security of GASC in the random oracle models IND-CCA2 and EUF-CMA under the DBDHP assumption and the DLP assumption, respectively. The results show that the GASC scheme is not only secure against any probabilistic polynomial-time IND-GASC-CCA2 and EUF-GASC-CMA adversary in the random oracle models but also efficient in pairing ê computations. In addition, the GASC scheme gives an effective remedy to the key escrow problem, which is an inherent issue in IBC by splitting the private key into two parts, and reduces the communication complexity by eliminating the interaction among the senders (signers) before the signcryption generation. 展开更多
关键词 identity-based cryptography signcryption aggregate signature bilinear pairing
下载PDF
A Secure Signcryption Scheme for Electronic Health Records Sharing in Blockchain 被引量:2
8
作者 Xizi Peng Jinquan Zhang +3 位作者 Shibin Zhang Wunan Wan Hao Chen Jinyue Xia 《Computer Systems Science & Engineering》 SCIE EI 2021年第5期265-281,共17页
In the existing Electronic Health Records(EHRs),the medical information of patients is completely controlled by various medical institutions.As such,patients have no dominant power over their own EHRs.These personal d... In the existing Electronic Health Records(EHRs),the medical information of patients is completely controlled by various medical institutions.As such,patients have no dominant power over their own EHRs.These personal data are not only inconvenient to access and share,but are also prone to cause privacy disclosure.The blockchain technology provides a new development direction in the medical field.Blockchain-based EHRs are characterized by decentralization,openness and non-tampering of records,which enable patients to better manage their own EHRs.In order to better protect the privacy of patients,only designated receivers can access EHRs,and receivers can authenticate the sharer to ensure that the EHRs are real and effective.In this study,we propose an identity-based signcryption scheme with multiple authorities for multiple receivers,which can resist N-1 collusion attacks among N authorities.In addition,the identity information of receivers is anonymous,so the relationship between them and the sharer is not disclosed.Under the random oracle model,it was proved that our scheme was secure and met the unforgeability and confidentiality requirements of signcryption.Moreover,we evaluated the performance of the scheme and found that it had the moderate signcryption efficiency and excellent signcryption attributes. 展开更多
关键词 Electronic health records blockchain identity-based signcryption multiple authorities multiple receivers
下载PDF
Signcryption-Based Key Management for MANETs Applications in Mobile Commerce
9
作者 LI Jingfeng ZHU Yuefei ZHANG Yajuan PAN Heng 《Wuhan University Journal of Natural Sciences》 CAS 2006年第6期1621-1624,共4页
Mobile commerce uses wireless device and wireless link to result in the transfer of values in exchange of information, services or goods. Wireless mobile ad hoc networks (MANETs) will bring a revolution to the busin... Mobile commerce uses wireless device and wireless link to result in the transfer of values in exchange of information, services or goods. Wireless mobile ad hoc networks (MANETs) will bring a revolution to the business model of mobile commerce if such networks are used as the underlying network technology for mobile commerce. Mobile commerce will remain in a niche market until the security issue is properly addressed. Hence, security is also very important for MANET applications in mobile commerce. Robust key management is one of the most crucial technologies for security of MANETs. In this paper, a new solution for key management is proposed using identity-based (ID-based) signcryption and threshold secret sharing. It enables flexible and efficient key management while respecting the constraints of MANETs. In our solution, each mobile host uses its globally unique identity as its public key. It greatly decreases the computation and storage costs of mobile hosts, as well as communication cost for system key management. 展开更多
关键词 MANETs (mobile ad hoe networks) signcryption threshold eryptography mobile commerce
下载PDF
An Efficient Identity-Based Anonymous Signcryption Scheme 被引量:4
10
作者 YU Yong LI Fagen XU Chunxiang SUN Ying 《Wuhan University Journal of Natural Sciences》 CAS 2008年第6期670-674,共5页
Signcryption is a cryptographic primitive that performs encryption and signature in a single logical step more efficiently than sign-then-encrypt approach. Till now, various kinds of signcryption schemes have been pro... Signcryption is a cryptographic primitive that performs encryption and signature in a single logical step more efficiently than sign-then-encrypt approach. Till now, various kinds of signcryption schemes have been proposed. Among them, the requirement of signcrypter's privacy protection is needful in some practical applications. In this paper, a new identity-based anonymous signcryption scheme from hilinear pairings, which is the organic combination of identity-based ring signature and encryption scheme, is proposed. The proposed scheme is indistinguishable against the chosen ciphertext attack under the Decisional Bilinear Diffie-Hellman assumption in the random oracle model. Its unforgeability relies on the computational Diffieellman problem. Compared with the previous schemes, the new scheme is more efficient in computation. 展开更多
关键词 identity-based ring signature anonynaous signcryption bilinear pairing
原文传递
Identity-based aggregate signcryption in the standard model from multilinear maps 被引量:4
11
作者 Hao WANG Zhen LIU +1 位作者 Zhe LIU Duncan S. WONG 《Frontiers of Computer Science》 SCIE EI CSCD 2016年第4期741-754,共14页
Signcryption is a public key cryptographic method that achieves unforgeability and confidentiality simultaneously with significantly smaller overhead than that required by "digital signature followed by public key en... Signcryption is a public key cryptographic method that achieves unforgeability and confidentiality simultaneously with significantly smaller overhead than that required by "digital signature followed by public key encryption". It does this by signing and encr.ypting a message in a single step. An aggregate signcryption scheme allows individual signcryption ciphertexts intended for the same recipi- ent to be aggregated into a single (shorter) combined ciphertext without losing any of the security guarantees. We present an aggregate signcryption scheme in the identity-based setting using multilinear maps, and provide a proof of security in the standard model. To the best of our knowledge, our new scheme is the first aggregate signcryption scheme that is secure in the standard model. 展开更多
关键词 identity-based aggregate signcryption multilinear maps standard model GGH framework
原文传递
ID-Based Threshold Decryption Secure Against Chosen Plaintext Attack
12
作者 龙宇 陈克非 刘胜利 《Journal of Shanghai Jiaotong university(Science)》 EI 2006年第2期127-133,共7页
B.Libert and J.Quisquater proposed an identity(ID)-based threshold decryption scheme. This paper found flaw in their security reduction and presented two methods to prove this scheme is resist against chosen-plaintext... B.Libert and J.Quisquater proposed an identity(ID)-based threshold decryption scheme. This paper found flaw in their security reduction and presented two methods to prove this scheme is resist against chosen-plaintext attack(CPA), based on the weaker model of security known as selective ID-based threshold CPA and the common model known as ID-based threshold CPA respectively. 展开更多
关键词 threshold decryption identity-based cryptology publicly checkable encryption
下载PDF
面向区块链金融的抗量子属性基门限环签密方案 被引量:1
13
作者 俞惠芳 乔一凡 孟茹 《信息网络安全》 CSCD 北大核心 2023年第7期44-52,共9页
针对区块链金融系统中用户访问控制粒度较粗、交易数据流向不受控制、数据在公有链上传输时易受窃听等问题,文章提出适用于区块链金融的抗量子属性基门限环签密方案(BCF-AAQTRSC)。BCF-AAQTRSC利用多属性机构使任何用户都可创建属性并... 针对区块链金融系统中用户访问控制粒度较粗、交易数据流向不受控制、数据在公有链上传输时易受窃听等问题,文章提出适用于区块链金融的抗量子属性基门限环签密方案(BCF-AAQTRSC)。BCF-AAQTRSC利用多属性机构使任何用户都可创建属性并授权不同用户,在保证区块链访问控制灵活性的同时很好保护了区块链访问控制的安全性。BCF-AAQTRSC在实现中心权力分散的同时满足用户隐私数据的保密性、不可伪造性和匿名性。BCF-AAQTRSC通过NTRU格构造系统参数、主控密钥与用户私钥,使用消息块共享技术与填充排列技术构造密文,使方案的安全性和计算效率得到极大提高,适用于高存储效率的区块链金融应用场景中。 展开更多
关键词 格密码学 联盟链 门限环签密 消息块共享 隐私保护
下载PDF
Identity-based threshold signature and mediated proxy signature schemes 被引量:3
14
作者 YU Yong YANG Bo SUN Ying 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2007年第2期69-74,共6页
Proxy signature schemes allow an original signer to delegate his signing rights to a proxy signer. However, many proxy signature schemes have the defect which is the inability to solve the proxy revocation problem. In... Proxy signature schemes allow an original signer to delegate his signing rights to a proxy signer. However, many proxy signature schemes have the defect which is the inability to solve the proxy revocation problem. In this article, we firstly propose an identity-based threshold signature scheme and show that it has the properties of unforgeability and robustness. In our threshold signature scheme, we adopt such a method that the private key associated with an identity rather than the master key is shared. Then, based on the threshold signature scheme, an identity-based mediated proxy signature scheme is proposed where a security mediator (SEM) is introduced to help a proxy signer to generate valid proxy signatures, examine whether a proxy signer signs according to the warrant, and check the revocation of a proxy signer. It is shown that the proposed scheme satisfies all the security requirements of a secure proxy signature. Moreover, a proxy signer must cooperate with the SEM to generate a valid proxy signature, which makes the new scheme have an effective and fast proxy revocation. 展开更多
关键词 identity-based threshold signature mediated proxy signature bilinear pairings
原文传递
Efficient identity-based threshold decryption scheme from bilinear pairings 被引量:1
15
作者 Wei GAO Guilin WANG +1 位作者 Kefei CHEN Xueli WANG 《Frontiers of Computer Science》 SCIE EI CSCD 2018年第1期177-189,共13页
Using Shamir's secret sharing scheme to indi- rectly share the identity-based private key in the form of a pairing group element, we propose an efficient identity-based threshold decryption scheme from pairings and p... Using Shamir's secret sharing scheme to indi- rectly share the identity-based private key in the form of a pairing group element, we propose an efficient identity-based threshold decryption scheme from pairings and prove its se- curity in the random oracle model. This new paring-based scheme features a few improvements compared with other schemes in the literature. The two most noticeable features are its efficiency, by drastically reducing the number of pair- ing computations, and the ability it gives the user to share the identity-based private key without requiring any access to a private key generator. With the ability it gives the user to share the identity-based private key, our ID-based threshold decryption (IBTD) scheme, the second of its kind, is signif- icantly more efficient than the first scheme, which was de- veloped by Baek and Zheng, at the expense of a slightly in- creased ciphertext length. In fact, our IBTD scheme tries to use as few bilinear pairings as possible, especially without depending on the suite of Baek-Zheng secret sharing tools based on pairings. 展开更多
关键词 identity-based cryptography threshold cryptog-raphy provable security random oracle model bilinear pair-ing identity-based threshold decryption
原文传递
具有已知代理人的不可否认门限代理签密方案(英文) 被引量:9
16
作者 李继国 李建中 +1 位作者 曹珍富 张亦辰 《软件学报》 EI CSCD 北大核心 2003年第12期2021-2027,共7页
1996年,Mambo等人提出了代理签名概念.但是,代理签名仅能提供授权的认证而不能提供保密性.Chan和Wei提出一个门限代理签密方案(记为Chan-Wei方案),扩展了代理签名的概念.指出他们的方案不满足强不可伪造性、强不可否认性和强识别性.基于... 1996年,Mambo等人提出了代理签名概念.但是,代理签名仅能提供授权的认证而不能提供保密性.Chan和Wei提出一个门限代理签密方案(记为Chan-Wei方案),扩展了代理签名的概念.指出他们的方案不满足强不可伪造性、强不可否认性和强识别性.基于Chan-Wei方案,提出一个能够克服Chan-Wei方案缺点的不可否认门限代理签密方案.给出方案的完备性证明和安全性分析.此外,与Chan-Wei方案相比,所提出的方案能够确切地发现哪些代理人提供假子密钥或篡改子密钥. 展开更多
关键词 代理签密 代理签名 门限密码学 离散对数 不可否认性
下载PDF
签密方案在分布式协议中的应用 被引量:19
17
作者 陈伟东 冯登国 《计算机学报》 EI CSCD 北大核心 2005年第9期1421-1430,共10页
该文基于可验证秘密共享思想和对Zheng的签密方案的必要修改,首次构造了一种不需要可信中心的门限签密方案.它能同时达到门限签名和加密的双重目的,实现代价仅和门限签名相当,并具有非否认性质.该文对当前一些分布式密钥分配协议做了分... 该文基于可验证秘密共享思想和对Zheng的签密方案的必要修改,首次构造了一种不需要可信中心的门限签密方案.它能同时达到门限签名和加密的双重目的,实现代价仅和门限签名相当,并具有非否认性质.该文对当前一些分布式密钥分配协议做了分析,并基于Naor的基本思想,重点利用签密方案设计了协议SC DKDS.与其它协议相比,该协议在减低实现成本等方面更为有效,因为它不需要认证信道、秘密信道及复杂的零知识证明等.该文还在RO(RandomOracle,随机预言)模型中给出了以上协议的安全性证明. 展开更多
关键词 签密 门限签密方案 分布式密钥分配协议 可证明安全性 随机预言(RO)模型
下载PDF
共享验证的门限代理签密方案 被引量:5
18
作者 王勇兵 路正国 张建中 《计算机工程与应用》 CSCD 北大核心 2008年第5期131-133,共3页
将共享验证和签密的概念引入到门限代理签名中,构造了一个安全有效的共享验证的门限代理签密方案。该方案不仅实现了门限代理签密,而且还实现了指定验证组中的不少于t个验证人一起才能恢复消息,验证签密的特性。另外,该方案还具有消息... 将共享验证和签密的概念引入到门限代理签名中,构造了一个安全有效的共享验证的门限代理签密方案。该方案不仅实现了门限代理签密,而且还实现了指定验证组中的不少于t个验证人一起才能恢复消息,验证签密的特性。另外,该方案还具有消息保密性、可公开验证性和公开信道授权的优点。 展开更多
关键词 数字签名 门限代理签密 共享验证
下载PDF
常量密文基于属性的门限签密方案 被引量:4
19
作者 曾福庚 许春香 孙丽雪 《计算机应用研究》 CSCD 北大核心 2016年第2期483-486,共4页
针对现有的基于属性的签密方案密文长度会随属性数量的增长而增长导致通信量低下的问题,提出了一个常量密文基于属性的门限签密方案。签密者(发送方)签密一段消息给解签密者(接收方);接收方能成功解密当且仅当接收方的属性集合与发送方... 针对现有的基于属性的签密方案密文长度会随属性数量的增长而增长导致通信量低下的问题,提出了一个常量密文基于属性的门限签密方案。签密者(发送方)签密一段消息给解签密者(接收方);接收方能成功解密当且仅当接收方的属性集合与发送方所用的加密属性集合的交集元素的个数大于k,接收方能确定签名是来自发送方当且仅当发送方的属性集合和发送方签名属性集合的交集元素的个数大于t,其中k、t都是门限值。该方案结合了基于属性的加密和签名,并提供了保密性、真实性、不可伪造和抗合谋攻击。与现有的方案相比,该方案实现了常量密文,具有更好的效率。 展开更多
关键词 门限 签密 属性加密 属性签名 常量密文
下载PDF
基于用户身份加密体系中的门限代理签密方案 被引量:5
20
作者 王萌 刘志镜 《计算机工程与应用》 CSCD 北大核心 2006年第7期126-128,共3页
基于用户身份的加密体系是一种新型的公钥加密体系,在这种体系中,用户的身份标志或是从身份标志中衍化出来的字符串序列就是他们的公钥。在一个门限值为(t,n)的代理签名方案中,源签名人可以把他(或她)的签名权利委派给n个代理签名人,从... 基于用户身份的加密体系是一种新型的公钥加密体系,在这种体系中,用户的身份标志或是从身份标志中衍化出来的字符串序列就是他们的公钥。在一个门限值为(t,n)的代理签名方案中,源签名人可以把他(或她)的签名权利委派给n个代理签名人,从而使得任何大于等于t个代理签名人可以代表源签名人对信息进行签名,而小于等于(t-1)个代理者却没有这种权利。然而,在许多情况下人们希望一个方案能同时满足保密性、可认证性以及不可否认性。文章提出了一种在双线性对偶映射下的基于用户身份加密体系中的门限代理签密方案,并且分析了该方案的安全性。 展开更多
关键词 基于用户身份的加密体系 门限 代理签密
下载PDF
上一页 1 2 4 下一页 到第
使用帮助 返回顶部