Storage Friendly Provably Secure Multivariate Identity-Based Signature from Isomorphism of Polynomials Problem

Ratna Dutta, Sumit Debnath, Chinmoy Biswas

2021

Abstract

Multivariate public key cryptosystem (MPKC) is one of the promising candidates for post-quantum cryptography (PQC) as it features fast and efficient computation with security under the NP hardness of solving a system of multivariate quadratic (MQ) polynomial equations over a finite field. In the last two decades, there have been remarkable development in MPKC specially in signature and encryption scheme. In this work, we have developed a multivariate identity-based signature (MV-IBS) scheme employing a specialized version of non-interactive zero-knowledge proofs of knowledge (NIZK). Our construction is existentially unforgeable against chosen message and chosen identity attack (EUF-CMA) in the random oracle model (ROM) under the hardness of the isomorphism of polynomials (IP) problem. An IP problem tests the equivalence of two polynomial maps. It says that given access to two quadratic functions which are equal up to linear changes of coordinates, it is difficult to compute these changes of coordinates. We emphasize that unlike most of the MPKC, our scheme achieves provable security in an existing security framework. Additionally, the proposed IBS performs better over the existing works in terms of user’s secret key size, master public key size and master secret key size.

Paper Citation

in Harvard Style

Dutta R., Debnath S. and Biswas C. (2021). Storage Friendly Provably Secure Multivariate Identity-Based Signature from Isomorphism of Polynomials Problem. In Proceedings of the 18th International Conference on Security and Cryptography - Volume 1: SECRYPT, ISBN 978-989-758-524-1, pages 595-602. DOI: 10.5220/0010580505950602

in Bibtex Style

@conference{secrypt21,
author={Ratna Dutta and Sumit Debnath and Chinmoy Biswas},
title={Storage Friendly Provably Secure Multivariate Identity-Based Signature from Isomorphism of Polynomials Problem},
booktitle={Proceedings of the 18th International Conference on Security and Cryptography - Volume 1: SECRYPT,},
year={2021},
pages={595-602},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010580505950602},
isbn={978-989-758-524-1},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 18th International Conference on Security and Cryptography - Volume 1: SECRYPT,
TI - Storage Friendly Provably Secure Multivariate Identity-Based Signature from Isomorphism of Polynomials Problem
SN - 978-989-758-524-1
AU - Dutta R.
AU - Debnath S.
AU - Biswas C.
PY - 2021
SP - 595
EP - 602
DO - 10.5220/0010580505950602