Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Groups Complexity Cryptology

Managing Editor: Shpilrain, Vladimir / Weil, Pascal

Editorial Board: Ciobanu, Laura / Conder, Marston / Eick, Bettina / Elder, Murray / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Perret, Ludovic / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura / Lohrey, Markus

CiteScore 2018: 0.80

SCImago Journal Rank (SJR) 2018: 0.368
Source Normalized Impact per Paper (SNIP) 2018: 1.061

Mathematical Citation Quotient (MCQ) 2018: 0.38

See all formats and pricing
More options …

Key-escrow free multi-signature scheme using bilinear pairings

Manik Lal Das
Published Online: 2015-03-19 | DOI: https://doi.org/10.1515/gcc-2015-0002


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.

Keywords: Digital signature; multi-signature; bilinear pairings; key escrow; chosen message attack

MSC: 94A60; 11Z05

About the article

Received: 2014-02-21

Published Online: 2015-03-19

Published in Print: 2015-05-01

Citation Information: Groups Complexity Cryptology, Volume 7, Issue 1, Pages 47–57, ISSN (Online) 1869-6104, ISSN (Print) 1867-1144, DOI: https://doi.org/10.1515/gcc-2015-0002.

Export Citation

© 2015 by De Gruyter.Get Permission

Comments (0)

Please log in or register to comment.
Log in