Tagged One-Time Signatures: Tight Security and Optimal Tag Size

  • Masayuki Abe
  • Bernardo David
  • Markulf Kohlweiss
  • Ryo Nishimaki
  • Miyako Ohkubo
Conference paper

DOI: 10.1007/978-3-642-36362-7_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7778)
Cite this paper as:
Abe M., David B., Kohlweiss M., Nishimaki R., Ohkubo M. (2013) Tagged One-Time Signatures: Tight Security and Optimal Tag Size. In: Kurosawa K., Hanaoka G. (eds) Public-Key Cryptography – PKC 2013. Lecture Notes in Computer Science, vol 7778. Springer, Berlin, Heidelberg

Abstract

We present an efficient structure-preserving tagged one-time signature scheme with tight security reductions to the decision-linear assumption. Our scheme features short tags consisting of a single group element and gives rise to the currently most efficient structure-preserving signature scheme based on the decision-liner assumption with constant-size signatures of only 14 group elements, where the record-so-far was 17 elements.

To demonstrate the advantages of our scheme, we revisit the work by Hofheinz and Jager (CRYPTO 2012) and present the currently most efficient tightly secure public-key encryption scheme. We also obtain the first structure-preserving public-key encryption scheme featuring both tight security and public verifiability.

Keywords

Tagged One-Time Signatures Structure-Preserving Signatures Tight Security Reduction Decision Linear Assumption 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© International Association for Cryptologic Research 2013

Authors and Affiliations

  • Masayuki Abe
    • 1
  • Bernardo David
    • 2
  • Markulf Kohlweiss
    • 3
  • Ryo Nishimaki
    • 1
  • Miyako Ohkubo
    • 4
  1. 1.NTT Secure Platform LaboratoriesJapan
  2. 2.University of BrasiliaBrazil
  3. 3.Microsoft ResearchCambridgeUK
  4. 4.Security Architecture Laboratory, NSRINICTJapan

Personalised recommendations