Efficient verifiably encrypted signatures from lattices

Kee Sung Kim, ik rae Jeong

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Verifiably encrypted signature schemes can convince a verifier that a given ciphertext is an encryption of an ordinary signature on a given message and the ordinary signature can be recovered by the third party, called adjudicator. In 2010, Rückert et al. proposed a general construction for the verifiably encrypted signatures, and then, they also showed that there exist the lattice-based verifiably encrypted signature schemes. Their constructions are very insightful, but their schemes need an extra adjudication setup phase and Merkle trees, so they have large parameters and keys, that is, they are inefficient. Also, their schemes provide only the limited signature capacity because the signing keys should be reissued after generating kth verifiably encrypted signatures. To overcome the weaknesses of Rückert et al.'s scheme, we construct a verifiably encrypted signature scheme based on the hard lattice problems. Our scheme provides the full functionality, i.e., the signatures can be generated without any limitations and does not need any extra adjudication setup phases. Moreover, the size of the secret keys in our scheme is constant. Our scheme provides unforgeability, opacity, extractability, and abuse-freeness in the random oracle model.

Original languageEnglish
Pages (from-to)305-314
Number of pages10
JournalInternational Journal of Information Security
Volume13
Issue number4
DOIs
Publication statusPublished - 2014 Jan 1

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Information Systems
  • Safety, Risk, Reliability and Quality

Fingerprint Dive into the research topics of 'Efficient verifiably encrypted signatures from lattices'. Together they form a unique fingerprint.

  • Cite this