CCA-secure Predicate Encryption from Pair Encoding in Prime Order Groups: Generic and Efficient

@article{Chatterjee2017CCAsecurePE,
  title={CCA-secure Predicate Encryption from Pair Encoding in Prime Order Groups: Generic and Efficient},
  author={Sanjit Chatterjee and Sayantan Mukherjee and Tapas Pandit},
  journal={IACR Cryptol. ePrint Arch.},
  year={2017},
  volume={2017},
  pages={657}
}
Attrapadung (Eurocrypt 2014) proposed a generic framework called pair encoding to simplify the design and proof of security of CPA-secure predicate encryption (PE) in composite order groups. Later Attrapadung (Asiacrypt 2016) extended this idea in prime order groups. Yamada et al. (PKC 2011, PKC 2012) and Nandi et al. (ePrint Archive: 2015/457, AAECC 2017) proposed generic conversion frameworks to achieve CCA-secure PE from CPA-secure PE provided the encryption schemes have properties like… 
5 Citations
Master-Key KDM-Secure ABE via Predicate Encoding
TLDR
This paper proposes the first generic framework for attribute-based encryptions (ABE) with master-secret-key-dependentmessage security (mKDM security) for affine functions via predicate encodings by Chen, Gay and Wee and obtains a set of new mKDM-secure ABE schemes with high expressiveness that have never been reached before.
Predicate signatures from pair encodings via dual system proof technique
TLDR
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.
Generic Negation of Pair Encodings
TLDR
A generic transformation that takes any pair encoding scheme (PES) for a predicate P and produces a PES for its negated predicate P is proposed, which finally solves a problem that was open since 2015 and provides the first pair encode scheme for negated doubly spatial encryption.
Tag-based ABE in prime-order groups via pair encoding
TLDR
A ciphertext-policy scheme for non-monotone span programs with compact ciphertexts satisfying semi-adaptive security if pair encoding schemes satisfy perfect security (resp. relaxed perfect security) from the standard k-linear assumption is proposed.

References

SHOWING 1-10 OF 19 REFERENCES
Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings
TLDR
A new generic framework for achieving fully secure attribute based encryption (ABE) in prime-order bilinear groups is proposed and the first generic implication from ABE for monotone span programs to ABE for branching programs is established.
Generic Conversions from CPA to CCA secure Functional Encryption
TLDR
Different ways of obtaining CCA-secure functional encryptions of almost all categories are provided, provided the underlying CPA-secure encryption scheme has either restricted delegation or verifiability feature and it is observed that almost all functional encryption schemes have this feature.
Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption
TLDR
This paper exhaustively checks the verifiability of existing ABE schemes and found that most of them satisfy such a property, hence CCA-secure versions of these schemes can be obtained automatically.
On the Power of Pair Encodings: Frameworks for Predicate Cryptographic Primitives
TLDR
By combining the proposed frameworks for PS and PE, this work provides a generic construction for predicate signature (PS) from the pair encoding schemes, which achieves the perfect privacy, and the strong unforgeability and CCA security in the adaptive-predicates model.
Verifiability-based conversion from CPA to CCA-secure predicate encryption
  • M. Nandi, Tapas Pandit
  • Computer Science, Mathematics
    Applicable Algebra in Engineering, Communication and Computing
  • 2017
TLDR
The CPA to CCA conversion for PE is revisited and a new conversion based on verifiability is proposed, which generalizes the existing conversion and works irrespective of the number of components in the system-indices.
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
  • D. Freeman
  • Mathematics, Computer Science
    EUROCRYPT
  • 2010
TLDR
An abstract framework is developed that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and a security theorem is given for the prime-order group instantiation of each system.
Simplifying Design and Analysis of Complex Predicate Encryption Schemes
TLDR
A new simple property for pair encodings called symbolic security is proposed, which is inherently tied to the security of predicate encryption schemes by arguing that any scheme which is not trivially broken must satisfy it.
Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes
This paper presents a new framework for constructing fully CCA-secure predicate encryption schemes from pair encoding schemes. Our construction is the first in the context of predicate encryption
Improved Dual System ABE in Prime-Order Groups via Predicate Encodings
TLDR
This is the first uniform treatment of dual system ABE across different predicates and across both composite and prime-order groups and an extension to weakly attribute-hiding predicate encryption.
Dual System Encryption via Predicate Encodings
  • H. Wee
  • Computer Science, Mathematics
    TCC
  • 2014
We introduce the notion of predicate encodings, an information-theoretic primitive reminiscent of linear secret-sharing that in addition, satisfies a novel notion of reusability. Using this notion,
...
...