ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Predicate signatures from pair encodings via dual system proof technique

Nandi, M and Pandit, T (2019) Predicate signatures from pair encodings via dual system proof technique. In: Journal of Mathematical Cryptology .

jou_mat_cry_2019.pdf - Published Version

Download (1MB) | Preview
Official URL: https://doi.org/10.1515/jmc-2017-0007


Recently, Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) secure predicate encryption (PE) based on a new primitive, called pair encodings. The author shows that if the underlying pair encoding scheme is either perfectly secure or computationally (doubly-selectively) secure, then the PE scheme will be fully secure. Although the pair encodings were solely introduced for PE, we show that these can also be used to construct predicate signatures, a signature analogue of PE. More precisely, we propose a generic construction of predicate signature (PS) from pair encoding schemes. Our construction provides unconditional signer privacy, and unforgeability in the adaptive model. Thereafter, we instantiate many PS schemes with new results, e.g., the first practical PS schemes for regular languages, the first attribute-based signature (ABS) scheme with constant-size signatures in the adaptive model, unbounded ABS with large universes in key-policy flavor, etc.

Item Type: Journal Article
Publication: Journal of Mathematical Cryptology
Publisher: De Gruyter
Additional Information: The copyright for this article belongs to the Authors.
Keywords: adaptive unforgeability; Pair encodings; perfect privacy; predicate signatures
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 27 Oct 2022 08:07
Last Modified: 27 Oct 2022 08:07
URI: https://eprints.iisc.ac.in/id/eprint/77596

Actions (login required)

View Item View Item