Filters








1,534 Hits in 4.6 sec

New ID-Based Threshold Signature Scheme from Bilinear Pairings [chapter]

Xiaofeng Chen, Fangguo Zhang, Divyan M. Konidala, Kwangjo Kim
2004 Lecture Notes in Computer Science  
However, the signature scheme cannot be extended to a threshold one. In this paper we propose another ID-based signature scheme without trusted PKG from bilinear pairings.  ...  Chen et al. first proposed a novel ID-based signature scheme without trusted PKG from bilinear pairings [10], i.e., there is only one PKG who is not assumed to be honest in their scheme.  ...  Our new ID-based signature scheme from bilinear pairings is given in Section 3.  ... 
doi:10.1007/978-3-540-30556-9_29 fatcat:3gtyzjbdsrbvth53qiqe6wfrya

Identity-based threshold signature scheme from the bilinear pairings (extended abstract)

Joonsang Baek, Yuliang Zheng
2004 International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004.  
The focus of this paper is to formalize the concept of identity-based threshold signature and give the first provably secure scheme based on the bilinear pairings.  ...  Another interesting aspect of our results is that the security of one of the verifiable secret sharing schemes used to construct the identity-based threshold signature scheme is relative to a slightly  ...  Since Boneh and Franklin [4] used the bilinear pairings to construct the first functional ID-based encryption scheme, several ID-based signature schemes based on the bilinear pairings including Cha and  ... 
doi:10.1109/itcc.2004.1286437 dblp:conf/itcc/BaekZ04 fatcat:u44llwrwk5aqpbmo5cn7i2i3we

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

Efficient identity-based threshold signature scheme from bilinear pairings in standard model

Fei Li, Wei Gao, Guilin Wang, Kefei Chen, Xueli Wang
2014 International Journal of Internet Protocol Technology  
We propose a new identity-based threshold signature (IBTHS) scheme from bilinear pairings enjoying the following advantages in efficiency, security and functionality.  ...  The computational complexity of the threshold signing procedure is considerably low since there appears no other time-consuming pairing except two pairings for verifying each signature shares.  ...  In this paper, we propose a new identity-based threshold signature (IBTHS) scheme from bilinear pairings.  ... 
doi:10.1504/ijipt.2014.066373 fatcat:s7c63jqjsjcmldux77z6v4gpsy

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.  ...  Index Terms-group signature, forward security, member revocation, ahead signature, threshold ________________________________________________________ Manuscript  ...  In this paper, a group signature scheme based on bilinear pairing and a threshold group signature scheme based on bilinear pairing were proposed.  ... 
doi:10.5815/ijitcs.2009.01.03 fatcat:i3bkfqvpuzfsfcjrkbtmx6mh64

Identity Based Threshold Ring Signature [chapter]

Sherman S. M. Chow, Lucas C. K. Hui, S. M. Yiu
2005 Lecture Notes in Computer Science  
scheme (when t = 1) and threshold ring signature scheme from pairings.  ...  To the best of authors' knowledge, our scheme is the first ID-based threshold ring signature scheme which is also the most efficient (in terms of number of pairing operations required) IDbased ring signature  ...  The previous non ID-based threshold ring signature scheme from bilinear pairings in [33] , requires n + t pairing operations (or (n + 1)t of them without optimization) for verification.  ... 
doi:10.1007/11496618_17 fatcat:boetdxk4i5dc5lpowm4zpl57qm

One-Round ID-Based Threshold Signature Scheme from Bilinear Pairings

Wei Gao, Guilin Wang, Xueli Wang, Zhenguang Yang
2009 Informatica  
In this paper, we propose a new ID-based threshold signature scheme from the bilinear pairings, which is provably secure in the random oracle model under the bilinear Diffie-Hellman assumption.  ...  pairings.  ...  Our main contribution is that we propose a new ID-based threshold signature scheme from the bilinear pairings, which is provably secure in the random oracle model (Bellare and Rogaway, 1993) under the  ... 
doi:10.15388/informatica.2009.260 fatcat:zmcookjtwvdk3jlgutw7le4u74

An efficient and provably secure ID-based threshold signcryption scheme

Fagen Li, Yong Yu
2008 2008 International Conference on Communications, Circuits and Systems  
In this paper, we formalize the concept of identitybased threshold signcryption and give a new scheme based on the bilinear pairings.  ...  Recently, two identity-based threshold signcryption schemes [12] , [26] have been proposed by combining the concepts of identitybased threshold signature and signcryption together.  ...  Our Contribution In this paper, we present a formal security model for identity-based threshold signcryption and give a new scheme based on the bilinear pairings.  ... 
doi:10.1109/icccas.2008.4657820 fatcat:sxzw63gjubb2rcu3dwvxtuna7e

