Practical and Secure Integrated PKE+PEKS with Keyword Privacy

Buccafurri, Francesco; Lax, Gianluca; Sahu, Rajeev Anand; Saraswat, Vishal

doi:10.5220/0005577104480453

Cited by 7 publications

(9 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Specifically, its AddToken and SearchToken primitives are used to encrypt interests and tags, respectively, and the Search primitive is used to match the encrypted tags with encrypted interests. Here, we emphasise that our solution is independent of any specific functionality offered by SUISE: other SE schemes that could effectively ensure confidentiality of interests and tags, such as [31], [39]- [41], could also be leveraged in our system.…”

Section: B Searchable Encryptionmentioning

confidence: 99%

Collusion Defender: Preserving Subscribers’ Privacy in Publish and Subscribe Systems

Cui

Belguith

Alwis

et al. 2021

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

The Publish and Subscribe (pub/sub) system is an established paradigm to disseminate the data from publishers to subscribers in a loosely coupled manner using a network of dedicated brokers. However, sensitive data could be exposed to malicious entities if brokers get compromised or hacked; or even worse, if brokers themselves are curious to learn about the data. A viable mechanism to protect sensitive publications and subscriptions is to encrypt the data before it is disseminated through the brokers. State-of-the-art approaches allow brokers to perform encrypted matching without revealing publications and subscriptions. However, if malicious brokers collude with malicious subscribers or publishers, they can learn the interests of innocent subscribers, even when the interests are encrypted. In this article, we present a pub/sub system that ensures confidentiality of publications and subscriptions in the presence of untrusted brokers. Furthermore, our solution resists collusion attacks between untrusted brokers and malicious subscribers (or publishers). Finally, we have implemented a prototype of our solution to show its feasibility and efficiency.

show abstract

Section: B Searchable Encryptionmentioning

confidence: 99%

Collusion Defender: Preserving Subscribers’ Privacy in Publish and Subscribe Systems

Cui

Belguith

Alwis

et al. 2021

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

show abstract

“…In addition, PEKS does not provide a decryption functionality as PKE. Thus, schemes with both PEKS and PKE functionalities, which we call PEKS/PKE, have been proposed in [10,19,20,51,56]. SCF-PKES/PKE provides both these functionalities.…”

Section: Application To Searchable Encryptionmentioning

confidence: 99%

Implementation of a Strongly Robust Identity-Based Encryption Scheme over Type-3 Pairings

Okano

Emura

Ishibashi

et al. 2020

IJNC

View full text Add to dashboard Cite

Identity-based encryption (IBE) is a powerful mechanism for maintaining security. However, systems based on IBE are unpopular when compared with those of the public-key encryption (PKE). In our opinion, one of the reasons is a gap between theory and practice. For example, a generic transformation of weakly/strongly robust IBE from any IBE has been proposed by Abdalla et al., no robust IBE scheme is explicitly given. This means that, theoretically, anyone can construct a weakly/strongly robust IBE scheme by employing this transformation. However, this seems not easily applicable to noncryptographers. In this paper, we first introduce the Gentry IBE scheme constructed over Type-3 pairings by employing the transformation proposed by Abe et al., and second we explicitly give strongly/weakly robust Gentry IBE schemes by employing the Abdalla et al. transformation. Finally, we show its implementation result and show that we can add strong robustness to the Gentry IBE scheme with a very few additional costs. We employ the mcl library to support a Barreto-Naehrig curve defined over the 462-bit prime. The encryption requires about 5 ms, whereas the decryption requires about 9 ms.

show abstract

“…Up until now, although there have been a lot of research on searchable encryption, the only fully secure schemes [2,13,17] are inefficient to be practical enough to be used in implementation. We propose a state-of-art efficient, computationally and bandwidth-wise, fully secure practical scheme which, we believe, can be used in real applications, some of which are mentioned in Section 2.…”

Section: Our Contributionmentioning

confidence: 99%

“…At SeCrypt 2015, Buccafurri et al [13] presented an integrated public-key encryption (PKE) and public-key encryption with keyword search (PEKS) scheme (PKE+PEKS) whose security relies on the SXDH assumption. Their scheme is relatively efficient and our scheme improves upon it.…”

Section: Our Contributionmentioning

confidence: 99%

See 1 more Smart Citation

Public-Key Encryption with Integrated Keyword Search

et al. 2019

Self Cite

View full text Add to dashboard Cite

Since the last decade, the public-key encryption with keyword search (PEKS) has been studied as a popular technique for searching data over encrypted files. The notion finds useful application for fine-grained data search on outsourced encrypted data like iCloud, mobile cloud data, etc. In this paper, we present a concrete public-key encryption (PKE)+PEKS scheme and prove its security in the standard model. We prove that our scheme is both IND-PKE-CCA secure, that is, provides message confidentiality against an adaptive chosen-ciphertext adversary, and IND-PEKS-CCA secure, that is, provides keyword privacy against an adaptive chosen-ciphertext adversary, under the Symmetric eXternal Diffie-Hellman (SXDH) assumption. Our construction uses asymmetric pairings which enable a fast implementation useful for practical applications. Our scheme has much shorter ciphertexts than other known PKE+PEKS schemes. Particularly, we compare our scheme with other proposed PEKS and integrated PKE+PEKS schemes and provide a relative analysis of various parameters including assumption, security, and efficiency. KeywordsPKE+PEKS • Searchable encryption • Asymmetric pairings (Type 3) • Provable security • Standard model • SXDH • Cloud computing • Data outsourcing security An extended abstract was published as [35].

show abstract

Practical and Secure Integrated PKE+PEKS with Keyword Privacy

Cited by 7 publications

References 16 publications

Collusion Defender: Preserving Subscribers’ Privacy in Publish and Subscribe Systems

Collusion Defender: Preserving Subscribers’ Privacy in Publish and Subscribe Systems

Implementation of a Strongly Robust Identity-Based Encryption Scheme over Type-3 Pairings

Public-Key Encryption with Integrated Keyword Search

Contact Info

Product

Resources

About