Predicate signatures from pair encodings via dual system proof technique

• Main Authors: Nandi Mridul, Pandit Tapas
• Format: Article
• Language: English
• Published: De Gruyter 2019-10-01
• Series: Journal of Mathematical Cryptology
• Subjects: pair encodings; predicate signatures; perfect privacy; adaptive unforgeability; 11t71; 94a60; 94a62; 14g50
• Online Access: 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.