An Identity Based Strong Bi-Designated Verifier (t, n) Threshold Proxy Signature Scheme [article]

Sunder Lal, Vandani Verma
2008 arXiv   pre-print
Proxy signature schemes have been invented to delegate signing rights. The paper proposes a new concept of Identify Based Strong Bi-Designated Verifier threshold proxy signature (ID-SBDVTPS) schemes.  ...  Such scheme enables an original signer to delegate the signature authority to a group of 'n' proxy signers with the condition that 't' or more proxy signers can cooperatively sign messages on behalf of  ...  The first ID based threshold proxy signature scheme was proposed by Xu et al [16] in 2004 and the first ID-based designated verifier threshold proxy signature scheme was proposed by Juan et al [3]  ... 
arXiv:0806.1377v1 fatcat:f3mcqsmdbzacjjiq7hxykmketq

Secure Threshold Ring Signature Based on SM9

Shuanggen Liu, Kang Chen, Zikang Liu, Teng Wang
2021 IEEE Access  
FRAMEWORK OF ID-BASED THRESHOLD RING SIGNATURE An ID-based threshold ring signature scheme consists of four procedures: Setup, KeyGen, Sign, and Verify [31] .  ...  The identifier eid of the bilinear pair e. The homomorphic map ϕ from G 2 to G 1 . B.  ... 
doi:10.1109/access.2021.3094902 fatcat:ljxfcbdnrff6vpnmlu44pqqgci

Anonymous Cluster-Based MANETs with Threshold Signature

YoHan Park, YoungHo Park, SangJae Moon
2013 International Journal of Distributed Sensor Networks  
Moreover, we propose a threshold signature scheme without pairing computations, which diminishes the computation load on each node.  ...  In this paper, we propose a security system for ID-based anonymous cluster-based MANETs to protect the privacy of nodes.  ...  Moreover, our threshold scheme is comparable with existing threshold signatures in non-ID-based cryptosystem [16] . 6.3. Security 6.3.1. Privacy.  ... 
doi:10.1155/2013/374713 fatcat:2xnxkgvalrbx7bphrabbhjuisy

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.  ...  Acknowledgements The first author 1 is thankful to UGC, New Delhi, India for providing Rajiv Gandhi National Fellowship (F1-17.1/2010-13/RGNF-2012-13-ST-CHH-35416) as financial assistance for this Research  ... 
doi:10.14257/ijdta.2014.7.3.03 fatcat:7t46planqzhthog4xrelitdu5q

Robust ID-based threshold signcryption scheme from pairings

Shanshan Duan, Zhenfu Cao, Rongxing Lu
2004 Proceedings of the 3rd international conference on Information security - InfoSecu '04  
Recently bilinear pairings on elliptic curves have raised great interest in cryptographic comnmnity. BaKed oi, their good properties, many excellent ID-based cryptographic schemes have been proposed.  ...  To overcome this weakness, in this paper, we will use the threshold technology to devise a secure ID-based signcryption scheme.  ...  Since then, IDbased cryptography based on bilinear pairings has become all active area and inany identity-based schemes using pairings have been put forward [6, 7, 8, 9] .  ... 
doi:10.1145/1046290.1046298 fatcat:edlzazppofhubd3lllzwathdty

Cryptography Based on Bilinear Maps [chapter]

Tatsuaki Okamoto
2006 Lecture Notes in Computer Science  
The bilinear mapping technique that uses the (Weil and Tate) pairings over elliptic (or hyperelliptic) curves represents a great breakthrough in cryptography.  ...  This paper surveys this new trend in cryptography, and emphasizes the design of efficient cryptographic primitives that are provably secure in the standard model (i.e., without the random oracle model)  ...  Bilinear maps are exploiting a new methodology to design a practical IND-CCA2 secure PKE schemes in the standard model. The new methodology uses transformation from an IBE scheme to a PKE scheme.  ... 
doi:10.1007/11617983_3 fatcat:i2vlopqhzrd75ifndfdgnaszaa

A Survey on Proxy Re-Signature Schemes for Translating One Type of Signature to Another

Shilpa Chaudhari, R. Aparna, Archana Rane
2021 Cybernetics and Information Technologies  
and cannot produce new valid signature on new message for Alice or Bob.  ...  Blaze-Bleumer-Strauss discussed PRS in 1998 for translating a signature on a message from Alice into a signature from Bob on the same message at semi-trusted proxy which does not learn any signing-key  ...  Security is based on the CDH problem and has a fixed threshold value. Threshold based PRS protects the re-signature key from internal and external attacks.  ... 
doi:10.2478/cait-2021-0028 fatcat:47x4h2numbgx5duo6sdbcaqake
« Previous Showing results 1 — 15 out of 1,534 results