Provably secure key assignment schemes from factoring

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6812 LNCS, Issue , 2011, Pages 292-309

  Freire, Eduarda S V ^a   Paterson, Kenneth G ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

access control; factoring; general poset; Key assignment scheme; provably secure

Indexed keywords

FACTORING; FACTORING INTEGERS; FIRST CONSTRUCTIONS; GENERAL POSET; INDISTINGUISHABILITY; KEY ASSIGNMENT SCHEMES; KEY RECOVERY ATTACKS; PROVABLY SECURE; SPECIAL FORMS; THE STANDARD MODEL;

ACCESS CONTROL; NETWORK SECURITY; COMPUTER PRIVACY; SECURITY OF DATA;

COMPUTER PRIVACY; NETWORK SECURITY;

EID: 79960205945     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22497-3_19     Document Type: Conference Paper

References (21)

1. Akl, S.G., Taylor, P.D.: Cryptographic solution to a problem of access control in a hierarchy. ACM Transactions on Computer Systems 1, 239-248 (1983)
2. MacKinnon, S.J., Taylor, P.D., Meijer, H., Akl, S.G.: An optimal algorithm for assigning cryptographic keys to control access in a hierarchy. IEEE Transactions on Computers 34, 797-802 (1985)
3. Harn, L., Lin, H.Y.: A cryptographic key generation scheme for multilevel data security. Computers & Security 9, 539-546 (1990)
4. Atallah, M.J., Blanton, M., Fazio, N., Frikken, K.B.: Dynamic and efficient key management for access hierarchies. In: ACM Conference on Computer and Communications Security, pp. 190-202 (2006)
5. Ateniese, G., Santis, A.D., Ferrara, A.L., Masucci, B.: Provably-secure time-bound hierarchical key assignment schemes. In: ACM Conference on Computer and Communications Security, pp. 288-297 (2006)
6. Tzeng, W.G.: A secure system for data access based on anonymous authentication and time-dependent hierarchical keys. In: ACM Symposium on Information, Computer and Communications Security, pp. 223-230 (2006)
7. Wang, S.Y., Laih, C.S.: An efficient solution for a time-bound hierarchical key assignment scheme. IEEE Transactions on Dependable and Secure Computing 3, 91-100 (2006)
8. Chen, T.S., Chung, Y.F.: Hierarchical access control based on chinese remainder theorem and symmetric algorithm. Computers & Security 21, 565-570 (2002)
9. Shen, V.R.L., Chen, T.S.: A novel key management scheme based on discrete logarithms and polynomial interpolations. Computers & Security 21, 164-171 (2002)
10. Wu, T.C., Chang, C.C.: Cryptographic key assignment scheme for hierarchical access control. International Journal of Computer Systems Science and Engineering 16, 25-28 (2001)
11. Yeh, J.-H., Chow, R., Newman, R.: A key assignment for enforcing access control policy exceptions. In: International Symposium on Internet Technology, pp. 54-59 (1998)
12. Crampton, J., Martin, K.M., Wild, P.R.: On key assignment for hierarchical access control. In: Computer Security Foundations Workshop, pp. 98-111 (2006)
13. Crampton, J., Daud, R., Martin, K.M.: Constructing key assignment schemes from chain partitions. In: Foresti, S., Jajodia, S. (eds.) DBSec 2010. LNCS, vol. 6166, pp. 130-145. Springer, Heidelberg (2010)
14. D'Arco, P., Santis, A.D., Ferrara, A.L., Masucci, B.: Variations on a theme by Akl and Taylor: Security and tradeoffs. Theoretical Computer Science 411, 213-227 (2010)
15. Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: ACM STOC, pp. 25-32 (1989)
16. Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33, 792-807 (1986)
17. Dilworth, R.P.: A decomposition theorem for partially ordered sets. Annals of Mathematics 51, 161-166 (1950)
18. Hofheinz, D., Kiltz, E.: Practical chosen ciphertext secure encryption from factoring. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 313-332. Springer, Heidelberg (2009)
19. Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM Journal on Computing 15(2), 364-383 (1986)
20. Alexi, W., Chor, B., Goldreich, O., Schnorr, C.P.: RSA and Rabin functions: Certain parts are as hard as the whole. SIAM Journal on Computing 17, 194-209 (1988)
21. Vazirani, U.V., Vazirani, V.V.: Efficient and secure pseudo-random number generation. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 193-202. Springer, Heidelberg (1985)