Constant Size Ciphertexts in Threshold Attribute-Based Encryption

Herranz, Javier; Laguillaumie, Fabien; Ràfols, Carla

doi:10.1007/978-3-642-13013-7_2

Cited by 182 publications

(202 citation statements)

References 23 publications

Supporting

Mentioning

200

Contrasting

Unclassified

Order By: Relevance

“…[BBG05] provides an intractability bound for the general Diffie-Hellman exponent problem in the generic model [Sho97], where the underlying groups are equipped with pairings. Thus the generic complexity of (n, t)-MSE-DDH and the other similar problems mentioned in [DPP07,HLR10,DP08] are covered by the analysis in [BBG05]. A proof to show the (n, t)-MSE-DDH problem as a particular instance of general Diffie-Hellman exponent problem is similar to the proof of [DP08], where it has been shown that the (l, m, t)-MSE-DDH (l, m, t are integers) problem fit the framework of general Diffie-Hellman exponent problem.…”

Section: (N T)-mse-ddh (The Multi-sequence Of Exponentsmentioning

confidence: 98%

See 1 more Smart Citation

A Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme

Jhanwar

2011

Information Security Practice and Experience

View full text Add to dashboard Cite

Abstract. A publicly verifiable secret sharing (PVSS) scheme, proposed by Stadler in [Sta96], is a VSS scheme in which anyone, not only the shareholders, can verify that the secret shares are correctly distributed. PVSS can play essential roles in the systems using VSS. Achieving simultaneously the following two features for PVSS is a challenging job:-Efficient non-interactive public verification.-Proving security for the public verifiability in the standard model. In this paper we propose a (t, n)-threshold PVSS scheme which satisfies both of these properties. Efficiency of the non-interactive public verification step of the proposed scheme is optimal (in terms of computations of bilinear maps (pairing)) while comparing with the earlier solution by [HV08]. In public verification step of [HV08], one needs to compute 2n many pairings, where n is the number of shareholders, whereas in our scheme the number of pairing computations is 4 only. This count is irrespective of the number of shareholders. We also provide a formal proof for the semantic security (IND) of our scheme based on the hardness of a problem that we call the (n, t)-multi-sequence of exponents Diffie-Hellman problem (MSE-DDH). This problem falls under the general Diffie-Hellman exponent problem framework [BBG05].

show abstract

Section: (N T)-mse-ddh (The Multi-sequence Of Exponentsmentioning

confidence: 98%

“…This idea is very prominent in threshold cryptography, e.g., broadcast encryption, threshold encryption, attribute based encryption etc. The approach for our scheme is inspired by the work of [DPP07,HLR10,DP08]. An overview of this idea can briefly be described as follows:…”

Section: The New (T N)-threshold Pvss Schemementioning

confidence: 99%

A Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme

Jhanwar

2011

Information Security Practice and Experience

View full text Add to dashboard Cite

show abstract

“…Because of the popularity of lightweight devices and useful applications of secure attribute based system with short ciphertext' , in this work, we propose a probably secure proposed system scheme that offers short decryption keys, which are applicable for key storage in lightweight devices. [17], [18], [19] CP-ABE works under four ways Setup, Encrypt KeyGen and decrypt.…”

Section: Proposed Systemmentioning

confidence: 99%

A Novel Constant size Cipher-text Scheme for Security in Real-time Systems

Dhivya¹,

Venkatraman²,

Miranda³

2015

IJCATR

View full text Add to dashboard Cite

Abstract:In this paper, we consider 'secure attribute based system with short ciphertext' is a tool for implementing fine-grained access control over encrypted data, and is conceptually similar to traditional access control methods such as Role-Based Access Control. However, current 'secure attribute based system with short ciphertext' schemes suffer from the issue of having long decryption keys, in which the size is linear to and dependent on the number of attributes.Ciphertext-Policy ABE (CP-ABE) provides a scalable way of encrypting data such that the encryptor defines the attribute set that the decryptor needs to possess in order to decrypt the ciphertext. We propose a novel 'secure attribute based system with short ciphertext' scheme with constantsize decryption keys independent of the number of attributes. We found that the size can be as small as 672 bits.

show abstract

“…Several ABE schemes [3,7,11] with constant-size ciphertexts have been proposed. Among them, [7,11] only support limited classes of predicates that do not cover the classes supported by ZIPE or NIPE, while [3] supports a wider class of relations, non-monotone predicates, than those by ZIPE or NIPE.…”

Section: Related Workmentioning

confidence: 99%

“…Among them, [7,11] only support limited classes of predicates that do not cover the classes supported by ZIPE or NIPE, while [3] supports a wider class of relations, non-monotone predicates, than those by ZIPE or NIPE. All of these ABE schemes, however, are only selectively secure in the standard model.…”

Section: Related Workmentioning

confidence: 99%

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

Okamoto

Takashima

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper, we present two non-zero inner-product encryption (NIPE) schemes that are adaptively secure under a standard assumption, the decisional linear (DLIN) assumption, in the standard model. One of the proposed NIPE schemes features constant-size ciphertexts and the other features constant-size secret-keys. Our NIPE schemes imply an identity-based revocation (IBR) system with constant-size ciphertexts or constant-size secret-keys that is adaptively secure under the DLIN assumption. Any previous IBR scheme with constantsize ciphertexts or constant-size secret-keys was not adaptively secure in the standard model. This paper also presents two zero inner-product encryption (ZIPE) schemes each of which has constant-size ciphertexts or constant-size secret-keys and is adaptively secure under the DLIN assumption in the standard model. They imply an identity-based broadcast encryption (IBBE) system with constant-size ciphertexts or constant-size secret-keys that is adaptively secure under the DLIN assumption. We also extend the proposed ZIPE schemes into two directions, one is a fully-attribute-hiding ZIPE scheme with constant-size secret-keys, and the other a hierarchical ZIPE scheme with constant-size ciphertexts.

show abstract

Constant Size Ciphertexts in Threshold Attribute-Based Encryption

Cited by 182 publications

References 23 publications

A Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme

A Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme

A Novel Constant size Cipher-text Scheme for Security in Real-time Systems

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

Contact Info

Product

Resources

About