Filters








2,740 Hits in 3.5 sec

Efficient designated confirmer signature from bilinear pairings

Fangguo Zhang, Xiaofeng Chen, Baodian Wei
2008 Proceedings of the 2008 ACM symposium on Information, computer and communications security - ASIACCS '08  
In this paper, we propose a new designated confirmer signature scheme which is transformed from a new signature scheme.  ...  Designated confirmer signature is an important cryptographic primitive, it is widely used in E-commerce.  ...  Since the signature is encrypted, only the designated confirmer can be convinced of its validity. Moreover, the designated confirmer can easily extract an ordinary signature from it.  ... 
doi:10.1145/1368310.1368363 dblp:conf/ccs/ZhangCW08 fatcat:lp4zafrh2jefvgjpq7jgapqgj4

Limited Verifier Signature from Bilinear Pairings [chapter]

Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
2004 Lecture Notes in Computer Science  
from bilinear pairings.  ...  In this paper, we first present the precise definition and clear security notions for (convertible) limited verifier signature, and then propose two efficient (convertible) limited verifier signature schemes  ...  This work was supported by a grant No.R12-2003-004-01004-0 from the Ministry of Science and Technology, Korea.  ... 
doi:10.1007/978-3-540-24852-1_10 fatcat:lhxw4jmzrza43aayn6we4d73k4

Universal Designated-Verifier Signatures [chapter]

Ron Steinfeld, Laurence Bull, Huaxiong Wang, Josef Pieprzyk
2003 Lecture Notes in Computer Science  
We propose an efficient deterministic UDVS scheme constructed using any bilinear group-pair.  ...  We prove that our UDVS scheme is secure in the sense of our unforgeability and privacy notions for UDVS schemes, under the Bilinear Diffie-Hellman (BDH) assumption for the underlying group-pair, in the  ...  An Efficient UDVS Scheme DVSBM Based on Bilinear Group-Pairs Our proposed UDVS scheme DVSBM based on bilinear group-pairs is given below.  ... 
doi:10.1007/978-3-540-40061-5_33 fatcat:rn2oxhqwnvf5bg7vdnw53op2ji

Universally Convertible Directed Signatures [chapter]

Fabien Laguillaumie, Pascal Paillier, Damien Vergnaud
2005 Lecture Notes in Computer Science  
Directed signatures differ from the well-known confirmer signatures in that the signer has the simultaneous abilities to confirm, deny and individually convert a signature.  ...  This paper provides a positive answer to this quest by showing a very efficient design for universally convertible directed signatures (UCDS) both in terms of computational complexity and signature size  ...  We now recall the definition of bilinear group systems. In the sequel, we make use of a bilinear group pair (G 1 , G 2 ) for which there is an efficiently computable isomorphism ρ from G 2 to G 1 .  ... 
doi:10.1007/11593447_37 fatcat:kpucfvpoafdn5o2iv4wiwrjs4e

Identity Based Undeniable Signatures [chapter]

Benoît Libert, Jean-Jacques Quisquater
2004 Lecture Notes in Computer Science  
In this paper, we give a first example of identity based undeniable signature using pairings over elliptic curves.  ...  We also prove that it has the invisibility property under the Decisional Bilinear Diffie-Hellman assumption and we discuss about the efficiency of the scheme.  ...  Acknowledgements We wish to thank Fangguo Zhang for his suggestion to correct the confirmation protocol.  ... 
doi:10.1007/978-3-540-24660-2_9 fatcat:224qndfn3rf7hcocnxqeg6dom4

Efficient identity based ring signature scheme in prime order group

Jingyuan Li, Shaanxi Normal University, Xi'an, China
2021 Journal of Electronics and Information Science  
The designed signature scheme meets the unconditional anonymity and unforgeability of ring signature.  ...  Aiming at the problem of long signature generation and verification time caused by low operation efficiency in ring signature algorithm based on composite order group, an asymmetric identity based ring  ...  The methods proposed in document [9] and document [10] involve bilinear pair operation, and the efficiency of bilinear pair operation will be greatly reduced with the increase of the number of members  ... 
doi:10.23977/jeis.2021.060211 fatcat:57cvwmvxmrgnpjxykx6n3nezuu

Chameleon Signature from Bilinear Pairing

Xin-Jun DU
2007 Journal of Software (Chinese)  
This paper introduces a new chameleon hash function based on bilinear pairing and builds the ID-based chameleon signature scheme.  ...  The scheme enjoys all the attributes in the normal chameleon signature and the added characteristics of ID-based cryptography based on bilinear pairing.  ...  from bilinear pairing is a secure chameleon signature scheme.Theorem 1.  ... 
doi:10.1360/jos182662 fatcat:lku2g7jmvjcqpjnup5u3qq3ioy

Efficient Design of Certificateless Chameleon Signature from Bilinear Pairing

Tejeshwari Thakur, Neetu Sharma, Birendra Kumar Sharma
2014 International Journal of Database Theory and Application  
In this paper, we proposed a new certificateless Chameleon signature scheme based on bilinear pairings. The proposed scheme is more efficient than schemes.  ...  CL-PKC does not suffer from the key escrow property. Thus, CL-PKC can be seen as a model for the use in public key cryptography.  ...  Although, last two constructions [5, 12] are the efficient certificateless signature scheme but they suffer from universal forgery and involve large amount of pairing computation during verification.  ... 
doi:10.14257/ijdta.2014.7.3.03 fatcat:7t46planqzhthog4xrelitdu5q

