Group‐oriented encryption for dynamic groups with constant rekeying cost

Koti, Nishat; Purushothama, B.

doi:10.1002/sec.1593

Cited by 11 publications

(35 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, CA generates a public key,

{PK}_{CA} = false{normalh = g^{β}, normalf = g^{1 false/ β} false}

, and a secret key, SK CA = { β }, where

β \in {Z_{p}}^{*}

is a randomly selected exponent. The CA publishes the public parameter, PK as PK =

false{G_{0}, normalg, normalh = g^{β}, normalf = g^{1 false/ β} false}

.In our scheme, CA works as a group coordinator (GC) for readers and writers and generates master secret key MSK grp and system parameter Γ using Nishat's scheme →false{SKAAi,PKAAifalse}: Each

{AA}_{i} \in scriptA

creates a secret key,

{SK}_{{AA}_{i}}

= ( α i ,

g^{α_{i}}

), and a public key,

{PK}_{{AA}_{i}}

false{normale {false(normalg, normalg false)}^{α_{i}} false}

, where α i is selected randomly from

{Z^{*}}_{p}

.…”

Section: Proposed Access Control Schemementioning

confidence: 99%

“…The data owner signs CT Vk and CT Sk using Sk and sends CT Vk , CT Sk , σ Vk , and σ Sk to the cloud server . The data owner also sends T read and T write to the CA. GroupPubKeyGen (Γ, T read , T write ) →{PK r , δ r ,

{false{{SK}_{u_{r}} false}}_{normalu \in U_{reader}}

, PK w , δ w ,

{false{{SK}_{u_{w}} false}}_{normalu \in U_{writer}} false}

: We use Nishat's scheme to generate public keys for a group of readers and writers , respectively. The CA receives T read , T write from the data owner and then receives membership information (a list of users possessing a particular attribute) for each attribute in the access policies from the corresponding attribute authorities, similarly to the Hur scheme .…”

Section: Proposed Access Control Schemementioning

confidence: 99%

“…The CA receives T read , T write from the data owner and then receives membership information (a list of users possessing a particular attribute) for each attribute in the access policies from the corresponding attribute authorities, similarly to the Hur scheme . The CA then generates a public key for the group of readers , PK r = {PK r1 ,PK r2 }, public parameter δ r , and read secret key,

{SK}_{u_{r}}

, for each user u ∈ U reader following the work of Nishat and Purushothama . The CA sends PK r and δ r to the cloud server and each user u ∈ U reader receives

{SK}_{u_{r}}

from the CA using secure channel.…”

Section: Proposed Access Control Schemementioning

confidence: 99%

“…Similarly, CA generates PK w = {PK w1 , PK w2 }, δ w , and

{SK}_{u_{w}}

for each user u ∈ U writer . The CA sends PK w and δ w to the cloud server and u ∈ U writer receives

{SK}_{u_{w}}

from the CA. EncryptCK (PK r , PK w , CK r ,

{CK}_{r^{'}}

, CK w , Γ)

\to false{{CT}_{{CK}_{r}}

{CT}_{{CK}_{r^{'}}}

{CT}_{{CK}_{w}} false}

: Using Γ and PK r , the data owner encrypts CK r ,

{CK}_{r^{'}}

and generates

false{{CT}_{{CK}_{r}}, V_{no} false}

false{{CT}_{{CK}_{r^{'}}}, V_{no} false}

, respectively, using Nishat's scheme . Similarly, the data owner encrypts CK w and generates

false{{CT}_{{CK}_{w}}, V_{no} false}

.…”

Section: Proposed Access Control Schemementioning

confidence: 99%

“…In our scheme, CA works as a group coordinator (GC) for readers and writers and generates master secret key MSK grp and system parameter Γ using Nishat's scheme …”

Section: Proposed Access Control Schemementioning

confidence: 99%

See 4 more Smart Citations

Light weight and fine‐grained access mechanism for secure access to outsourced data*

Jahan

Seneviratne

Roy

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary In this paper, we explore the problem of providing selective read/write access to the outsourced data for clients using mobile devices in an environment that supports users from multiple domains and where attributes are generated by multiple authorities. We consider Ciphertext‐Policy Attribute‐based Encryption (CP‐ABE) scheme as it can provide access control on encrypted outsourced data. One limitation of CP‐ABE is that the users can modify the access policy specified by the data owner if write operations are introduced in the scheme. We propose a protocol for providing different levels of access to outsourced data that permits the authorized users to perform write operation without altering the access policy specified by the data owner. Our scheme provides fine‐grained read/write access to the users, accompanied with a light weight signature scheme and computationally inexpensive user revocation mechanism suitable for resource‐constrained mobile devices. We provide a theoretical analysis of the security of the proposed protocol and the experimental results measured from a real‐world testbed.

show abstract

“…Then, CA generates a public key,

{PK}_{CA} = false{normalh = g^{β}, normalf = g^{1 false/ β} false}

, and a secret key, SK CA = { β }, where

β \in {Z_{p}}^{*}

is a randomly selected exponent. The CA publishes the public parameter, PK as PK =

false{G_{0}, normalg, normalh = g^{β}, normalf = g^{1 false/ β} false}

.In our scheme, CA works as a group coordinator (GC) for readers and writers and generates master secret key MSK grp and system parameter Γ using Nishat's scheme →false{SKAAi,PKAAifalse}: Each

{AA}_{i} \in scriptA

creates a secret key,

{SK}_{{AA}_{i}}

= ( α i ,

g^{α_{i}}

), and a public key,

{PK}_{{AA}_{i}}

false{normale {false(normalg, normalg false)}^{α_{i}} false}

, where α i is selected randomly from

{Z^{*}}_{p}

.…”

Section: Proposed Access Control Schemementioning

confidence: 99%

{false{{SK}_{u_{r}} false}}_{normalu \in U_{reader}}

, PK w , δ w ,

{false{{SK}_{u_{w}} false}}_{normalu \in U_{writer}} false}

Section: Proposed Access Control Schemementioning

confidence: 99%

{SK}_{u_{r}}

, for each user u ∈ U reader following the work of Nishat and Purushothama . The CA sends PK r and δ r to the cloud server and each user u ∈ U reader receives

{SK}_{u_{r}}

from the CA using secure channel.…”

Section: Proposed Access Control Schemementioning

confidence: 99%

“…Similarly, CA generates PK w = {PK w1 , PK w2 }, δ w , and

{SK}_{u_{w}}

for each user u ∈ U writer . The CA sends PK w and δ w to the cloud server and u ∈ U writer receives

{SK}_{u_{w}}

from the CA. EncryptCK (PK r , PK w , CK r ,

{CK}_{r^{'}}

, CK w , Γ)

\to false{{CT}_{{CK}_{r}}

{CT}_{{CK}_{r^{'}}}

{CT}_{{CK}_{w}} false}

: Using Γ and PK r , the data owner encrypts CK r ,

{CK}_{r^{'}}

and generates

false{{CT}_{{CK}_{r}}, V_{no} false}

false{{CT}_{{CK}_{r^{'}}}, V_{no} false}

, respectively, using Nishat's scheme . Similarly, the data owner encrypts CK w and generates

false{{CT}_{{CK}_{w}}, V_{no} false}

.…”

Section: Proposed Access Control Schemementioning

confidence: 99%

“…In our scheme, CA works as a group coordinator (GC) for readers and writers and generates master secret key MSK grp and system parameter Γ using Nishat's scheme …”

Section: Proposed Access Control Schemementioning

confidence: 99%

See 3 more Smart Citations

Light weight and fine‐grained access mechanism for secure access to outsourced data*

Jahan

Seneviratne

Roy

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

Extended hierarchical key assignment scheme (E-HKAS): how to efficiently enforce explicit policy exceptions in dynamic hierarchies

Pareek

Purushothama

2019

Sādhanā

View full text Add to dashboard Cite

In this paper, we focus on practically motivated flexibility requirements for the hierarchical access control model, namely transitive exception and anti-symmetric exception. Additionally, we motivate a new flexibility requirement called ''class delegation with descendant(s) safety'' in a practical application scenario. We propose our extended hierarchical key assignment scheme (E-HKAS) that satisfies all three aforementioned flexibility requirements in a dynamic hierarchy of security classes. To propose a generic E-HKAS, we model the hierarchical access control policy as a collection of access groups. E-HKAS enforces transitive and antisymmetric exceptions using an efficient group-based encryption scheme. To enforce class delegation with descendant(s) safety, we propose a novel cryptographic primitive called group proxy re-encryption (GPRE) that supports proxy re-encryption between two access groups. We present an IND-CPA-secure construction of our proposed GPRE scheme and formally prove its security. Performance analysis shows that the proposed E-HKAS enforces explicit transitive and anti-symmetric exceptions more efficiently than the existing approaches in the literature. Computation cost for key derivation is constant and does not depend on the depth of the hierarchy. Also, to enforce class delegation with descendant(s) safety, the proposed E-HKAS requires constant number of computational steps to be executed. adhana(0123456789().,-volV)FT3 ](0123456789().,-volV)

show abstract

Proxy re-encryption for fine-grained access control: Its applicability, security under stronger notions and performance

Pareek

Purushothama

2020

Journal of Information Security and Applications

View full text Add to dashboard Cite

Group‐oriented encryption for dynamic groups with constant rekeying cost

Cited by 11 publications

References 23 publications

Light weight and fine‐grained access mechanism for secure access to outsourced data*

Light weight and fine‐grained access mechanism for secure access to outsourced data*

Extended hierarchical key assignment scheme (E-HKAS): how to efficiently enforce explicit policy exceptions in dynamic hierarchies

Proxy re-encryption for fine-grained access control: Its applicability, security under stronger notions and performance

Contact Info

Product

Resources

About