In this work, we propose the first constructions of digital signature schemes that are secure in the auxiliary input model. Our main contribution is a digital signature scheme that is secure against chosen message attacks when given any exponentially hard-to-invert function of the secret key. As a second contribution, we construct a signature scheme that achieves security for random messages assuming that the adversary is given a polynomial-time hard-to-invert function (where both the challenge as well as the signatures seen prior to that are computed on random messages). Here, polynomial-hardness is required even when given the entire public-key. We further show that such signature schemes readily give us auxiliary input secure identification schemes.
Category / Keywords: public-key cryptography / leakage, auxiliary input, signature Date: received 30 Jan 2012, last revised 28 Jan 2015 Contact author: carmit hazay at biu ac il Available format(s): PDF | BibTeX Citation Version: 20150128:111400 (All versions of this report) Short URL: ia.cr/2012/045 Discussion forum: Show discussion | Start new discussion