Paper 2017/953

Threshold Kleptographic Attacks on Discrete Logarithm Based Signatures

George Teseleanu

Abstract

In an $\ell$ out of $n$ threshold scheme, $\ell$ out of $n$ members must cooperate to recover a secret. A kleptographic attack is a backdoor which can be implemented in an algorithm and further used to retrieve a user's secret key. We combine the notions of threshold scheme and kleptographic attack to construct the first $\ell$ out of $n$ threshold kleptographic attack on discrete logarithm based digital signatures and prove its security in the standard and random oracle models.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Major revision.Latincrypt 2017
Keywords
public-key cryptographykleptographythreshold cryptographyinformation hiddingSETUP attacks
Contact author(s)
george teseleanu @ yahoo com
History
2022-03-15: last of 3 revisions
2017-09-27: received
See all versions
Short URL
https://ia.cr/2017/953
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2017/953,
      author = {George Teseleanu},
      title = {Threshold Kleptographic Attacks on Discrete Logarithm Based Signatures},
      howpublished = {Cryptology ePrint Archive, Paper 2017/953},
      year = {2017},
      note = {\url{https://eprint.iacr.org/2017/953}},
      url = {https://eprint.iacr.org/2017/953}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.