Deniable Attribute Based Encryption for Branching Programs from LWE

Apon, Daniel; Fan, Xiong; Liu, Feng-Hao

doi:10.1007/978-3-662-53644-5_12

Cited by 8 publications

(9 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this way we achieve (n c , poly) bideniable FE for circuits assuming IND-secure FE for circuits and indistinguishability obfuscation. We remark that in the works of Apon et al [4,5] the notion of sender deniability achieved is multi-distributional. Relation to Simulation-Based Security.…”

Section: Introductionmentioning

confidence: 90%

“…The actual construction is more involved, and is presented in full details in Section 4. We point out that in some concurrent works Apon et al [4,5] construct bi-deniable inner-product and attribute-based encryption schemes in the multidistributional model from LWE. Sender deniability for FE from indistinguishability obfuscation.…”

Section: Introductionmentioning

confidence: 99%

“…We point out that in some concurrent works Apon et al . [18, 19] construct bi‐deniable inner‐product and attribute‐based encryption schemes in the multi‐distributional model from Learning with Errors (LWE).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Receiver‐ and sender‐deniable functional encryption

Iovino

O’Neill

2018

IET Information Security

View full text Add to dashboard Cite

Deniable encryption, first introduced by Canetti et al. (CRYPTO 1997), allows equivocation of encrypted communication. In this work we generalize its study to functional encryption (FE). Our results are summarized as follows:We first put forward and motivate the concept of receiver deniable FE, for which we consider two models. In the first model, as previously considered by O'Neill et al. (CRYPTO 2011) in the case of identity-based encryption, a receiver gets assistance from the master authority to generate a fake secret key. In the second model, there are "normal" and "deniable" secret keys, and a receiver in possession of a deniable secret key can produce a fake but authentic-looking normal key on its own.In the first model, we show a compiler from any FE scheme for the general circuit functionality to a FE scheme having receiver deniability. In addition we show an efficient receiver deniable FE scheme for Boolean Formulae from bilinear maps. In the second (multi-distributional) model, we present a specific FE scheme for the general circuit functionality having receiver deniability. To our knowledge, a scheme in the multi-distributional model was not previously known even for the special case of identity-based encryption.Finally, we construct the first sender (non-multi-distributional) deniable FE scheme.

show abstract

Section: Introductionmentioning

confidence: 90%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Receiver‐ and sender‐deniable functional encryption

Iovino

O’Neill

2018

IET Information Security

View full text Add to dashboard Cite

show abstract

“…Authors construct a flexibly bi-deniable Attribute-Based Encryption (ABE) scheme for all polynomial-size branching programs from learning with errors (LWE) [36]. The techniques involve new ways of manipulating Gaussian noise that may be of independent interest, and lead to a significantly sharper analysis of noise growth in Dual Regev type encryption schemes.…”

Section: Attribute-based Encryptionmentioning

confidence: 99%

How to Hide the Real Receiver Under the Cover Receiver: CP-ABE With Policy Deniability

2020

View full text Add to dashboard Cite

Attribute-based encryption (ABE) is a useful tool for sharing an encrypted data to a target group. In a ciphertext-policy ABE (CP-ABE) scheme, a ciphertext includes a policy to indicate its receivers and only those receivers can correctly decrypt the ciphertext. Since this design leaks the receiver identity, it may raise a new security issue about user privacy. Some hidden-policy ABE schemes, where the policy is secretly protected, are proposed to keep user privacy. However, these hidden-policy ABE schemes rely on the user trying all possibilities to decide if it belongs to the wanted receiver group. The decryption costs too much and every potential receiver will run the decryption process in vain since it does not know the policy. In this work, we apply the deniability concept to solve this problem. The encryption scheme allows the sender to claim the ciphertext is for some receiver group while actually it is for another receiver group. Both receiver groups can correctly decrypt the ciphertext except that the real group can get the real message and the cover group will get the cover message. While coercion, the sender can definitely claim the ciphertext is for the cover group and the real group is kept confidential. INDEX TERMS Attribute-based encryption, deniable encryption, identity-based encryption.

show abstract

“…Recent progress on more advanced cryptographic constructions based on lattices, like attribute-based encryption [17] and predicate encryption [34], are closely related to both the structure of the schemes and strategy in the proofs in [1,2,33]. The MP-PKE [45] inspires development in some latticebased constructions, like homomorphic encryption [3] and deniable attribute-based encryption [4].…”

Section: Contributionsmentioning

confidence: 99%

Symbolic Proofs for Lattice-Based Cryptography

Barthe

Fan

Gancher

et al. 2018

Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security

Self Cite

View full text Add to dashboard Cite

Symbolic methods have been used extensively for proving security of cryptographic protocols in the Dolev-Yao model, and more recently for proving security of cryptographic primitives and constructions in the computational model. However, existing methods for proving security of cryptographic constructions in the computational model often require significant expertise and interaction, or are fairly limited in scope and expressivity.This paper introduces a symbolic approach for proving security of cryptographic constructions based on the Learning With Errors assumption (Regev, STOC 2005). Such constructions are instances of lattice-based cryptography and are extremely important due to their potential role in post-quantum cryptography. Following (Barthe, Grégoire and Schmidt, CCS 2015), our approach combines a computational logic and deducibility problems-a standard tool for representing the adversary's knowledge, the Dolev-Yao model. The computational logic is used to capture (indistinguishability-based) security notions and drive the security proofs whereas deducibility problems are used as side-conditions to control that rules of the logic are applied correctly. We then use AutoLWE, an implementation of the logic, to deliver very short or even automatic proofs of several emblematic constructions, including CPA-PKE (Gentry et al., STOC 2008), (Hierarchical) Identity-Based Encryption (Agrawal et al. Eurocrypt 2010), Inner Product Encryption (Agrawal et al. Asiacrypt 2011), CCA-PKE (Micciancio et al., Eurocrypt 2012).The main technical novelty beyond AutoLWE is a set of (semi-)decision procedures for deducibility problems, using extensions of Gröbner basis computations for subalgebras in the (non-)commutative setting (instead of ideals in the commutative setting). Our procedures cover the theory of matrices, which is required for lattice-based assumption, as well as the theory of non-commutative rings, fields, and Diffie-Hellman exponentiation, in its standard, bilinear and multilinear forms. Additionally, AutoLWE supports oracle-relative assumptions, which are used specifically to apply (advanced forms of)

show abstract

Deniable Attribute Based Encryption for Branching Programs from LWE

Cited by 8 publications

References 33 publications

Receiver‐ and sender‐deniable functional encryption

Receiver‐ and sender‐deniable functional encryption

How to Hide the Real Receiver Under the Cover Receiver: CP-ABE With Policy Deniability

Symbolic Proofs for Lattice-Based Cryptography

Contact Info

Product

Resources

About