Lossy Identification Schemes from Decisional RSA

Abstract

Lossy identification schemes derive tightly secure signature schemes via the Fiat–Shamir transformation. There exist several instantiations of lossy identification schemes by using several cryptographic assumptions. In this paper, we propose a new construction of the lossy identification scheme from the decisional RSA assumption which are introduced by Groth. Our lossy identification scheme has an efficient response algorithm because it requires no modular exponentiation.