FE for Inner Products and Its Application to Decentralized ABE

Wang, Zhedong; Fan, Xiong; Liu, Feng-Hao

doi:10.1007/978-3-030-17259-6_4

Cited by 18 publications

(8 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The scheme of [4] suffers from similar issues while it is only selectively-secure. In [39], authors tried to improve the standard deviation of error term (by using re-randomization technique of [24] instead of using multi-hint extended LWE assumption), but the size of the public key still grows quadratically w.r.t the length of the message and the LWE-parameter n. RLWE. The Ring-LWE (RLWE) problem, introduced by Lyubashevsky et al [28], is the problem of distinguishing between two distributions in a special ring of polynomials R q :…”

Section: Security Of Fe Indistinguishability (Ind)mentioning

confidence: 99%

Efficient Lattice-Based Inner-Product Functional Encryption

Mera

Karmakar

Marc

et al. 2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In the recent years, many research lines on Functional Encryption (FE) have been suggested and studied regarding the functionality, security, or efficiency. Nevertheless, an open problem on a basic functionality, the single-input inner-product (IPFE), remains: can IPFE be instantiated based on the Ring Learning With Errors (RLWE) assumption?The RLWE assumption provides quantum-resistance security while in comparison with LWE assumption gives significant performance and compactness gains. In this paper we present the first RLWE-based IPFE scheme. We carefully choose strategies in the security proofs to optimize the size of parameters. More precisely, we develop two new results on ideal lattices. The first result is a variant of Ring-LWE, that we call multi-hint extended Ring-LWE, where some hints on the secret and the noise are given. We present a reduction from RLWE problem to this variant. The second tool is a special form of Leftover Hash Lemma (LHL) over rings, known as Ring-LHL. To demonstrate the efficiency of our scheme we provide an optimized implementation of RLWE-based IPFE scheme and show its performance on a practical use case. We further present new compilers that, combined with some existing ones, can transfer a single-input FE to its (identity-based, decentralized) multi-client variant with linear size of the ciphertext (w.r.t the number of clients).

show abstract

Section: Security Of Fe Indistinguishability (Ind)mentioning

confidence: 99%

Efficient Lattice-Based Inner-Product Functional Encryption

Mera

Karmakar

Marc

et al. 2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Multiple variants of LWE such as ring LWE [204], module LWE [188], cyclic LWE [150], continuous LWE [77], PRIM LWE [278], middle-product LWE [267], group LWE [127], entropic LWE [76], universal LWE [315], and polynomial-ring LWE [288] have been developed since 2010. Many cryptosystems rely on the hardness of LWE, including (identity-based, leakage-resilient, fully homomorphic, functional, publickey/key-encapsulation, updatable, attribute-based, inner product, predicate) encryption [28,176,306,265,138,12,204,6,74,143,96,44,59,60,61,71,120,63,199,200,49,212,53,275,125,264,171,145], oblivious transfer [247,70,260], (blind) signatures [138,202,268,203,20,…”

Section: Learning With Errorsmentioning

confidence: 99%

Star-specific Key-homomorphic PRFs from Linear Regression and Extremal Set Theory

Sehrawat¹,

Yeo²,

Vassilyev³

2022

Preprint

View full text Add to dashboard Cite

We introduce a novel method to derandomize the learning with errors (LWE) problem by generating deterministic yet sufficiently independent LWE instances, that are constructed via special linear regression models. We also introduce star-specific key-homomorphic (SSKH) pseudorandom functions (PRFs), which are defined by the respective sets of parties that construct them. We use our derandomized variant of LWE to construct a SSKH PRF family. The sets of parties constructing SSKH PRFs are arranged as star graphs with possibly shared vertices, i.e., some pair of sets have non-empty intersections. We reduce the security of our SSKH PRF family to the hardness of LWE. To establish the maximum number of SSKH PRFs that can be constructed -by a set of parties -in the presence of passive/active and external/internal adversaries, we prove several bounds on the size of maximally cover-free at most t-intersecting k-uniform family of sets H, where the three properties are defined as:For the same purpose, we define and compute the mutual information between different linear regression hypotheses that are generated via overlapping training datasets.

show abstract

“…Zhang et al [20] presented a shorter MA-ABE where a ciphertext can be decrypted with a constant number of pairing operations. Wang et al [21] constructed a MA-ABE scheme from the LWE assumption. More recently, Xiong et al [22] presented a revocable MA-ABE with outsourced decryption.…”

Section: Introductionmentioning

confidence: 99%

A Traceable and Revocable Multiauthority Attribute-Based Encryption Scheme with Fast Access

Zhang

Song

et al. 2020

Security and Communication Networks

View full text Add to dashboard Cite

Multiauthority ciphertext-policy attribute-based encryption (MA-CP-ABE) is a promising technique for secure data sharing in cloud storage. As multiple users with same attributes have same decryption privilege in MA-CP-ABE, the identity of the decryption key owner cannot be accurately traced by the exposed decryption key. This will lead to the key abuse problem, for example, the malicious users may sell their decryption keys to others. In this paper, we first present a traceable MA-CP-ABE scheme supporting fast access and malicious users’ accountability. Then, we prove that the proposed scheme is adaptively secure under the symmetric external Diffie–Hellman assumption and fully traceable under the q -Strong Diffie–Hellman assumption. Finally, we design a traceable and revocable MA-CP-ABE system for secure and efficient cloud storage from the proposed scheme. When a malicious user leaks his decryption key, our proposed system can not only confirm his identity but also revoke his decryption privilege. Extensive efficiency analysis results indicate that our system requires only constant number of pairing operations for ciphertext data access.

show abstract

FE for Inner Products and Its Application to Decentralized ABE

Cited by 18 publications

References 43 publications

Efficient Lattice-Based Inner-Product Functional Encryption

Efficient Lattice-Based Inner-Product Functional Encryption

Star-specific Key-homomorphic PRFs from Linear Regression and Extremal Set Theory

A Traceable and Revocable Multiauthority Attribute-Based Encryption Scheme with Fast Access

Contact Info

Product

Resources

About