Achieving Short Ciphertexts or Short Secret-Keys for Adaptively Secure General Inner-Product Encryption

Okamoto, Tatsuaki; Takashima, Katsuyuki

doi:10.1007/978-3-642-25513-7_11

Cited by 52 publications

(21 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We also propose a new IPE scheme equipped with a specific characteristic to build EDE, namely the need for a short private key. The private key of our IPE scheme comprises of two group elements only, compared to the best efficient IPE scheme in the literature with nine group elements [3]. The EDE instantiation from our IPE will therefore save more than 75% secure memory for private key storage.…”

Section: Our Contributionsmentioning

confidence: 98%

Poster

Guo

Susilo

2014

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

View full text Add to dashboard Cite

We introduce a new encryption notion called Euclidean Distance based Encryption (EDE). In this notion, a ciphertext encrypted with a vector and a threshold value can be decrypted with a private key of another vector, if and only if the Euclidean distance between these two vectors is less than or equal to the threshold value. Euclidean distance is the underlying technique in the pattern recognition and image processing community for image recognition. The primary application of this encryption notion is to enable an identity-based encryption that incorporates biometric identifiers, such as fingerprint, face, hand geometry, vein and iris. In that application, usually the input biometric will not be exactly the same during the enrollment and encryption phases. In this poster, we propose this new encryption notion and study its construction. We show how to generically and efficiently construct an EDE from an inner-product encryption (IPE) with reasonable size of private keys and ciphertexts. We also propose a new IPE scheme that is equipped with a specific characteristic to build EDE, namely the need for short private key. Our IPE scheme achieves the shortest private key compared to existing IPE schemes in the literature, where our private key is composed of two group elements only.

show abstract

Section: Our Contributionsmentioning

confidence: 98%

Poster

Guo

Susilo

2014

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

View full text Add to dashboard Cite

show abstract

“…Thus an HIBE scheme based on DPVS that supports l-depth has linear-size of ciphertexts since it requires at least l-dimensions in DPVS. To reduce the dimensions of DPVS, one may try to use the technique of Okamoto and Takashima [38], but it only applied to non-anonymous schemes since it should reveal the identity of ciphertexts. 3 To support private key re-randomization using a public key, some elementsĝ,û,ĥ ∈Ĝ in a private key should be moved to a public key.…”

Section: Our Contributionsmentioning

confidence: 99%

“…PE schemes with linear-size ciphertexts that have the delegation capability include the dHVE scheme of Shi and Waters in composite order bilinear groups [42] and HIPE schemes of Okamoto and Takashima based on dual pairing vector spaces [31,36,37,39]. A non-anonymous HIPE scheme based on dual pairing vector spaces can have constant-size ciphertexts, but the ciphertext should contain a linear-size identity vector [38]. Though bilinear groups were widely used in the construction of HIBE, some HIBE schemes were designed in lattices [3,4,17].…”

Section: Related Workmentioning

confidence: 99%

Anonymous HIBE with short ciphertexts: full security in prime order groups

Lee

Park

Lee

2013

Des. Codes Cryptogr.

View full text Add to dashboard Cite

Anonymous Hierarchical Identity-Based Encryption (HIBE) is an extension of Identity-Based Encryption (IBE), and it provides not only a message hiding property but also an identity hiding property. Anonymous HIBE schemes can be applicable to anonymous communication systems and public key encryption systems with keyword searching. However, previous anonymous HIBE schemes have some disadvantages that the security was proven in the weaker model, the size of ciphertexts is not short, or the construction was based on composite order bilinear groups. In this paper, we propose the first efficient anonymous HIBE scheme with short ciphertexts in prime order (asymmetric) bilinear groups, and prove its security in the full model with an efficient reduction. To achieve this, we use the dual system encryption methodology of Waters. We also present the benchmark results of our scheme by measuring the performance of our implementation.

show abstract

“…Under this encryption system, a ciphertext conceals all attributes as well as the plaintext. PE for Inner Product Encryption is a new way of viewing encryption which opens up a much larger world of possibilities for sharing encrypted data [8][9][10][11][12][13][14]. In an Inner Product Encryption system, a relation…”

Section: Introductionmentioning

confidence: 99%

Fully Secure Hierarchical Inner Product Encryption for Privacy Preserving Keyword Searching in Cloud

Zhang

Wang

et al. 2015

2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)

View full text Add to dashboard Cite

Cloud computing provides dynamically scalable resources provisioned as a service over networks. But untrustworthy Cloud Service Provider(CSP) offers a big obstacle for the adoption of the cloud service since CSP can access data in Cloud without data owner's permission. Hierarchical Inner Product Encryption (HIPE) covers all applications of anonymous encryption, fully private communication and search on encrypted data, which provide trusted data access control policy to CSP. However, the existing works only achieve either selectively attribute-hiding or adaptively attribute-hiding under some strong assumptions in the public key setting. To overcome them, a novel HIPE in private key setting is issued. The new scheme achieves both fully secure and security reduction under the natural assumption-Decisional Linear (DLIN) assumption in the standard model.

show abstract

Achieving Short Ciphertexts or Short Secret-Keys for Adaptively Secure General Inner-Product Encryption

Cited by 52 publications

References 22 publications

Poster

Poster

Anonymous HIBE with short ciphertexts: full security in prime order groups

Fully Secure Hierarchical Inner Product Encryption for Privacy Preserving Keyword Searching in Cloud

Contact Info

Product

Resources

About