A lattice-based partially blind signature

Blind signature is a crucial technique to provide anonymity in many information systems such as e-cash, e-voting, and smart grid systems. Partially blind signature is a more applicable extension where the part of the message includes some common information known by the signer and the signature requestor. In the family of lattice-based schemes, blind signatures are given in ASIACRYPT 2010 by Ruckert in the random oracle model, and until now, no partially blind signatures are given. We here design the first scheme based on Lyubashevsky's signature scheme in EUROCRYPT 2012 and Abe and Okamoto's construction of partially blind signature in CRYPTO 2000 in the random oracle model. The scheme shows an alternative approach to achieve the blindness property without the supports of a commitment scheme and of a final round communication to confirm the validity of a signature. Copyright © 2016 John Wiley & Sons, Ltd.

[1]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[2]  David Chaum,et al.  Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[3]  Kui Ren,et al.  Distributed Privacy-Preserving Access Control in Sensor Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

[4]  Léo Ducas,et al.  Lattice Signatures and Bimodal Gaussians , 2013, IACR Cryptol. ePrint Arch..

[5]  Siu-Ming Yiu,et al.  Privacy-preserving advance power reservation , 2012, IEEE Communications Magazine.

[6]  Siu-Ming Yiu,et al.  Two Improved Partially Blind Signature Schemes from Bilinear Pairings , 2005, ACISP.

[7]  Markus Rückert,et al.  Lattice-based Blind Signatures , 2010, Algorithms and Number Theory.

[8]  Miklós Ajtai,et al.  Generating hard instances of lattice problems (extended abstract) , 1996, STOC '96.

[9]  Alon Rosen,et al.  SWIFFTX : A Proposal for the SHA-3 Standard , 2008 .

[10]  Amos Fiat,et al.  How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.

[11]  Tim Güneysu,et al.  Enhanced Lattice-Based Signatures on Reconfigurable Hardware , 2014, CHES.

[12]  Vadim Lyubashevsky,et al.  Lattice-Based Identification Schemes Secure Under Active Attacks , 2008, Public Key Cryptography.

[13]  Masayuki Abe,et al.  How to Date Blind Signatures , 1996, ASIACRYPT.

[14]  Vadim Lyubashevsky,et al.  Lattice Signatures Without Trapdoors , 2012, IACR Cryptol. ePrint Arch..

[15]  Markus Rückert,et al.  Lattice-based signature schemes with additional features , 2011 .

[16]  Tatsuaki Okamoto,et al.  Provably Secure Partially Blind Signatures , 2000, CRYPTO.

[17]  Mihir Bellare,et al.  Multi-signatures in the plain public-Key model and a general forking lemma , 2006, CCS '06.

[18]  Xiaofeng Chen,et al.  ID-based restrictive partially blind signatures and applications , 2007, J. Syst. Softw..

[19]  Keisuke Tanaka,et al.  Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems , 2008, ASIACRYPT.