• DocumentCode
    3259919
  • Title

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

  • Author

    Jan, Jinn-Ke ; Tseng, Yuh-Min

  • Author_Institution
    Inst. of Appl. Math., Nat. Chung-Hsing Univ., Taichung, Taiwan
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    198
  • Lastpage
    203
  • 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
  • Keywords
    cryptography; security of data; cryptography; digital signature; discrete logarithm problem; secret keys; security; subliminal channels; Digital signatures; Electronic mail; Forgery; Mathematics; Narrowband; Security;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel Processing, 1999. Proceedings. 1999 International Workshops on
  • Conference_Location
    Aizu-Wakamatsu
  • ISSN
    1530-2016
  • Print_ISBN
    0-7695-0353-5
  • Type

    conf

  • DOI
    10.1109/ICPPW.1999.800062
  • Filename
    800062