Certificateless Ring Signature Scheme Based on Elliptic Curves

Certificateless ring signatures represent a unique fusion of certificateless public key cryptography and ring signature technology, effectively concealing the identity of the actual signer. To enhance efficiency, we propose a novel certificateless ring signature scheme based on elliptic curves. This scheme eliminates the need for a secure channel during key negotiation and has been proven unforgeable within the random oracle model. Performance analysis reveals that the proposed scheme requires only <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$2 n-1$</tex> scalar multiplications during the signing phase and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$2 n+1$</tex> scalar multiplications during the verification phase, where <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$n$</tex> denotes the number of ring members. The signature length is <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(n+1)|q|$</tex>. When compared to seven similar schemes, our proposal demonstrates the lowest computational cost and communication overhead.

Authors

Institutions

Publication Details

Published
2025-04-25
DOI
https://doi.org/10.1109/iccea65460.2025.11103029
Primary Topic
Cryptography and Residue Arithmetic
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Certificateless Ring Signature Scheme Based on Elliptic Curves

Zhenyang Yu, Zumeng LI, Zongren Chen, Zhimin Wang
Cryptography and Residue Arithmetic
article

Certificateless Ring Signature Scheme Based on Elliptic Curves

Zhenyang Yu, Zumeng LI, Zongren Chen, Zhimin Wang
article en

Abstract

Certificateless ring signatures represent a unique fusion of certificateless public key cryptography and ring signature technology, effectively concealing the identity of the actual signer. To enhance efficiency, we propose a novel certificateless ring signature scheme based on elliptic curves. This scheme eliminates the need for a secure channel during key negotiation and has been proven unforgeable within the random oracle model. Performance analysis reveals that the proposed scheme requires only <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$2 n-1$</tex> scalar multiplications during the signing phase and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$2 n+1$</tex> scalar multiplications during the verification phase, where <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$n$</tex> denotes the number of ring members. The signature length is <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$(n+1)|q|$</tex>. When compared to seven similar schemes, our proposal demonstrates the lowest computational cost and communication overhead.

Guangdong Polytechnic of Science and Technology (CN)
Openalex Percentile: Top 70%
Cryptography and Residue Arithmetic
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.