共查询到20条相似文献,搜索用时 31 毫秒
1.
The author proposes digital signature schemes without using a one-way function to sign Diffie-Hellman public keys. The advantage of this approach is, instead of relying overall security on either the security of the signature scheme or the security of the one-way function, the security of this proposed scheme is based on the discrete logarithm problem 相似文献
2.
The research on the identification scheme is an important and active area in computer and communication security. A series of identification schemes were proposed to improve the efficiency and security of the protocols by various methods. Based on the hardness assumption of the discrete logarithm problem in a gap Diffie-Hellman group and the difficulty of the collusion attack algorithm with k traitors, an efficient identification scheme is presented. Without random oracle models, the proposed scheme is then proved secure against impersonation and reset attacks in both concurrent and reset attack setting. Since the proposed scheme is simple, memory-saving, computation-efficient, and perfectly-secure, it is well suitable for use in smart cards. 相似文献
3.
Transitive signatures: new schemes and proofs 总被引:5,自引:0,他引:5
Bellare M. Neven G. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2005,51(6):2133-2151
We present novel realizations of the transitive signature primitive introduced by Micali and Rivest, enlarging the set of assumptions on which this primitive can be based, and also providing performance improvements over existing schemes. More specifically, we propose new schemes based on factoring, the hardness of the one-more discrete logarithm problem, and gap Diffie-Hellman (DH) groups. All these schemes are proven transitively unforgeable under adaptive chosen-message attack in the standard (not random-oracle) model. We also provide an answer to an open question raised by Micali and Rivest regarding the security of their Rivest-Shamir-Adleman (RSA)-based scheme, showing that it is transitively unforgeable under adaptive chosen-message attack assuming the security of RSA under one-more inversion. We then present hash-based modifications of the RSA, factoring, and gap Diffie-Hellman based schemes that eliminate the need for "node certificates" and thereby yield shorter signatures. These modifications remain provably secure under the same assumptions as the starting scheme, in the random oracle model. 相似文献
4.
5.
Cheng Xiangguo Liu Jingmei Guo Lifeng Wang Xinmei 《电子科学学刊(英文版)》2006,23(4):569-573
I. Introduction A multisignature allows any subgroup of a given group of potential signers to jointly sign a message such that a verifier is convinced that each member of the subgroup participated in signing. An aggre-gate signature, recently proposed by Boneh et al.[1], however, is a scheme that allows n members of a given group of potential signers to sign n different messages and all these signatures can be aggregated into a single signature. This single signature will convince the verifie… 相似文献
6.
利用弱困难性假设构造强安全的加密系统在基于身份的加密( Identity-Based Encryption ,IBE)中具有重要的理论与实际意义。本文基于弱困难性的判定性双线性Diffie-Hellman假设,构造了一个对于选择明文攻击安全的匿名的身份加密方案,解决了利用弱困难性假设构造强安全的基于身份加密系统的问题,同时也解决了基于身份的加密系统的隐私保护问题。与现有的基于较强困难性假设的方案相比,新方案实现的条件更容易满足,可以公开验证而且效率更高。 相似文献
7.
8.
Proxy signature is an active research area in cryptography. A proxy signature scheme allows an entity to delegate his or her signing capability to another entity in such a way that the latter can sign messages on behalf of the former. Many proxy signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is more than 10 times of the scalar multiplication over elliptic curve group. In order to save the running time and the size of the signature, we propose a proxy signature scheme without bilinear pairings and prove its security against adaptive chosen‐message attack in random oracle model. The security of our scheme is based on the hardness of the elliptic curve discrete logarithm problem. With the running time being saved greatly, our scheme is more practical than the previous related scheme for practical applications. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
9.
Security Arguments for Digital Signatures and Blind Signatures 总被引:85,自引:1,他引:84
Since the appearance of public-key cryptography in the seminal Diffie—Hellman paper, many new schemes have been proposed
and many have been broken. Thus, the simple fact that a cryptographic algorithm withstands cryptanalytic attacks for several
years is often considered as a kind of validation procedure. A much more convincing line of research has tried to provide
``provable' security for cryptographic protocols. Unfortunately, in many cases, provable security is at the cost of a considerable
loss in terms of efficiency. Another way to achieve some kind of provable security is to identify concrete cryptographic objects,
such as hash functions, with ideal random objects and to use arguments from relativized complexity theory. The model underlying
this approach is often called the ``random oracle model.' We use the word ``arguments' for security results proved in this
model. As usual, these arguments are relative to well-established hard algorithmic problems such as factorization or the discrete
logarithm.
In this paper we offer security arguments for a large class of known signature schemes. Moreover, we give for the first time
an argument for a very slight variation of the well-known El Gamal signature scheme. In spite of the existential forgery of
the original scheme, we prove that our variant resists existential forgeries even against an adaptively chosen-message attack.
This is provided that the discrete logarithm problem is hard to solve.
Next, we study the security of blind signatures which are the most important ingredient for anonymity in off-line electronic
cash systems. We first define an appropriate notion of security related to the setting of electronic cash. We then propose
new schemes for which one can provide security arguments.
Received 24 October 1997 and revised 22 May 1998 相似文献
10.
Certificateless signature and blind signature 总被引:3,自引:0,他引:3
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. 相似文献
11.
Faguo Wu Wang Yao Xiao Zhang Wenhua Wang Zhiming Zheng 《International Journal of Communication Systems》2019,32(3)
Proxy signature scheme is an important cryptographic primitive, for an entity can delegate his signing right to another entity. Although identity‐based proxy signature schemes based on conventional number‐theoretic problems have been proposed for a long time, the researchers have paid less attention to lattice‐based proxy signature schemes that can resist quantum attack. In this paper, we first propose an identity‐based proxy signature scheme over Number Theory Research Unit (NTRU)‐lattice. We proved that the proposed paradigm is secure under the hardness of the γ‐shortest vector problem on the NTRU lattice in random oracle model; furthermore, the comparison with some existing schemes shows our scheme is more efficient in terms of proxy signature secret key size, proxy signature size, and computation complexity. As the elemental problem of the proposed scheme is difficult even for quantum computation model, our scheme can work well in quantum age. 相似文献
12.
13.
14.
15.
Michel Abdalla Pierre-Alain Fouque Vadim Lyubashevsky Mehdi Tibouchi 《Journal of Cryptology》2016,29(3):597-631
In this paper, we present three digital signature schemes with tight security reductions in the random oracle model. Our first signature scheme is a particularly efficient version of the short exponent discrete log-based scheme of Girault et al. (J Cryptol 19(4):463–487, 2006). Our scheme has a tight reduction to the decisional short discrete logarithm problem, while still maintaining the non-tight reduction to the computational version of the problem upon which the original scheme of Girault et al. is based. The second signature scheme we construct is a modification of the scheme of Lyubashevsky (Advances in Cryptology—ASIACRYPT 2009, vol 5912 of Lecture Notes in Computer Science, pp 598–616, Tokyo, Japan, December 6–10, 2009. Springer, Berlin, 2009) that is based on the worst-case hardness of the shortest vector problem in ideal lattices. And the third scheme is a very simple signature scheme that is based directly on the hardness of the subset sum problem. We also present a general transformation that converts what we term \(lossy \) identification schemes into signature schemes with tight security reductions. We believe that this greatly simplifies the task of constructing and proving the security of such signature schemes. 相似文献
16.
进一步完善ELGamal盲签名体制,研究了基于ELGamal签名方程的盲签名方案。概述了盲签名的定义及其分类标准,基于不同的签名方程,和有限域上离散对数难解性假设,得到了相应的强盲签名和弱盲签名方案。首次系统地对不同的ELGamal签名方程进行了盲性研究,并对每个盲签名方案进行了盲性分析和安全性分析。 相似文献
17.
Yuh-Min Tseng Jinn-Ke Jan 《Electronics letters》1999,35(1):37-38
In 1998, an efficient group signature scheme (the Lee-Chang scheme) was proposed based on the discrete logarithm problem. In this scheme, different group signatures of a signer for different messages contain some identical information. Once one group signature is identified, all previous group signatures are also identified at the same time. This is impractical for applications of group signatures. The authors propose an improvement on the Lee-Chang scheme to solve the above problem. The improved group signature scheme preserves the main merits inherent in most of the Lee-Chang scheme. The security of the improved scheme is also based on the discrete logarithm problem 相似文献
18.
In the literature, several dynamic ID-based remote user mutual authentication schemes are implemented using password, smartcard and Elliptic Curve Cryptography (ECC), however, none of them provides resilience against different attacks. Therefore, there is a great need to design an efficient scheme for practical applications. In this paper, we proposed such a scheme in order to provide desired security attributes and computation efficiencies. Compared with other existing techniques, our scheme is more efficient and secured. In addition, our scheme is provably secure in the random oracle model under the hardness assumption of computational Diffie-Hellman problem. 相似文献
19.
20.
基于离散对数的代理签名方案,一般分为需要可信中心和不需要可信中心两种。但在现实中,许多特定的应用环境下,一个完全可信的第三方认证中心并不存在,而且在第三方认讧中心出现问题时。吞易对信息的安全性造成直接影响。因此,构造一个不需要可信中心的代理签名方案显得非常重要。它通过对代理授权信息的盲化,加强了信息的安全性,使得授权信息可以在公共信道中传输。这样不但保证了方案在授权阶段的信息保密性,还在一定程度上提高了方案的性能。 相似文献