Certain applications require the ability to disclose part of the message to the server. We define partially blind password-based signatures and construct a scheme based that we prove secure, based on a novel computational problem related to computing discrete logarithms.
Our scheme is based on Nyberg-Rueppel signatures. We give a variant of Nyberg-Rueppel signatures that we prove secure based on our novel computational problem.
Unlike previous password-based signature schemes, our scheme can be instantiated using elliptic curve arithmetic over small prime fields. This is important for many applicationsCategory / Keywords: public-key cryptography / digital signatures, Nyberg-Rueppel Date: received 1 Aug 2013 Contact author: kristian gjosteen at math ntnu no Available format(s): PDF | BibTeX Citation Version: 20130803:051518 (All versions of this report) Short URL: ia.cr/2013/472 Discussion forum: Show discussion | Start new discussion