共查询到17条相似文献,搜索用时 109 毫秒
1.
秘密共享方案的信息率是衡量秘密共享通信效率的重要指标,鉴于已有的秘密共享方案效率不高的问题,本文基于多线性对提出了信息率为m/(m+1)的可验证秘密共享方案.方案中,共享秘密为m维向量,其可验证性可利用多线性映射的多线性性质来实现;同时,在多线性Diffie-Hellman问题下,方案是可证明安全的.性能分析结果表明,与已有的相同安全级别下的秘密共享方案相比,该方案具有较高的通信效率,更适用于通信受限的数据容错的应用场景. 相似文献
2.
3.
基于椭圆曲线密码体制,提出了一个新的可公开验证的多秘密共享方案。该方案中,参与者和分发者可同时产生各参与者的秘密份额,可同时防止分发者和参与者进行欺骗。在秘密恢复过程中,任何个体都能验证参与者是否拥有有效的子秘密,秘密恢复者可验证参与者是否提供了正确的秘密份额。每个参与者只需要维护一个秘密份额,就可以实现对多个秘密的共享。方案的安全性是基于椭圆曲线密码体制以及(t,n)门限秘密共享体制的安全性。 相似文献
4.
基于双线性变换的可证明安全的秘密共享方案 总被引:9,自引:2,他引:7
提出了利用双线性对构建可证明安全的秘密共享方案的新方法.首先,基于公钥密码体制的语义安全的标准定义,提出了适合秘密共享方案的语义安全定义.然后,提出了一个新的基于双线性对的门限秘密共享方案,并对其正确性、安全性和性能进行分析讨论和证明.相比较于现有的大多数方案,此方案是可证明安全的,同时,该方案将参与者私钥计算和秘密分发过程分离,且秘密分发者无需安全保存参与者私钥,具有更好的安全性和效率,更适合实际应用. 相似文献
5.
6.
7.
基于RSA密码体制(t,n)门限秘密共享方案 总被引:5,自引:0,他引:5
基于RSA密码体制,提出了一个新的(t,n)门限秘密共享方案。在该方案中,秘密份额由各参与者自己选择,秘密分发者不知道每个参与者所持有的份额,而且秘密份额长度与秘密长度相同。在秘密恢复过程中,每个参与者能够验证其他参与者是否进行了欺骗。每个参与者只需维护一个秘密份额,就可以实现对多个秘密的共享。方案的安全性是基于RSA密码体制和Shamir的(t,n)门限秘密共享方案的安全性。 相似文献
8.
基于RSA密码体制(t,n)门限秘密共享方案 总被引:12,自引:2,他引:10
基于RSA密码体制,提出了一个新的(t,n)门限秘密共享方案.在该方案中,秘密份额由各参与者自己选择,秘密分发者不知道每个参与者所持有的份额,而且秘密份额长度与秘密长度相同.在秘密恢复过程中,每个参与者能够验证其他参与者是否进行了欺骗.每个参与者只需维护一个秘密份额,就可以实现对多个秘密的共享.方案的安全性是基于RSA密码体制和Shamir的(t,n)门限秘密共享方案的安全性. 相似文献
9.
10.
提出了一种非交互式的公开可验证的门限秘密共享方案.该方案借鉴自然进化的思想,由分享的秘密进化出所有参与者的共享,并且采用知识签名的方法保证任何一方都能公开地验证共享的正确性;反过来,基于线性方程组的求解理论,任意k个被验证有效的共享可以恢复秘密.新方案是信息论安全的,易于扩展与更新. 相似文献
11.
In practical applications,the potential adversary may exploit partial information about the secret keys by side-channel attacks ,traditional certificateless signcryption schemes can’t resist these key-leakage attacks.A leakage-resilient certificateless signcryption scheme based on Elliptic Curve Cryptography and bilinear pairing was presented.In the random oracle,proved that the security of the scheme is based on the decisional Diffie-Hellman assumption.The scheme is also proved semantically secure against adaptive posterior chosen-ciphertext key-leakage attacks (KL-CCA2),and existentially unforgeable against chosen-message key-leakage attacks(KL-CMA).The proposed scheme was free from non-interactive zero knowledge proof system and needs no bilinear paring operation in signcryption phase.Compared with other schemes of the same kind,the proposed scheme can resist key-leakage attacks and maintains high efficiency. 相似文献
12.
13.
A sharing multi-owner setting where data was owned by a fixed number of data owners,the existing searchable encryption schemes could not support ciphertext retrieval and fine-grained access control at the same time.For this end,an efficient cryptographic primitive called as multi-owner accredited keyword search over encrypted data scheme was designed,through combining linear secret-sharing technique with searchable encryption schemes,only the data users authorized bymulti-owner by could decrypt the returned results.The formal security analysis shows that the scheme can protect security and privacy under the bilinear Diffie-Hellman assumption.As a further contribution,an empirical study over real-world dataset was conelucted to show the effectiveness and practicability of the scheme. 相似文献
14.
A key agreement scheme is an important technique to establish a common secret over an insecure communication environment such as the Internet. In this paper, we elaborate on the merits of self-certified public key systems and bilinear pairing cryptosystems to propose an efficient and secure non-interactive authenticated key agreement (NI-AKA) scheme. The security of our scheme is proved to be computationally equivalent to the bilinear Diffie-Hellman problem (BDHP). In addition, the proposed scheme has the following advantages: (i) Two participants can easily establish a shared secret key between them without further interactions, so as to greatly reduce the possibility of leaking any security information of the shared secret key. (ii) Combining with self-certified public key systems, the proposed scheme makes it unnecessary to verify each other’s public key in advance, since the authenticity of the public keys is simultaneously validated when the mutually shared secret key is correctly established. (iii) Based on the bilinear pairing cryptosystems over elliptic curves, our scheme is suitable for mobile applications with limited computing power and insufficient storage space, such as PDAs and cellular phones, etc. 相似文献
15.
16.
Exiting heterogeneous signcryption schemes which were between public key infrastructure (PKI) and identity-based cryptosystem (IBC) have some limitations.A new heterogeneous signcryption scheme between PKI and IBC was proposed.In the random oracle mode,the scheme ensured confidentiality and unforgeability on the basis of the assumption of computational Diffie-Hellman problem (CDHP),q-Diffie-Hellman inversion problem (q-DHIP) and bilinear Diffie-Hellman problem (BDHP).Simultaneously,the proposed scheme guaranteed unconnectedness and anonymity of the ciphertext.Compared with other heterogeneous schemes,the scheme achieved two-way signcryption,and it generated parameters without restrict,which was suitable for actual situations.Simulation tests show that proposed scheme is feasible. 相似文献
17.
为了满足在司法行政、电子政务等领域的应用需求,提出了无证书强指定验证者多重签名的概念和敌手模型,利用双线性对构造了第一个无证书强指定验证者多重签名方案,在计算双线性Diffie-Hellman问题和计算Diffie-Hellman问题假设下证明了该方案是存在性不可伪造的,而且该方案满足强指定验证者签名和多重签名应具备的性质。方案执行效率高,生成的指定验证者多重签名长度仅为160 bit,签名验证时需要的双线性对运算个数是固定的,仅需一个双线性对。所以,即使在计算资源与网络带宽受限的无线网络中方案也非常实用。 相似文献