Provably secure key assignment schemes from factoring

Authors:
Eduarda S. V. Freire;Kenneth G. Paterson
Affiliations:
Information Security Group, Royal Holloway, University of London, UK;Information Security Group, Royal Holloway, University of London, UK
Venue:
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Year:
2011

Citing 16
Cited 1

An Optimal Algorithm for Assigning Cryptographic Keys to Control Access in a Hierarchy

IEEE Transactions on Computers
How to construct random functions

Journal of the ACM (JACM)
A simple unpredictable pseudo random number generator

SIAM Journal on Computing
Efficient and secure pseudo-random number generation

Proceedings of CRYPTO 84 on Advances in cryptology
RSA and Rabin functions: certain parts are as hard as the whole

SIAM Journal on Computing - Special issue on cryptography
A hard-core predicate for all one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A cryptographic key generation scheme for multilevel data security

Computers and Security
Cryptographic solution to a problem of access control in a hierarchy

ACM Transactions on Computer Systems (TOCS)
Dynamic and efficient key management for access hierarchies

Proceedings of the 12th ACM conference on Computer and communications security
Merging: An Efficient Solution for a Time-Bound Hierarchical Key Assignment Scheme

IEEE Transactions on Dependable and Secure Computing
A secure system for data access based on anonymous authentication and time-dependent hierarchical keys

ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
On Key Assignment for Hierarchical Access Control

CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Provably-secure time-bound hierarchical key assignment schemes

Proceedings of the 13th ACM conference on Computer and communications security
Practical Chosen Ciphertext Secure Encryption from Factoring

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Variations on a theme by Akl and Taylor: Security and tradeoffs

Theoretical Computer Science
Constructing key assignment schemes from chain partitions

DBSec'10 Proceedings of the 24th annual IFIP WG 11.3 working conference on Data and applications security and privacy

Simple, efficient and strongly KI-Secure hierarchical key assignment schemes

CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide constructions for key assignment schemes that are provably secure under the factoring assumption in the standard model. Our first construction is for simple "chain" hierarchies, and achieves security against key recovery attacks with a tight reduction from the problem of factoring integers of a special form. Our second construction applies for general hierarchies, achieves the stronger notion of key indistinguishability, and has security based on the hardness of factoring Blum integers. We compare our constructions to previous schemes, in terms of security and efficiency.