Verifiable Predicate Encryption and Applications to CCA Security and Anonymous Predicate Authentication

Yamada, Shota; Attrapadung, Nuttapong; Santoso, Bagus; Schuldt, Jacob C. N.; Hanaoka, Goichiro; Kunihiro, Noboru

doi:10.1007/978-3-642-30057-8_15

Cited by 27 publications

(11 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Anonymous Deniable Predicate Authentication. We should refer to the work of Yamada et al [24] of verifiable predicate encryption. As an application, they provided an anonymous deniable message authentication scheme.…”

Section: Related Workmentioning

confidence: 99%

Attribute-Based Identification: Definitions and Efficient Constructions

Anada

Arita

Handa

et al. 2014

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

Hiroaki ANADA †, † †a) , Seiko ARITA †b) , Members, Sari HANDA †c) , and Yosuke IWABUCHI †d) , Nonmembers SUMMARY We propose a notion of attribute-based identification (ABID) in two flavors: prover-policy ABID (PP-ABID) and verifier-policy ABID (VP-ABID). In a PP-ABID scheme, a prover has an authorized access policy written as a boolean formula over attributes, while each verifier maintains a set of attributes. The prover is accepted when his access policy fits the verifier's set of attributes. In a VP-ABID scheme, a verifier maintains an access policy written as a boolean formula over attributes, while each prover has a set of authorized attributes. The prover is accepted when his set of attributes satisfies the verifier's access policy. Our design principle is first to construct key-policy and ciphertext-policy attribute-based key encapsulation mechanisms (KP-ABKEM and CP-ABKEM). Second, we convert KP-ABKEM and CP-ABKEM into challenge-and-response PP-ABID and VP-ABID, respectively, by encapsulation-and-decapsulation. There, we show that KP-ABKEM and CP-ABKEM only have to be secure against chosen-ciphertext attacks on one-wayness (OW-CCA secure) for the obtained PP-ABID and VP-ABID to be secure against concurrent manin-the-middle attacks (cMiM secure). According to the design principle, we construct concrete KP-ABKEM and CP-ABKEM with the OW-CCA security by enhancing the KP-ABKEM of Ostrovsky, Sahai and Waters and CP-ABKEM of Waters, respectively. Finally, we obtain concrete PP-ABID and VP-ABID schemes that are proved to be selectively secure in the standard model against cMiM attacks.

show abstract

Section: Related Workmentioning

confidence: 99%

Attribute-Based Identification: Definitions and Efficient Constructions

Anada

Arita

Handa

et al. 2014

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

show abstract

“…First, we should refer to the work of Yamada et al [16]. Our generic construction of ABID can be considered as a special case of their predicate authentication; however, it differs in at least two points.…”

Section: Related Workmentioning

confidence: 99%

Attribute-Based Identification: Definitions and Efficient Constructions

Anada

Arita

Handa

et al. 2013

Information Security and Privacy

View full text Add to dashboard Cite

Abstract. We propose a notion of attribute-based identification (ABID) in two flavors: prover-policy ABID (PP-ABID) and verifierpolicy ABID (VP-ABID). In a PP-ABID scheme, a prover has an authorized access policy written as a boolean formula over attributes, while each verifier maintains a set of attributes. The prover is accepted when his access policy fits the verifier's set of attributes. In a VP-ABID scheme, a verifier maintains an access policy written as a boolean formula over attributes, while each prover has a set of authorized attributes. The prover is accepted when his set of attributes satisfies the verifier's access policy. Our design principle is first to construct keypolicy and ciphertext-policy attribute-based key encapsulation mechanisms (KP-ABKEM and CP-ABKEM). Second, we convert KP-ABKEM and CP-ABKEM into challenge-and-response PP-ABID and VP-ABID, respectively, by encapsulation-and-decapsulation. There, we show that KP-ABKEM and CP-ABKEM only have to be secure against chosenciphertext attacks on one-wayness (OW-CCA secure) for the obtained PP-ABID and VP-ABID to be secure against concurrent man-in-themiddle attacks (cMiM secure). According to the design principle, we construct concrete KP-ABKEM and CP-ABKEM with the OW-CCA security by enhancing the KP-ABKEM of Ostrovsky, Sahai and Waters and CP-ABKEM of Waters, respectively. Finally, we obtain concrete PP-ABID and VP-ABID schemes that are proved to be selectively secure in the standard model against cMiM attacks.

show abstract

“…For many practical purposes, the stronger (IND-CCA) security is assumed to be mandatory for the hired encryption scheme. Using the techniques [49,50,33,34], the above CPA-secure schemes can be lifted to show the CCA-security. In all these CCA conversions, a sort of index-transformation for predicate family is applied to the primitive CPA-secure PE scheme for the same family.…”

Section: Introductionmentioning

confidence: 99%

“…In all these CCA conversions, a sort of index-transformation for predicate family is applied to the primitive CPA-secure PE scheme for the same family. In addition to the CPA-decryption, the CCAdecryption 1 of the traditional approaches [49,50,33,34] has to preform either delegation or verifiability. But the problems the above techniques suffer, are (1) increased lengths of key-indices and data-indices and (2) extra cost for performing verifiability or delegation.…”

Section: Introductionmentioning

confidence: 99%

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

Verifiable Predicate Encryption and Applications to CCA Security and Anonymous Predicate Authentication

Cited by 27 publications

References 39 publications

Attribute-Based Identification: Definitions and Efficient Constructions

Attribute-Based Identification: Definitions and Efficient Constructions

Attribute-Based Identification: Definitions and Efficient Constructions

Efficient fully CCA-secure predicate encryptions from pair encodings

Contact Info

Product

Resources

About