Article
Licensed
Unlicensed
Requires Authentication
Key-escrow free multi-signature scheme using bilinear pairings
-
Manik Lal Das
Published/Copyright:
March 19, 2015
Abstract
We present a multi-signature scheme based on bilinear pairings. The scheme is key escrow-free and does not require any secure channel for private key issuance to users. We use a binding-blinding technique to avoid the key escrow problem and to eliminate a secure channel requirement for the key issuance stage. The basic scheme is extended to sequential and parallel multi-signature schemes. We show that the basic scheme and multi-signature schemes are secure against adaptive chosen message attacks under standard assumptions.
Received: 2014-2-21
Published Online: 2015-3-19
Published in Print: 2015-5-1
© 2015 by De Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Frontmatter
- Group extensions with special properties
- Symmetries of finite graphs and homology
- A fast search algorithm for 〈m,m,m〉 Triple Product Property triples and an application for 5×5 matrix multiplication
- Key-escrow free multi-signature scheme using bilinear pairings
- An application of elementary real analysis to a metabelian group admitting integral polynomial exponents
- On convex hulls and the quasiconvex subgroups of Fm×ℤn
- A linear decomposition attack
Keywords for this article
Digital signature;
multi-signature;
bilinear pairings;
key escrow;
chosen message attack
Articles in the same Issue
- Frontmatter
- Group extensions with special properties
- Symmetries of finite graphs and homology
- A fast search algorithm for 〈m,m,m〉 Triple Product Property triples and an application for 5×5 matrix multiplication
- Key-escrow free multi-signature scheme using bilinear pairings
- An application of elementary real analysis to a metabelian group admitting integral polynomial exponents
- On convex hulls and the quasiconvex subgroups of Fm×ℤn
- A linear decomposition attack
