A lattice‐based partially blind signature. Issue 12 (11th February 2016)

• Record Type: Journal Article
• Authors: Tian, Haibo; Zhang, Fangguo; Wei, Baodian
• Other Names: Jiang Shaoquan guestEditor.; Takagi Tsuyoshi guestEditor.; Wang Guilin guestEditor.
• Is Part Of: Security and communication networks. Volume 9:Issue 12(2016)
• Page Start: 1820
• Page End: 1828
• Publication Date: 2016-02-11
• Subjects: lattice -- signature schemes -- partially blindness; Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.1439
• Languages: English
• ISSNs: 1939-0114

Abstract

Abstract: 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 R ü ckert 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. Abstract : This paper proposed a round‐efficient partially blind signature (PBS) based on lattice problems. It normally needs three rounds to produce a PBS. An independent exception procedure is employed to replace unqualified signatures with qualified ones.