期刊文献+
共找到11篇文章
< 1 >
每页显示 20 50 100
基于多线性Diffie-Hellman问题的秘密共享方案 被引量:11
1
作者 彭巧 田有亮 《电子学报》 EI CAS CSCD 北大核心 2017年第1期200-205,共6页
秘密共享方案的信息率是衡量秘密共享通信效率的重要指标,鉴于已有的秘密共享方案效率不高的问题,本文基于多线性对提出了信息率为m/(m+1)的可验证秘密共享方案.方案中,共享秘密为m维向量,其可验证性可利用多线性映射的多线性性质来实现... 秘密共享方案的信息率是衡量秘密共享通信效率的重要指标,鉴于已有的秘密共享方案效率不高的问题,本文基于多线性对提出了信息率为m/(m+1)的可验证秘密共享方案.方案中,共享秘密为m维向量,其可验证性可利用多线性映射的多线性性质来实现;同时,在多线性Diffie-Hellman问题下,方案是可证明安全的.性能分析结果表明,与已有的相同安全级别下的秘密共享方案相比,该方案具有较高的通信效率,更适用于通信受限的数据容错的应用场景. 展开更多
关键词 可验证的秘密共享 多线性映射 信息率 多线性diffie-hellman问题
下载PDF
高阶PageRank问题的一个两步分裂迭代算法 被引量:1
2
作者 顾传青 葛国栋 《应用数学与计算数学学报》 2018年第3期581-587,共7页
在一般PageRank问题的基础上,Gleich等结合了马尔科夫链的性质提出了高阶PageRank问题.基于Gleich等提出的几个算法,结合两步分裂迭代的思想提出了解高阶PageRank问题的一个两步分裂迭代算法.该算法能增加收敛的范围,并且减少算法的迭... 在一般PageRank问题的基础上,Gleich等结合了马尔科夫链的性质提出了高阶PageRank问题.基于Gleich等提出的几个算法,结合两步分裂迭代的思想提出了解高阶PageRank问题的一个两步分裂迭代算法.该算法能增加收敛的范围,并且减少算法的迭代步数. 展开更多
关键词 高阶PageRank问题 多重线性PageRank算法 两步分裂迭代算法
下载PDF
一种基于第三方认证的无线组密钥协商协议
3
作者 游子毅 谢晓尧 《计算机应用研究》 CSCD 北大核心 2011年第1期309-311,317,共4页
提出一种基于第三方认证的组密钥协商协议,用于在无线Mesh网络环境下的移动用户间的协同工作。经过安全性分析和性能分析得出,新协议不仅可以对组用户提供私密性保护,而且协议参与者的身份得到认证,此外,每个成员的计算成本和通信量显... 提出一种基于第三方认证的组密钥协商协议,用于在无线Mesh网络环境下的移动用户间的协同工作。经过安全性分析和性能分析得出,新协议不仅可以对组用户提供私密性保护,而且协议参与者的身份得到认证,此外,每个成员的计算成本和通信量显著降低,提高了协议的执行效率。因此,该协议是无线Mesh网络环境下的一种新型、可靠的组密钥协商协议。 展开更多
关键词 组密钥协商协议 无线MESH网络 第三方认证 多线性DH问题
下载PDF
CERTIFICATELESS SIGNATURE AND BLIND SIGNATURE 被引量:13
4
作者 Zhang Lei Zhang Futai 《Journal of Electronics(China)》 2008年第5期629-635,共7页
Certificateless public key cryptography is a new paradigm introduced by Al-Riyami and Paterson.It eliminates the need of the certificates in traditional public key cryptosystems and the key escrow problem in IDentity-... Certificateless public key cryptography is a new paradigm introduced by Al-Riyami and Paterson.It eliminates the need of the certificates in traditional public key cryptosystems and the key escrow problem in IDentity-based Public Key Cryptography(ID-PKC).Due to the advantages of the certificateless public key cryptography,a new efficient certificateless pairing-based signature scheme is presented,which has some advantages over previous constructions in computational cost.Based on this new signature scheme,a certificateless blind signature scheme is proposed.The security of our schemes is proven based on the hardness of computational Diffie-Hellman problem. 展开更多
关键词 Certificateless cryptography Digital signature Blind signature Certificateless blind signature Computational diffie-hellman (CDH) problem
下载PDF
在Einstein积上关于张量-矩阵形式的一个注释
5
作者 金鑫 徐金利 《黑龙江大学自然科学学报》 CAS 2021年第5期516-520,共5页
利用Einstein积研究了矩阵和张量之间的关系。得到了保持爱因斯坦积的张量空间和矩阵空间之间是线性同构的。研究结果推广了Brazell等([1]中(2.5)式)给出的变换。
关键词 映射问题 爱因斯坦积 多线性系统 矩阵
下载PDF
Tracing Precept against Self-Protective Tortious Decoder
6
作者 Jie Tian Xin-Fang Zhang +1 位作者 Yi-Lin Song Wei Xiang 《Journal of Electronic Science and Technology of China》 2007年第2期115-119,共5页
Traceability precept is a broadcast encryption technique that content suppliers can trace malicious authorized users who leak the decryption key to an unauthorized user. To protect the data from eavesdropping, the con... Traceability precept is a broadcast encryption technique that content suppliers can trace malicious authorized users who leak the decryption key to an unauthorized user. To protect the data from eavesdropping, the content supplier encrypts the data and broadcast the cryptograph that only its subscribers can decrypt. However, a traitor may clone his decoder and sell the pirate decoders for profits. The traitor can modify the private key and the decryption program inside the pirate decoder to avoid divulging his identity. Furthermore, some traitors may fabricate a new legal private key together that cannot be traced to the creators. So in this paper, a renewed precept is proposed to achieve both revocation at a different level of capacity in each distribution and black-box tracing against self-protective pirate decoders. The rigorous mathematical deduction shows that our algorithm possess security property. 展开更多
关键词 Attack prevention broadcast encryption diffie-hellman problem malicious subscriber tracing algorithm.
下载PDF
基于分裂迭代算法求解多重线性PageRank问题
7
作者 唐舒婷 邓秀勤 刘冬冬 《计算数学》 CSCD 北大核心 2024年第3期272-290,共19页
本文针对多重线性PageRank问题,结合松弛技术,提出了新的张量分裂算法,并给出了相应的收敛性分析.数值实验表明,在适当选择松弛参数的情况下,新算法具有较好的数值效果.
关键词 多重线性PageRank问题 张量分裂 松弛算法
原文传递
Efficient and Provably-Secure Certificateless Proxy Re-encryption Scheme for Secure Cloud Data Sharing 被引量:2
8
作者 王亮亮 陈克非 +1 位作者 毛贤平 王永涛 《Journal of Shanghai Jiaotong university(Science)》 EI 2014年第4期398-405,共8页
In current cloud computing system, large amounts of sensitive data are shared to other cloud users. To keep these data confidentiality, data owners should encrypt their data before outsourcing. We choose proxy reencry... In current cloud computing system, large amounts of sensitive data are shared to other cloud users. To keep these data confidentiality, data owners should encrypt their data before outsourcing. We choose proxy reencryption (PRE) as the cloud data encryption technique. In a PRE system, a semi-trusted proxy can transform a ciphertext under one public key into a ciphertext of the same message under another public key, but the proxy cannot gain any information about the message. In this paper, we propose a certificateless PRE (CL-PRE) scheme without pairings. The security of the proposed scheme can be proved to be equivalent to the computational Dire- Hellman (CDH) problem in the random oracle model. Compared with other existing CL-PRE schemes, our scheme requires less computation cost and is significantly more efficient. The new scheme does not need the public key certificates to guarantee validity of public keys and solves the key escrow problem in identity-based public key cryptography. 展开更多
关键词 cloud computing secure data sharing proxy re-encryption(PRE) certificateless encryption key escrow computational diffie-hellman(CDH) problem random oracle
原文传递
New Constructions of Identity-Based Threshold Decryption 被引量:1
9
作者 ZHANG Leyou HU Yupu +1 位作者 TIAN Xu'an YANG Yang 《Wuhan University Journal of Natural Sciences》 CAS 2010年第3期222-226,共5页
In this paper, based on the verifiable pair and identity-based threshold cryptography, a novel identity-based (ID-based) threshold decryption scheme (IDTDS) is proposed, which is provably secure against adaptive c... In this paper, based on the verifiable pair and identity-based threshold cryptography, a novel identity-based (ID-based) threshold decryption scheme (IDTDS) is proposed, which is provably secure against adaptive chosen cipbertext attack under the computational bilinear Diffie-Hellman (CBDH) problem assumption in the random oracle. The pubic cheekability of ciphertext in the IDTDS is given by simply creating a signed E1Gamal encryption instead of a noninteractive zero-knowledge proof. Furthermore, we introduce a modified verifiable pairing to ensure all decryption shares are consistent. Our scheme is more efficient in verification than the schemes considered previously. 展开更多
关键词 ID-Based threshold decryption verifiable pair computational bilinear diffie-hellman (CBDH) problem provable security
原文传递
Constructing pairing-free certificateless public key encryption with keyword search
10
作者 Yang LU Ji-guo LI 《Frontiers of Information Technology & Electronic Engineering》 SCIE EI CSCD 2019年第8期1049-1061,共13页
Searchable public key encryption enables a storage server to retrieve the publicly encrypted data without revealing the original data contents.It offers a perfect cryptographic solution to encrypted data retrieval in ... Searchable public key encryption enables a storage server to retrieve the publicly encrypted data without revealing the original data contents.It offers a perfect cryptographic solution to encrypted data retrieval in encrypted data storage systems.Certificateless cryptography(CLC)is a novel cryptographic primitive that has many merits.It overcomes the key escrow problem in identity-based cryptosystems and the cumbersome certificate problem in conventional public key cryptosystems.Motivated by the appealing features of CLC,three certificateless encryption with keyword search(CLEKS)schemes were presented in the literature.However,all of them were constructed with the costly bilinear pairing and thus are not suitable for the devices that have limited computing resources and battery power.So,it is interesting and worthwhile to design a CLEKS scheme without using bilinear pairing.In this study,we put forward a pairing-free CLEKS scheme that does not exploit bilinear pairing.We strictly prove that the scheme achieves keyword ciphertext indistinguishability against adaptive chosen-keyword attacks under the complexity assumption of the computational Diffie-Hellman problem in the random oracle model.Efficiency comparison and the simulation show that it enjoys better performance than the previous pairing-based CLEKS schemes.In addition,we briefly introduce three extensions of the proposed CLEKS scheme. 展开更多
关键词 Searchable public key encryption Certificateless public key encryption with keyword search Bilinear pairing Computational diffie-hellman problem
原文传递
Secure Proxy Re-Encryption from CBE to IBE
11
作者 CHEN Yan ZHANG Futai 《Wuhan University Journal of Natural Sciences》 CAS 2008年第6期657-661,共5页
In this paper, an efficient hybrid proxy re-encryption scheme that allows the transformation of the ciphertexts in a traditional public key cryptosystem into the ciphertexts in an identity-based system is proposed. Th... In this paper, an efficient hybrid proxy re-encryption scheme that allows the transformation of the ciphertexts in a traditional public key cryptosystem into the ciphertexts in an identity-based system is proposed. The scheme is non-interactive, unidirectional and collude "safe". Furthermore, it is compatible with current IBE (identity-based encryption) deployments. The scheme has chosen ciphertext security in the random oracle model assuming the hardness of the Decisional Bilinear Diffie-Hellman problem. 展开更多
关键词 proxy re-encryption traditional public key encryption identity-based public key encryption Decisional Bilinear diffie-hellman problem random oracle model
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部