Efficient round-optimal blind signatures in the standard model

Ghadafi, Essam

Abstract

Blind signatures are at the core of e-cash systems and has numerous other applications. In this work we construct efficient blind and partially blind signature schemes over bilinear groups in the standard model. Our schemes yield short signatures consisting of only a couple of elements from the shorter source group and have very short communication overhead consisting of $1$ group element on the user side and $3$ group elements on the signer side.
At $80$-bit security, our schemes yield signatures consisting of only $40$ bytes which is $67\%$ shorter than the most efficient existing scheme with the same security in the standard model. Verification in our schemes requires only a couple of pairings.
Our schemes compare favorably in every efficiency measure to all existing counterparts offering the same security in the standard model. In fact, the efficiency of our signing protocol as well as the signature size compare favorably even to many existing schemes in the random oracle model. For instance, our signatures are shorter than those of Brands' scheme which is at the heart of the U-Prove anonymous credential system used in practice. The unforgeability of our schemes is based on new intractability assumptions of a ``one-more'' type which we show are intractable in the generic group model, whereas their blindness holds w.r.t.~malicious signing keys in the information-theoretic sense. We also give variants of our schemes for a vector of messages.

• Publication Date: Apr 2, 2017
• Deposit Date: Mar 27, 2017
• Peer Reviewed: Peer Reviewed
• Volume: 10322
• Pages: 455-473
• Series Title: Lecture Notes in Computer Science
• Book Title: Financial Cryptography and Data Security
• ISBN: 9783319709710
• Keywords: blind signatures, round-optimal, partial blindness, e-cash
• Public URL: https://uwe-repository.worktribe.com/output/889625
• Contract Date: Mar 27, 2017