Two Group Signature Schemes with Multiple Strategies Based on Bilinear Pairings

Jianhua Zhu, Guohua Cui, Shiyang Zhou
2009 International Journal of Information Technology and Computer Science  
A group signature scheme and a threshold group signature scheme based on Bilinear Paring are proposed, there are multiple security strategies in these two schemes.  ...  Moreover, this scheme support the group member revocable function efficiently and further has no requirement for time period limits.  ...  Vo et al proposed a forward security signature scheme from bilinear pairing, however their scheme is a traditional single signature, his design method is not suitable to group signature.  ... 
doi:10.5815/ijitcs.2009.01.03 fatcat:i3bkfqvpuzfsfcjrkbtmx6mh64

Strong Designated Verifier Signature Scheme Resisting Replay Attack

Yulei Zhang, Yongjie Zhang, Yahong Li, Caifen Wang
2015 Information Technology and Control  
Based on the Bilinear Diffie-Hellman problem and Pre-Image Resistance assumption, it is proved that new strong designated verifier signature scheme can resist the ordinary forgery attack and replay attack  ...  Strong designated verifier signature shows that only designated user can verify the validity of the signature, others who have not signer's private key or verifier's private key cannot judge the signature's  ...  Only designated verifier can confirm the authenticity of signature, but he/she cannot transfer the conviction to others since he/she can simulate the signature which is indistinguishable from the ones  ... 
doi:10.5755/j01.itc.44.2.7625 fatcat:2pkban5ws5auxoj3tzkpwdq4wa

Identity-based strong designated verifier signature schemes: Attacks and new construction

Baoyuan Kang, Colin Boyd, Ed Dawson
2009 Computers & electrical engineering  
As a direct corollary, we also get a new efficient ID-based designated verifier proxy signature scheme.  ...  We propose a new and efficient ID-based designated verifier signature scheme that is strong and unforgeable.  ...  Recently, Zhang and Mao [7] proposed a novel ID-based strong designated verifier signature scheme (Zhang-Mao scheme) based on bilinear pairings by combining ID-based cryptosystem with the designated  ... 
doi:10.1016/j.compeleceng.2008.05.004 fatcat:hjzb2pkchjdaxdnrxikuvwplcu

Designated Confirmer Signatures with Unified Verification [chapter]

Guilin Wang, Fubiao Xia, Yunlei Zhao
2011 Lecture Notes in Computer Science  
After the introduction of designated confirmer signatures (DCS) by Chaum in 1994, considerable researches have been done to build generic schemes from standard digital signatures and construct efficient  ...  Motivated by this observation, in this paper we first propose a new variant of DCS model, called designated confirmer signatures with unified verification, in which both the signer and the designated confirmer  ...  Conclusion and Future Work In this paper, based on BLS short signature [3] we presented a new efficient designated confirmer signature (DCS) scheme that additionally enables the signer to disavow any  ... 
doi:10.1007/978-3-642-25516-8_28 fatcat:sbskkhgoovfi7aktlbizrqomx4

A novel verifiable threshold signature scheme based on bilinear pairing in mobile Ad Hoc Network

Xianyong Meng, Yangmin Li
2012 2012 IEEE International Conference on Information and Automation  
We design a new bilinear pairing-based threshold signature scheme which is efficient in terms of both the communication overhead and the computational requirement.  ...  So the new threshold signature scheme is more secure, verifiable, and efficient compared with the presented schemes for Mobile Ad Hoc Network.  ...  In addition, we propose a new bilinear pairing-based threshold signature scheme, which is efficient in terms of both the communication overhead and the computational cost.  ... 
doi:10.1109/icinfa.2012.6246874 fatcat:b5kmkh54fraglcfxenadiw7dk4

A provably secure identity-based strong designated verifier proxy signature scheme from bilinear pairings

SK Hafizul Islam, G.P. Biswas
2014 Journal of King Saud University: Computer and Information Sciences  
scheme using elliptic curve bilinear pairing has been proposed in this paper.  ...  Although many identity-based proxy signature schemes have been proposed in the literature, only a few proposals for identity-based strong designated verifier proxy signature (ID-SDVPS) schemes are available  ...  In this paper, we have proposed an identity-based strong designated verifier proxy signature (ID-SDVPS) scheme that uses bilinear pairing for mapping from an elliptic curve additive cyclic group (Miller  ... 
doi:10.1016/j.jksuci.2013.03.004 fatcat:vjqax3mp2fbttb2dzu76hofzs4

AN EFFICIENT AND SECURE STRONG DESIGNATED VERIFIER SIGNATURE SCHEME WITHOUT BILINEAR PAIRINGS

Sk Hafizul Islam, G.P. Biswas
2013 Journal of Applied Mathematics and Informatics  
Hence, the SDVS schemes from bilinear pairing and MTP hash function are not efficient in real environments.  ...  In literature, several strong designated verifier signature (SDVS) schemes have been devised using elliptic curve bilinear pairing and map-topoint (MTP) hash function.  ...  Owing the bilinear pairing and MTP hash function free realization, this paper efficiently devised a new elliptic curve-based strong designated verifier signature scheme; however, it needs a Public Key  ... 
doi:10.14317/jami.2013.425 fatcat:azrjh5chezachkudxpbozqcrxi
« Previous Showing results 1 — 15 out of 2,740 results