Ring signatures without random oracles

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

doi:10.1145/1128817.1128861

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 proceeding › Conference Paper › Research › peer-review

80 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 language	English
Title of host publication	Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS '06
Place of Publication	New York NY USA
Publisher	Association for Computing Machinery (ACM)
Pages	297-302
Number of pages	6
ISBN (Print)	1595932720, 9781595932723
DOIs	https://doi.org/10.1145/1128817.1128861
Publication status	Published - 2006
Externally published	Yes
Event	ACM Symposium on Information, Computer and Communications Security 2006 - Taipei, Taiwan Duration: 21 Mar 2007 → 24 Mar 2007 Conference number: 1st https://dl.acm.org/doi/proceedings/10.1145/1128817

Conference

Conference	ACM Symposium on Information, Computer and Communications Security 2006
Abbreviated title	AsiaCCS 2006
Country/Territory	Taiwan
City	Taipei
Period	21/03/07 → 24/03/07
Internet address	https://dl.acm.org/doi/proceedings/10.1145/1128817

Keywords

Bilinear pairings
Random oracle model
Ring signature

Access to Document

10.1145/1128817.1128861

Cite this

@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",

note = "ACM Symposium on Information, Computer and Communications Security 2006, AsiaCCS 2006 ; Conference date: 21-03-2007 Through 24-03-2007",

url = "https://dl.acm.org/doi/proceedings/10.1145/1128817",

}

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 2006, 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. et al.
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 proceeding › Conference Paper › Research › peer-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

N1 - Conference code: 1st

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 - https://www.scopus.com/pages/publications/33845246483

U2 - 10.1145/1128817.1128861

DO - 10.1145/1128817.1128861

M3 - Conference Paper

AN - SCOPUS:33845246483

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

T2 - ACM Symposium on Information, Computer and Communications Security 2006

Y2 - 21 March 2007 through 24 March 2007

ER -

Ring signatures without random oracles

Abstract

Conference

Keywords

Access to Document

Other files and links

Cite this