New digital signature with subliminal channels based on the discrete logarithm problem

Jinn Ke Jan, Yuh-Min Tseng

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Citations (Scopus)

Abstract

A digital signature with a subliminal channel, that allows a signer to embed subliminal messages in the digital signature. Any receivers may verify the signature, but can not discover the subliminal messages, only authorized receivers can extract the subliminal messages. In this paper we propose two digital signature schemes with subliminal channels based on discrete logarithms. Both schemes allow a signer to generate a digital signature, which may contain two or more subliminal messages for various subliminal receivers. Compared to the previously proposed schemes, both our schemes greatly reduce the size of secret keys that must be kept by the signer and the subliminal receiver; as well as the length of the digital signature. The security of the proposed schemes is based on the difficulty of computing the discrete logarithm problem.

Original languageEnglish
Title of host publicationProceedings - 1999 lnternational Workshops on Parallel Processing, ICPP 1999
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages198-203
Number of pages6
Volume1999-September
ISBN (Electronic)0769503535
DOIs
Publication statusPublished - 1999 Jan 1
Event1999 lnternational Workshops on Parallel Processing, ICPP 1999 - Aizu-Wakamatsu, Japan
Duration: 1999 Sep 24 → …

Other

Other1999 lnternational Workshops on Parallel Processing, ICPP 1999
CountryJapan
CityAizu-Wakamatsu
Period99-09-24 → …

Fingerprint

Discrete Logarithm Problem
Electronic document identification systems
Digital Signature
Receiver
Discrete Logarithm
Signature Scheme
Signature
Verify
Computing

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this

Jan, J. K., & Tseng, Y-M. (1999). New digital signature with subliminal channels based on the discrete logarithm problem. In Proceedings - 1999 lnternational Workshops on Parallel Processing, ICPP 1999 (Vol. 1999-September, pp. 198-203). [800062] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPPW.1999.800062
Jan, Jinn Ke ; Tseng, Yuh-Min. / New digital signature with subliminal channels based on the discrete logarithm problem. Proceedings - 1999 lnternational Workshops on Parallel Processing, ICPP 1999. Vol. 1999-September Institute of Electrical and Electronics Engineers Inc., 1999. pp. 198-203
@inproceedings{97f67a07ef734588bffeba7a2a64cd08,
title = "New digital signature with subliminal channels based on the discrete logarithm problem",
abstract = "A digital signature with a subliminal channel, that allows a signer to embed subliminal messages in the digital signature. Any receivers may verify the signature, but can not discover the subliminal messages, only authorized receivers can extract the subliminal messages. In this paper we propose two digital signature schemes with subliminal channels based on discrete logarithms. Both schemes allow a signer to generate a digital signature, which may contain two or more subliminal messages for various subliminal receivers. Compared to the previously proposed schemes, both our schemes greatly reduce the size of secret keys that must be kept by the signer and the subliminal receiver; as well as the length of the digital signature. The security of the proposed schemes is based on the difficulty of computing the discrete logarithm problem.",
author = "Jan, {Jinn Ke} and Yuh-Min Tseng",
year = "1999",
month = "1",
day = "1",
doi = "10.1109/ICPPW.1999.800062",
language = "English",
volume = "1999-September",
pages = "198--203",
booktitle = "Proceedings - 1999 lnternational Workshops on Parallel Processing, ICPP 1999",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

Jan, JK & Tseng, Y-M 1999, New digital signature with subliminal channels based on the discrete logarithm problem. in Proceedings - 1999 lnternational Workshops on Parallel Processing, ICPP 1999. vol. 1999-September, 800062, Institute of Electrical and Electronics Engineers Inc., pp. 198-203, 1999 lnternational Workshops on Parallel Processing, ICPP 1999, Aizu-Wakamatsu, Japan, 99-09-24. https://doi.org/10.1109/ICPPW.1999.800062

New digital signature with subliminal channels based on the discrete logarithm problem. / Jan, Jinn Ke; Tseng, Yuh-Min.

Proceedings - 1999 lnternational Workshops on Parallel Processing, ICPP 1999. Vol. 1999-September Institute of Electrical and Electronics Engineers Inc., 1999. p. 198-203 800062.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - New digital signature with subliminal channels based on the discrete logarithm problem

AU - Jan, Jinn Ke

AU - Tseng, Yuh-Min

PY - 1999/1/1

Y1 - 1999/1/1

N2 - A digital signature with a subliminal channel, that allows a signer to embed subliminal messages in the digital signature. Any receivers may verify the signature, but can not discover the subliminal messages, only authorized receivers can extract the subliminal messages. In this paper we propose two digital signature schemes with subliminal channels based on discrete logarithms. Both schemes allow a signer to generate a digital signature, which may contain two or more subliminal messages for various subliminal receivers. Compared to the previously proposed schemes, both our schemes greatly reduce the size of secret keys that must be kept by the signer and the subliminal receiver; as well as the length of the digital signature. The security of the proposed schemes is based on the difficulty of computing the discrete logarithm problem.

AB - A digital signature with a subliminal channel, that allows a signer to embed subliminal messages in the digital signature. Any receivers may verify the signature, but can not discover the subliminal messages, only authorized receivers can extract the subliminal messages. In this paper we propose two digital signature schemes with subliminal channels based on discrete logarithms. Both schemes allow a signer to generate a digital signature, which may contain two or more subliminal messages for various subliminal receivers. Compared to the previously proposed schemes, both our schemes greatly reduce the size of secret keys that must be kept by the signer and the subliminal receiver; as well as the length of the digital signature. The security of the proposed schemes is based on the difficulty of computing the discrete logarithm problem.

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

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

U2 - 10.1109/ICPPW.1999.800062

DO - 10.1109/ICPPW.1999.800062

M3 - Conference contribution

AN - SCOPUS:0042363960

VL - 1999-September

SP - 198

EP - 203

BT - Proceedings - 1999 lnternational Workshops on Parallel Processing, ICPP 1999

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Jan JK, Tseng Y-M. New digital signature with subliminal channels based on the discrete logarithm problem. In Proceedings - 1999 lnternational Workshops on Parallel Processing, ICPP 1999. Vol. 1999-September. Institute of Electrical and Electronics Engineers Inc. 1999. p. 198-203. 800062 https://doi.org/10.1109/ICPPW.1999.800062