(Convertible) undeniable signatures without random oracles

Tsz Hon Yuen, Man Ho Au, Joseph K. Liu, Willy Susilo

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

15 Citations (Scopus)

Abstract

We propose a convertible undeniable signature scheme without random oracles. Our construction is based on Waters' and Kurosawa and Heng's schemes that were proposed in Eurocrypt 2005. The security of our scheme is based on the CDH and the decision linear assumption. Comparing only the part of undeniable signatures, our scheme uses more standard assumptions than the existing undeniable signatures without random oracles due to Laguillamie and Vergnaud.

Original languageEnglish
Title of host publicationInformation and Communications Security - 9th International Conference, ICICS 2007, Proceedings
Pages83-97
Number of pages15
Publication statusPublished - 1 Dec 2007
Externally publishedYes
Event9th International Conference on Information and Communications Security, ICICS 2007 - Zhengzhou, China
Duration: 12 Dec 200715 Dec 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4861 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Conference on Information and Communications Security, ICICS 2007
CountryChina
CityZhengzhou
Period12/12/0715/12/07

Keywords

  • Convertible undeniable signature
  • Pairings
  • Random oracle model

Cite this

Yuen, T. H., Au, M. H., Liu, J. K., & Susilo, W. (2007). (Convertible) undeniable signatures without random oracles. In Information and Communications Security - 9th International Conference, ICICS 2007, Proceedings (pp. 83-97). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4861 LNCS).
Yuen, Tsz Hon ; Au, Man Ho ; Liu, Joseph K. ; Susilo, Willy. / (Convertible) undeniable signatures without random oracles. Information and Communications Security - 9th International Conference, ICICS 2007, Proceedings. 2007. pp. 83-97 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{741345d358db48a6b2611b50157ea9ef,
title = "(Convertible) undeniable signatures without random oracles",
abstract = "We propose a convertible undeniable signature scheme without random oracles. Our construction is based on Waters' and Kurosawa and Heng's schemes that were proposed in Eurocrypt 2005. The security of our scheme is based on the CDH and the decision linear assumption. Comparing only the part of undeniable signatures, our scheme uses more standard assumptions than the existing undeniable signatures without random oracles due to Laguillamie and Vergnaud.",
keywords = "Convertible undeniable signature, Pairings, Random oracle model",
author = "Yuen, {Tsz Hon} and Au, {Man Ho} and Liu, {Joseph K.} and Willy Susilo",
year = "2007",
month = "12",
day = "1",
language = "English",
isbn = "9783540770473",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "83--97",
booktitle = "Information and Communications Security - 9th International Conference, ICICS 2007, Proceedings",

}

Yuen, TH, Au, MH, Liu, JK & Susilo, W 2007, (Convertible) undeniable signatures without random oracles. in Information and Communications Security - 9th International Conference, ICICS 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4861 LNCS, pp. 83-97, 9th International Conference on Information and Communications Security, ICICS 2007, Zhengzhou, China, 12/12/07.

(Convertible) undeniable signatures without random oracles. / Yuen, Tsz Hon; Au, Man Ho; Liu, Joseph K.; Susilo, Willy.

Information and Communications Security - 9th International Conference, ICICS 2007, Proceedings. 2007. p. 83-97 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4861 LNCS).

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

TY - GEN

T1 - (Convertible) undeniable signatures without random oracles

AU - Yuen, Tsz Hon

AU - Au, Man Ho

AU - Liu, Joseph K.

AU - Susilo, Willy

PY - 2007/12/1

Y1 - 2007/12/1

N2 - We propose a convertible undeniable signature scheme without random oracles. Our construction is based on Waters' and Kurosawa and Heng's schemes that were proposed in Eurocrypt 2005. The security of our scheme is based on the CDH and the decision linear assumption. Comparing only the part of undeniable signatures, our scheme uses more standard assumptions than the existing undeniable signatures without random oracles due to Laguillamie and Vergnaud.

AB - We propose a convertible undeniable signature scheme without random oracles. Our construction is based on Waters' and Kurosawa and Heng's schemes that were proposed in Eurocrypt 2005. The security of our scheme is based on the CDH and the decision linear assumption. Comparing only the part of undeniable signatures, our scheme uses more standard assumptions than the existing undeniable signatures without random oracles due to Laguillamie and Vergnaud.

KW - Convertible undeniable signature

KW - Pairings

KW - Random oracle model

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

M3 - Conference Paper

SN - 9783540770473

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 83

EP - 97

BT - Information and Communications Security - 9th International Conference, ICICS 2007, Proceedings

ER -

Yuen TH, Au MH, Liu JK, Susilo W. (Convertible) undeniable signatures without random oracles. In Information and Communications Security - 9th International Conference, ICICS 2007, Proceedings. 2007. p. 83-97. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).