Get 20M+ Full-Text Papers For Less Than $1.50/day. Subscribe now for You or Your Team.

Learn More →

Key-escrow free multi-signature scheme using bilinear pairings

Key-escrow free multi-signature scheme using bilinear pairings 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Key-escrow free multi-signature scheme using bilinear pairings

Groups Complexity Cryptology , Volume 7 (1) – May 1, 2015

Loading next page...
 
/lp/de-gruyter/key-escrow-free-multi-signature-scheme-using-bilinear-pairings-Hp96tWWXg2

References (24)

Publisher
de Gruyter
Copyright
Copyright © 2015 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2015-0002
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Groups Complexity Cryptologyde Gruyter

Published: May 1, 2015

There are no references for this article.