Cover Image

Short attribute-based signatures for arbitrary Turing machines from standard assumptions

CC BY

Saved in:
Bibliographic Details
Main Authors: Pratish, Datta, Ratna, Dutta, Sourav, Mukhopadhyay
Format: Book
Language:English
Published: Springer 2023
Subjects:
ABS
TM
Online Access:https://link.springer.com/article/10.1007/s10623-022-01163-8
https://dlib.phenikaa-uni.edu.vn/handle/PNK/8317
Tags: Add Tag
No Tags, Be the first to tag this record!
id oai:localhost:PNK-8317
record_format dspace
spelling oai:localhost:PNK-83172023-04-26T02:56:12Z Short attribute-based signatures for arbitrary Turing machines from standard assumptions Pratish, Datta Ratna, Dutta Sourav, Mukhopadhyay ABS TM CC BY 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. 2023-04-26T02:56:12Z 2023-04-26T02:56:12Z 2023 Book https://link.springer.com/article/10.1007/s10623-022-01163-8 https://dlib.phenikaa-uni.edu.vn/handle/PNK/8317 en application/pdf Springer
institution Digital Phenikaa
collection Digital Phenikaa
language English
topic ABS
TM
spellingShingle ABS
TM
Pratish, Datta
Ratna, Dutta
Sourav, Mukhopadhyay
Short attribute-based signatures for arbitrary Turing machines from standard assumptions
description CC BY
format Book
author Pratish, Datta
Ratna, Dutta
Sourav, Mukhopadhyay
author_facet Pratish, Datta
Ratna, Dutta
Sourav, Mukhopadhyay
author_sort Pratish, Datta
title Short attribute-based signatures for arbitrary Turing machines from standard assumptions
title_short Short attribute-based signatures for arbitrary Turing machines from standard assumptions
title_full Short attribute-based signatures for arbitrary Turing machines from standard assumptions
title_fullStr Short attribute-based signatures for arbitrary Turing machines from standard assumptions
title_full_unstemmed Short attribute-based signatures for arbitrary Turing machines from standard assumptions
title_sort short attribute-based signatures for arbitrary turing machines from standard assumptions
publisher Springer
publishDate 2023
url https://link.springer.com/article/10.1007/s10623-022-01163-8
https://dlib.phenikaa-uni.edu.vn/handle/PNK/8317
_version_ 1764268033768947712
score 8.881002

Similar Items