Ring signatures without random oracles

Sherman S.M. Chow, Victor K. Wei, Joseph K. Liu, Tsz Hon Yuen

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

61 Citations (Scopus)

Abstract

Since the formalization of ring signature by Rivest, Shamir and Taumau in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the random oracle model for security proof. In this paper, we propose a ring signature scheme based on bilinear pairings, which is proven to be secure against adaptive chosen message attack without using the random oracle model. It is one of the first in the literature to achieve this security level.

Original languageEnglish
Title of host publicationProceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06
Place of PublicationNew York NY USA
PublisherAssociation for Computing Machinery (ACM)
Pages297-302
Number of pages6
ISBN (Print)1595932720, 9781595932723
DOIs
Publication statusPublished - 2006
Externally publishedYes
EventACM Symposium on Information, Computer and Communications Security, ASIACCS '06 - Taipei, Taiwan
Duration: 21 Mar 200724 Mar 2007

Conference

ConferenceACM Symposium on Information, Computer and Communications Security, ASIACCS '06
Abbreviated titleASIACCS '06
CountryTaiwan
CityTaipei
Period21/03/0724/03/07

Keywords

  • Bilinear pairings
  • Random oracle model
  • Ring signature

Cite this

Chow, S. S. M., Wei, V. K., Liu, J. K., & Yuen, T. H. (2006). Ring signatures without random oracles. In Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06 (pp. 297-302). New York NY USA : Association for Computing Machinery (ACM). https://doi.org/10.1145/1128817.1128861
Chow, Sherman S.M. ; Wei, Victor K. ; Liu, Joseph K. ; Yuen, Tsz Hon. / Ring signatures without random oracles. Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06. New York NY USA : Association for Computing Machinery (ACM), 2006. pp. 297-302
@inproceedings{540085bd0d254fcebcac67dcf15a38c0,
title = "Ring signatures without random oracles",
abstract = "Since the formalization of ring signature by Rivest, Shamir and Taumau in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the random oracle model for security proof. In this paper, we propose a ring signature scheme based on bilinear pairings, which is proven to be secure against adaptive chosen message attack without using the random oracle model. It is one of the first in the literature to achieve this security level.",
keywords = "Bilinear pairings, Random oracle model, Ring signature",
author = "Chow, {Sherman S.M.} and Wei, {Victor K.} and Liu, {Joseph K.} and Yuen, {Tsz Hon}",
year = "2006",
doi = "10.1145/1128817.1128861",
language = "English",
isbn = "1595932720",
pages = "297--302",
booktitle = "Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06",
publisher = "Association for Computing Machinery (ACM)",
address = "United States of America",

}

Chow, SSM, Wei, VK, Liu, JK & Yuen, TH 2006, Ring signatures without random oracles. in Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06. Association for Computing Machinery (ACM), New York NY USA , pp. 297-302, ACM Symposium on Information, Computer and Communications Security, ASIACCS '06, Taipei, Taiwan, 21/03/07. https://doi.org/10.1145/1128817.1128861

Ring signatures without random oracles. / Chow, Sherman S.M.; Wei, Victor K.; Liu, Joseph K.; Yuen, Tsz Hon.

Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06. New York NY USA : Association for Computing Machinery (ACM), 2006. p. 297-302.

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

TY - GEN

T1 - Ring signatures without random oracles

AU - Chow, Sherman S.M.

AU - Wei, Victor K.

AU - Liu, Joseph K.

AU - Yuen, Tsz Hon

PY - 2006

Y1 - 2006

N2 - Since the formalization of ring signature by Rivest, Shamir and Taumau in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the random oracle model for security proof. In this paper, we propose a ring signature scheme based on bilinear pairings, which is proven to be secure against adaptive chosen message attack without using the random oracle model. It is one of the first in the literature to achieve this security level.

AB - Since the formalization of ring signature by Rivest, Shamir and Taumau in 2001, there are lots of variations appeared in the literature. Almost all of the variations rely on the random oracle model for security proof. In this paper, we propose a ring signature scheme based on bilinear pairings, which is proven to be secure against adaptive chosen message attack without using the random oracle model. It is one of the first in the literature to achieve this security level.

KW - Bilinear pairings

KW - Random oracle model

KW - Ring signature

UR - http://www.scopus.com/inward/record.url?scp=33845246483&partnerID=8YFLogxK

U2 - 10.1145/1128817.1128861

DO - 10.1145/1128817.1128861

M3 - Conference Paper

SN - 1595932720

SN - 9781595932723

SP - 297

EP - 302

BT - Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06

PB - Association for Computing Machinery (ACM)

CY - New York NY USA

ER -

Chow SSM, Wei VK, Liu JK, Yuen TH. Ring signatures without random oracles. In Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06. New York NY USA : Association for Computing Machinery (ACM). 2006. p. 297-302 https://doi.org/10.1145/1128817.1128861