A Novel Key Management Scheme Based on Discrete Logarithms and Polynomial Interpolations

Shen, Victor R.L.; Chen, Tzer-Shyong

doi:10.1016/s0167-4048(02)00211-0

Cited by 75 publications

(41 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of the schemes proposed in this approach use prime numbers fundamental properties (Akl and Taylor [12], Ray et al [13], Zou et al [14]) and other theoretical cryptographic notions (Hardjono et al [15] and Zheng et al [16]). Shen and Chen [17], Zhang et al [18], Tzang et al [19] and Das et al [20] used Newton's polynomial interpolation to correlate classes' indices with their keys.…”

Section: Key Management Schemes For Cachmentioning

confidence: 99%

See 1 more Smart Citation

A key management scheme evaluation using Markov processes

Ragab-Hassen

Lounes

2016

Int. J. Inf. Secur.

View full text Add to dashboard Cite

Content access control aims at ensuring that, in a system with several resources, users can only access resources they are authorized to. Resources are encrypted using cryptographic keys. Generating, distributing and renewing these keys are the challenges faced by key management schemes. While most of the existing key management schemes are typically evaluated by simulation. We propose, for the first time, to use Markovian processes for this purpose. Markovian processes give more accurate evaluation. The key tables-based key management scheme for linear hierarchies (KTLH) is a particularly interesting key management scheme; it was initially proposed for securing group communications, but could easily be adapted to other application such as wireless sensor networks. KTLH requires each user to maintain a set of keys. The keys and size of the key set change dynamically, making the evaluation of the overheads of KTLH a challenging task. Our contribution is threefold, we have (1) modeled KTLH using Markov processes, (2) evaluated KTLH according to its storage, computation and bandwidth overheads and compared it to existing key management schemes and (3) shown how our approach could be generalized to other key management schemes.

show abstract

Section: Key Management Schemes For Cachmentioning

confidence: 99%

“…The complexity of some of the existing dependent-keys key management schemes [9,[11][12][13]17,20] when applied to linear hierarchies was evaluated in [6]. Table 5 uses this evaluation and compares the complexity of KTLH to the dependentkeys schemes, namely direct and indirect schemes.…”

Section: Comparison To the Existing Schemesmentioning

confidence: 99%

A key management scheme evaluation using Markov processes

Ragab-Hassen

Lounes

2016

Int. J. Inf. Secur.

View full text Add to dashboard Cite

show abstract

“…• The hierarchy is a DAG [6,8,31,59,62,67,69,87,91]. Since each vertex in a DAG can have more than one direct ancestor, key derivation methods are in general more complex than the methods used for chains or trees.…”

Section: Access Control Enforcement In the Outsourcing Scenariomentioning

confidence: 99%

Preserving Privacy in Data Outsourcing

Foresti

2011

Advances in Information Security

View full text Add to dashboard Cite

The increasing availability of large collections of personal information as well as of data storage facilities for supporting data-intensive services, support the view that service providers will be more and more requested to be responsible for the storage and the efficient and reliable dissemination of information, thus realizing a "data outsourcing" architecture. Within a data outsourcing architecture data are stored together with application front-ends at the sites of an external server who takes full charges of their management. While publishing data on external servers may increase service availability, reducing data owners' burden of managing data, data outsourcing introduces new privacy and security concerns since the server storing the data may be honest-but-curious. A honest-but-curious server honestly manages the data but may not be trusted by the data owner to read their content. To ensure adequate privacy protection, a traditional solution consists in encrypting the outsourced data, thus preventing outside attacks as well as infiltration from the server itself. Such traditional solutions have however the disadvantage of reducing query execution efficiency and of preventing selective information release. This introduces then the need to develop new models and methods for the definition and enforcement of access control and privacy restrictions on outsourced data while ensuring an efficient query execution.In this thesis, we present a comprehensive approach for protecting sensitive information when it is stored on systems that are not under the data owner's control. There are mainly three security requirements that need to be considered when designing a system for ensuring confidentiality of data stored and managed by a honest-but-curious server. The first requirement is access control enforcement to limit the ability of authorized users to access system's resources. In traditional contexts, a trusted module of the data management system is in charge of enforcing the access control policy. In the considered scenario, the service provider is not trusted for enforcing the access control policy and the data owner is not willing to mediate access requests to filter query results. We therefore propose a new access control system, based on selective encryption, that does not require the presence of a trusted module in the system for the enforcement of the policy. The second requirement is privacy protection to limit the visibility of stored/published data to non authorized II users while minimizing the adoption of encryption. Data collections often contain personally identifiable information that needs to be protected both at storage and when disseminated to other parties. As an example, medical data cannot be stored or published along with the identity of the patients they refer to. To guarantee privacy protection and to limit the use of encryption, in this thesis we first propose a solution for modeling in a simple while powerful way privacy requirements through confidentiality constraints, which a...

show abstract

“…Formally, the hierarchy is modelled as a partially ordered set (poset), each data item is labelled by a class u in the hierarchy, and is encrypted using the encryption key k u corresponding to that class. Now a user, given access to the private information S u , can derive the relevant encryption key k v for any descendant class v, and hence gain access to the data of class v. Since the original paper by Akl and Taylor, a large number of different schemes have been proposed, offering different trade-offs in terms of the amount of public and private storage required and the complexity of key derivation -see for example [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17]. Many additional issues are addressed in these works: time-dependent constraints, dynamic addition and removal of classes, and revocation, for example.…”

mentioning

confidence: 99%

Simple, Efficient and Strongly KI-Secure Hierarchical Key Assignment Schemes

Freire

Paterson

Poettering

2013

Topics in Cryptology – CT-RSA 2013

View full text Add to dashboard Cite

Hierarchical Key Assignment Schemes can be used to enforce access control policies by cryptographic means. In this paper, we present a new, enhanced security model for such schemes. We also give simple, efficient, and strongly-secure constructions for Hierarchical Key Assignment Schemes for arbitrary hierarchies using pseudorandom functions and forward-secure pseudorandom generators. We compare instantiations of our constructions with state-of-the-art Hierarchical Key Assignment Schemes, demonstrating that our new schemes possess an attractive trade-off between storage requirements and efficiency of key derivation.

show abstract

A Novel Key Management Scheme Based on Discrete Logarithms and Polynomial Interpolations

Cited by 75 publications

References 16 publications

A key management scheme evaluation using Markov processes

A key management scheme evaluation using Markov processes

Preserving Privacy in Data Outsourcing

Simple, Efficient and Strongly KI-Secure Hierarchical Key Assignment Schemes

Contact Info

Product

Resources

About