Chatterjee, S and Pandit, T (2022) Efficient IBS from a New Assumption in the Multivariate-Quadratic Setting. In: 23rd International Conference on Cryptology, INDOCRYPT 2022, 11- 14 December 2022, Kolkata, pp. 679-696.
Full text not available from this repository. (Request a copy)Abstract
Since its introduction in 1984, identity-based signature (IBS) schemes have been studied in different settings. But, there are very few constructions available in the multivariate quadratic polynomials (MQ) setting. The existing IBS schemes in the MQ-setting are either less efficient or do not have any formal security reduction. In this paper, we investigate the problem of constructing an efficient and provably secure IBS scheme in the MQ-setting. Our starting point is the recent IBS scheme of Chen et al. which is very efficient but has some issues related to correctness and lacks a formal justification of security. We propose a modified construction that addresses the limitations of the Chen et al. proposal while retaining its efficiency. For the security reduction, we introduce a new cryptographic parameterized assumption in the MQ-setting. Our modified proposal allows any arbitrary bit string to be an identity and the size of the public parameters does not depend on the size of the universe of identities in contrast to the original proposal. Therefore, our modified scheme works as an unbounded IBS. Finally, we provide some justification towards the intractability of the newly introduced assumption.
| Item Type: | Conference Paper |
|---|---|
| Publication: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Publisher: | Springer Science and Business Media Deutschland GmbH |
| Additional Information: | The copyright for this article belongs to Springer Science and Business Media Deutschland GmbH. |
| Keywords: | Authentication, Formal security; Identity based signature; Identity-based signature scheme; Multivariate cryptography; Multivariate quadratics; Post-quantum securities; Provable security; Provably secure; Quadratic polynomial; Security reduction, Cryptography |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 25 Feb 2023 08:32 |
| Last Modified: | 25 Feb 2023 08:32 |
| URI: | https://eprints.iisc.ac.in/id/eprint/80706 |
Actions (login required)
 |
View Item |
