Identity-Based Identification Scheme Secure against Concurrent-Reset Attacks without Random Oracles

摘要

The notion of identity-based cryptography was put forward by Shamir in 1984. This setting has also been considered in identification schemes. Since then, many identity-based identification schemes have been proposed. Nonetheless, most of them only resist against concurrent attacks. In this paper, we consider the most stringent attack in identification schemes, namely the reset attacks. The aim of this paper is to present the first identity-based identification scheme that is provably secure against concurrent-reset attacks (CR1) based on the 2-SDH assumption. We shall elaborate the 2-SDH assumption, which is weaker than the well known q-SDH assumption.