Practical Signatures from Standard Assumptions

  • Florian Böhl
  • Dennis Hofheinz
  • Tibor Jager
  • Jessica Koch
  • Jae Hong Seo
  • Christoph Striecks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7881)

Abstract

We put forward new techniques for designing signature schemes. As a result, we present practical signature schemes based on the CDH, the RSA, and the SIS assumptions. Our schemes compare favorably with existing schemes based on these assumptions.

Our core idea is the use of tag-based signatures. Concretely, each signatures contains a tag which is uniformly chosen from a suitable tag set. Intuitively, the tag provides a way to embed instances of computational problems. Indeed, carefully choosing these tag spaces provides new ways to partition the set of possible message-tag pairs into “signable” and “unsignable” pairs. In our security proof, we will thus be able to sign all adversarially requested messages, and at the same time use an adversarially generated forgery with suitably large probability.

Keywords

digital signatures CDH assumption pairing-friendly groups RSA assumption SIS assumption 

Copyright information

© International Association for Cryptologic Research 2013

Authors and Affiliations

  • Florian Böhl
    • 1
  • Dennis Hofheinz
    • 1
  • Tibor Jager
    • 2
  • Jessica Koch
    • 1
  • Jae Hong Seo
    • 3
  • Christoph Striecks
    • 1
  1. 1.Karlsruhe Institute of TechnologyKarlsruheGermany
  2. 2.Ruhr-Universität BochumBochumGermany
  3. 3.Myongji UniversityYonginRepublic of Korea

Personalised recommendations