Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders

Ingrid Biehl, Sacher Paulus, Tsuyoshi Takagi

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

In undeniable signature schemes the correctness or incorrectness of a signature of some message cannot be checked without the agreement of and the interaction with the signer. This is a favorable property for some applications. Well-known undeniable signature schemes presented in the literature will cause operations for the signer which take cubic running time. For a real world implementation, e.g., on a chip card or a web server this might be too inefficient. In this paper, we present new efficient undeniable signature schemes which are constructed over an imaginary quadratic field. We compare our schemes to the only really competitive scheme so far, which is based on RSA. In all signature protocols presented here the signer's part involving the secret key is always of quadratic complexity, which is much faster in practice than the signer's part in the RSA-based undeniable signature protocol.

Original languageEnglish
Pages (from-to)99-123
Number of pages25
JournalDesigns, Codes, and Cryptography
Volume31
Issue number2
DOIs
Publication statusPublished - Feb 1 2004

Fingerprint

Undeniable Signature
Signature Scheme
Network protocols
Signature
Servers
Imaginary Quadratic Field
Web Server
Correctness
Chip
Interaction

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Applied Mathematics

Cite this

Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders. / Biehl, Ingrid; Paulus, Sacher; Takagi, Tsuyoshi.

In: Designs, Codes, and Cryptography, Vol. 31, No. 2, 01.02.2004, p. 99-123.

Research output: Contribution to journalArticle

Biehl, Ingrid ; Paulus, Sacher ; Takagi, Tsuyoshi. / Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders. In: Designs, Codes, and Cryptography. 2004 ; Vol. 31, No. 2. pp. 99-123.
@article{d601d5eb43d0481eb3a71ee397da4e10,
title = "Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders",
abstract = "In undeniable signature schemes the correctness or incorrectness of a signature of some message cannot be checked without the agreement of and the interaction with the signer. This is a favorable property for some applications. Well-known undeniable signature schemes presented in the literature will cause operations for the signer which take cubic running time. For a real world implementation, e.g., on a chip card or a web server this might be too inefficient. In this paper, we present new efficient undeniable signature schemes which are constructed over an imaginary quadratic field. We compare our schemes to the only really competitive scheme so far, which is based on RSA. In all signature protocols presented here the signer's part involving the secret key is always of quadratic complexity, which is much faster in practice than the signer's part in the RSA-based undeniable signature protocol.",
author = "Ingrid Biehl and Sacher Paulus and Tsuyoshi Takagi",
year = "2004",
month = "2",
day = "1",
doi = "10.1023/B:DESI.0000012439.20075.16",
language = "English",
volume = "31",
pages = "99--123",
journal = "Designs, Codes, and Cryptography",
issn = "0925-1022",
publisher = "Springer Netherlands",
number = "2",

}

TY - JOUR

T1 - Efficient Undeniable Signature Schemes Based on Ideal Arithmetic in Quadratic Orders

AU - Biehl, Ingrid

AU - Paulus, Sacher

AU - Takagi, Tsuyoshi

PY - 2004/2/1

Y1 - 2004/2/1

N2 - In undeniable signature schemes the correctness or incorrectness of a signature of some message cannot be checked without the agreement of and the interaction with the signer. This is a favorable property for some applications. Well-known undeniable signature schemes presented in the literature will cause operations for the signer which take cubic running time. For a real world implementation, e.g., on a chip card or a web server this might be too inefficient. In this paper, we present new efficient undeniable signature schemes which are constructed over an imaginary quadratic field. We compare our schemes to the only really competitive scheme so far, which is based on RSA. In all signature protocols presented here the signer's part involving the secret key is always of quadratic complexity, which is much faster in practice than the signer's part in the RSA-based undeniable signature protocol.

AB - In undeniable signature schemes the correctness or incorrectness of a signature of some message cannot be checked without the agreement of and the interaction with the signer. This is a favorable property for some applications. Well-known undeniable signature schemes presented in the literature will cause operations for the signer which take cubic running time. For a real world implementation, e.g., on a chip card or a web server this might be too inefficient. In this paper, we present new efficient undeniable signature schemes which are constructed over an imaginary quadratic field. We compare our schemes to the only really competitive scheme so far, which is based on RSA. In all signature protocols presented here the signer's part involving the secret key is always of quadratic complexity, which is much faster in practice than the signer's part in the RSA-based undeniable signature protocol.

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

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

U2 - 10.1023/B:DESI.0000012439.20075.16

DO - 10.1023/B:DESI.0000012439.20075.16

M3 - Article

AN - SCOPUS:1242307426

VL - 31

SP - 99

EP - 123

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

SN - 0925-1022

IS - 2

ER -