Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data

Camenisch, Jan; Kohlweiss, Markulf; Rial, Alfredo; Sheedy, Caroline

doi:10.1007/978-3-642-00468-1_12

Cited by 97 publications

(76 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Firstly, we require an anonymous scheme which is secure in the standard model and sufficiently efficient, this requirement excludes many distributed schemes like Sakai-Kasahara in [20,4,6], Boneh-Franklin in [6]. Secondly, we require a scheme for which there exists a distributed version that is relatively efficient and practical, since Gentry's scheme shares similarities with Sakai-Kasahara, it can be distributed the same way as in [4,6], this requirement excludes also the scheme of Boyen-Waters [15] modified in [10] due to its complex structure of user's private-keys which makes the distribution of these schemes much more difficult. Let COM = (Setup, Commit) be a secure commitment scheme and let Π (KeyGen, Enc, Dec) be an additively homomorphic and semantically secure encryption scheme, such that Enc(e) ⊗ r = Enc(er), and Enc(a) ⊕ Enc(b) = Enc(a + b).…”

Section: Constructionmentioning

confidence: 99%

“…We follow a generic transformation in [1,10,16] to transform our blind anonymous (n, t)-IBE into TPEKS with oblivious keyword search. Notice that Gentry's scheme uses stateful randomness in the secret key generation phase.…”

Section: Threshold Peks With Oblivious Abstractearchmentioning

confidence: 99%

“…After [2] a flurry of PEKS schemes were proposed [9,12,10,16], each one deals with a special scenario application. We focus our interest on special schemes [12,10,16] proposing mechanisms for generating trapdoors.…”

Section: Introductionmentioning

confidence: 99%

“…We focus our interest on special schemes [12,10,16] proposing mechanisms for generating trapdoors. Camenisch et al [10] introduced the concept of public key encryption with oblivious keyword search (PEOKS) which uses Blind key extraction protocols to hide keyword from the T GE. They extended the definition of PEKS to incorporate the encryption of a secret message when computing a searchable encryption.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A New Approach for Private Searches on Public-Key Encrypted Data

Siad

2012

Communications and Multimedia Security

View full text Add to dashboard Cite

Abstract. Public-key Encryption with Keyword Search (PEKS) allows authorized users to search by keywords on encrypted data by generating trapdoors for the desired keywords. Basically there are two requirements for the process of trapdoors generation. On one hand, it is important to allow users to privately search on encrypted data without revealing keywords to the Trapdoor Generation Entity T GE, and solutions proposed are based on the use of blinding protocols between user and T GE. On the other hand, in some applications it is necessary to prevent T GE from generating trapdoors on behalf of a legitimate user, this is done by splitting the T GE and generating trapdoors in distributed manner. Until now, these two requirements in PEKS were considered separately and many solutions were proposed dealing with each one. However, no solution is known to satisfy the two requirements at the same time.In this paper we present a new approach to deal with this issue. First, we extend the notion of anonymous Identity-Based Encryption with distributed Private Key Generator to handle the blind key-extraction protocols as in Blind IBE. We call such new schemes blind anonymous (n, t)-IBE, and we give concrete construction of such schemes. Second, we generically transform the blind anonymous (n, t)-IBE into a threshold PEKS with oblivious keyword search satisfying the requirements specified above.

show abstract

Section: Constructionmentioning

confidence: 99%

Section: Threshold Peks With Oblivious Abstractearchmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A New Approach for Private Searches on Public-Key Encrypted Data

Siad

2012

Communications and Multimedia Security

View full text Add to dashboard Cite

show abstract

“…When an IBE scheme is anonymous, the scheme can hide both, the message and the identity, embedded in the ciphertext. Improved AIBE schemes have been proposed in [13,24,5,15]. The schemes cited above are useful for the equality search only, i.e.…”

Section: Related Workmentioning

confidence: 99%

Towards provably secure efficiently searchable encryption

Sedghi¹

View full text Add to dashboard Cite

Privacy‐preserving data search and sharing protocol for social networks through wireless applications

Wang

Chen

2016

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYData search and sharing are two important functionalities in social networks. The social network users can form a peer-to-peer group and securely and flexibly search and share cloud data through wireless applications. When the number of users increases, the communication, storage, and computational overheads will be increased, and the quality of services such as searching and data sharing for clients could be affected. In order to solve these problems, we formalize an ID-based multi-user searchable encryption (IDB-MUSE) and formally define its security model, where the security notions accommodate indistinguishability against insider's keyword guessing attack, indistinguishability against chosen keyword attack, and indistinguishability against insider's identity guessing attack. We present an IDB-MUSE scheme, where the index and search trapdoor are of constant size. We formally prove its security properties. To improve the search efficiency, we divide the computation of the trapdoor into two phases, that is, the offline phase and the online phase. The computation cost for the online phase trapdoor remains constant with respect to the number of users. Based on the IDB-MUSE scheme, a privacy-preserving data search and sharing protocol is proposed, where only the authorized user can access the shared group data. It captures the properties of source authenticity, data and search pattern privacy-preserving, anonymity, and request unlinkability. The experimental results show that the protocol is practical for wireless applications. Copyright © 2016 John Wiley & Sons, Ltd.Received 11 December 2015; Revised 9 March 2016; Accepted 11 April 2016 KEY WORDS: social network; peer-to-peer group; searchable encryption; data sharing; insider attack; anonymity INTRODUCTIONData search and sharing are widely used in social networks. As there is no group manager, the users in social networks form a peer-to-peer group. With the popularity of wireless communication, users usually search and share their data through wireless devices, which offer great convenience and flexibility. However, the wireless devices usually have a limited storage. Therefore, the social networks users often outsource their data to cloud, for example, the dropbox [1], amazon cloud [2], google cloud [3], and others, because of their great advantages of the powerful computation capability, the abundant storage resource and the on demand high-quality services.As a common scenario shown in Figure 1, a group of social network users access and share the cloud data through their mobile phones, laptops, and smart watches. They can outsource their shared data on the cloud storage, while any authorized user in the social network can access the data through their mobile devices. The privacy protection and system performance are regarded as two major concerns when social network users retrieve and share the cloud data via these resource constrained mobile devices.As the data is outsourced to the cloud and the cloud server may be untrusted, it need to protect the dat...

show abstract

Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data

Cited by 97 publications

References 43 publications

A New Approach for Private Searches on Public-Key Encrypted Data

A New Approach for Private Searches on Public-Key Encrypted Data

Towards provably secure efficiently searchable encryption

Privacy‐preserving data search and sharing protocol for social networks through wireless applications

Contact Info

Product

Resources

About