Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes

Blömer, Johannes; Liske, Gennadij

doi:10.1007/978-3-319-29485-8_25

Cited by 11 publications

(10 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For most of the predicate families, the index sets are considered to be subsets of {j : j ∈ N i and i ∈ N}. The following definition of predicate family is adopted from [6,1]. Definition 2.2 (Predicate Family).…”

Section: Predicate Familymentioning

confidence: 99%

“…The number of pairing computations for this checking is nearly equal to the number of paring computations in CPA-decryption. Therefore, our direct CCA-secure construction of PE has far better performance than [6].…”

Section: Introductionmentioning

confidence: 99%

“…Recently, Blömer and Liske [6] proposed a direct CCA-secure construction of predicate encryptions from pair encodings without using the traditional approaches [49,50,33,34]. Their construction preserves the reduction cost of CPA-construction of [1].…”

Section: Introductionmentioning

confidence: 99%

“…In Table 1, we provide a comparison between the performance of the decrypt algorithm of our construction and that of the construction of Blömer et al [6]. Before applying the CPA-decrypt of [1], some sort of checking is run in the decrypt algorithm of both the constructions.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Efficient fully CCA-secure predicate encryptions from pair encodings

Nandi¹,

Pandit²

2022

AMC

View full text Add to dashboard Cite

Attrapadung (Eurocrypt 2014) proposed a generic framework for fully (adaptively) CPA-secure predicate encryption (PE) based on a new primitive, called pair encodings. Following the CCA conversions of Yamada et al. (PKC 2011, 2012) and Nandi et al. (ePrint Archive: 2015/457, AAECC 2018), one can have CCA-secure PE from CPA-secure PE if the primitive PE has either verifiability or delegation. These traditional approaches degrade the performance of the resultant CCA-secure PE scheme as compared to the primitive CPA-secure PE. As an alternative, we provide a direct fully secure CCA-construction of PE from the pair encoding scheme. This costs an extra computation of group element in encryption, three extra pairing computations and one re-randomization of key in decryption as compared to the CPA-construction of Attrapadung. Recently, Blömer et al. (CT-RSA 2016) proposed a direct CCA-secure construction of predicate encryptions from pair encodings. Although they did not use the aforementioned traditional approaches, a sort of verifiability checking is still involved in the CCA-decryption. The number of pairing computations for this checking is nearly equal to the number of paring computations in CPAdecryption. Therefore, the performance of our direct CCA-secure PE is far better than Blömer et al.

show abstract

Section: Predicate Familymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficient fully CCA-secure predicate encryptions from pair encodings

Nandi¹,

Pandit²

2022

AMC

View full text Add to dashboard Cite

show abstract

“…For most of the predicate families, the index sets are considered to be subsets of {j : j ∈ ℕ i and i ∈ ℕ}. The following definition of a predicate family is adopted from [1,7].…”

Section: Predicate Familymentioning

confidence: 99%

Predicate signatures from pair encodings via dual system proof technique

Nandi

Pandit

2019

Journal of Mathematical Cryptology

View full text Add to dashboard Cite

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.

show abstract

Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption

Koppula

Waters²

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes

Cited by 11 publications

References 20 publications

Efficient fully CCA-secure predicate encryptions from pair encodings

Efficient fully CCA-secure predicate encryptions from pair encodings

Predicate signatures from pair encodings via dual system proof technique

Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption

Contact Info

Product

Resources

About