Linkable ring signature scheme based on multivariate polynomial over finite field

Ring signatures serve as a foundational tool for anonymous disclosure of confidential information. Moreover, they can also be customized for e-voting and e-cash with an extra property of linkability. It means that if a user signs more than once, all of his signatures can be linked. In this article, we propose the first linkable ring signature based on multivariate public key cryptography which can be useful against the quantum-equipped adversaries. The robustness of our proposed methodology relies on the computational complexity of multivariate quadratic problems. We deploy Sakumoto et al.'s zero-knowledge protocol and quantum secure Fiat-Shamir transformation for our construction. Our approach successfully fulfils all the requisites for a secure linkable ring signature such as unforgeability, anonymity, non-slanderability, and linkability.

Authors

Institutions

Publication Details

Journal
Advances in Mathematics of Communications
Published
2024-12-19
DOI
https://doi.org/10.3934/amc.2024055
Citations
1
Primary Topic
Polynomial and algebraic computation
Type
article
Field-Weighted Citation Impact
0.36
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Linkable ring signature scheme based on multivariate polynomial over finite field

Satyam Omar, Dhananjoy Dey, Sahadeo Padhye
1 citations
Advances in Mathematics of Communications
Polynomial and algebraic computation
0.36
article

Linkable ring signature scheme based on multivariate polynomial over finite field

Satyam Omar, Dhananjoy Dey, Sahadeo Padhye
article en
1 citations

Abstract

Ring signatures serve as a foundational tool for anonymous disclosure of confidential information. Moreover, they can also be customized for e-voting and e-cash with an extra property of linkability. It means that if a user signs more than once, all of his signatures can be linked. In this article, we propose the first linkable ring signature based on multivariate public key cryptography which can be useful against the quantum-equipped adversaries. The robustness of our proposed methodology relies on the computational complexity of multivariate quadratic problems. We deploy Sakumoto et al.'s zero-knowledge protocol and quantum secure Fiat-Shamir transformation for our construction. Our approach successfully fulfils all the requisites for a secure linkable ring signature such as unforgeability, anonymity, non-slanderability, and linkability.

Advances in Mathematics of CommunicationsVol. 19(5)
Motilal Nehru National Institute of Technology (IN), Indian Institute of Information Technology Allahabad (IN), Indian Institute of Management Lucknow (IN)
Openalex Percentile: Top 33%
Polynomial and algebraic computation
0.36
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.