Paper 2017/801

Short Attribute-Based Signatures for Arbitrary Turing Machines from Standard Assumptions

Pratish Datta, Ratna Dutta, and Sourav Mukhopadhyay


This paper presents the first attribute-based signature (ABS) scheme supporting signing policies representable by Turing machines (TM), based on well-studied computational assumptions. Our work supports arbitrary TMs as signing policies in the sense that the TMs can accept signing attribute strings of unbounded polynomial length and there is no limit on their running time, description size, or space complexity. Moreover, we are able to achieve input-specific running time for the signing algorithm. All other known expressive ABS schemes could at most support signing policies realizable by either arbitrary polynomial-size circuits or TMs having a pre-determined upper bound on the running time. Consequently, those schemes can only deal with signing attribute strings whose lengths are a priori bounded, as well as suffers from the worst-case running time problem. On a more positive note, for the first time in the literature, the signature size of our ABS scheme only depends on the size of the signed message and is completely independent of the size of the signing policy under which the signature is generated. This is a significant achievement from the point of view of communication efficiency. Our ABS construction makes use of indistinguishability obfuscation (IO) for polynomial-size circuits and certain IO-compatible cryptographic tools. Note that, all of these building blocks including IO for polynomial-size circuits are currently known to be realizable under well-studied computational assumptions.

Note: The current version rewrites the abstract and introduction sections with regards to the recent advances in the associated fields.

Available format(s)
Public-key cryptography
Publication info
attribute-based signaturesTuring machinesindistinguishability obfuscation
Contact author(s)
pratishdatta @ gmail com
2020-12-08: last of 3 revisions
2017-08-28: received
See all versions
Short URL
Creative Commons Attribution


      author = {Pratish Datta and Ratna Dutta and Sourav Mukhopadhyay},
      title = {Short Attribute-Based Signatures for Arbitrary Turing Machines from Standard Assumptions},
      howpublished = {Cryptology ePrint Archive, Paper 2017/801},
      year = {2017},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.