{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:54:02Z","timestamp":1756000442369},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642224966"},{"type":"electronic","value":"9783642224973"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22497-3_19","type":"book-chapter","created":{"date-parts":[[2011,7,4]],"date-time":"2011-07-04T02:05:53Z","timestamp":1309745153000},"page":"292-309","source":"Crossref","is-referenced-by-count":10,"title":["Provably Secure Key Assignment Schemes from Factoring"],"prefix":"10.1007","author":[{"given":"Eduarda S. V.","family":"Freire","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth G.","family":"Paterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1145\/357369.357372","volume":"1","author":"S.G. Akl","year":"1983","unstructured":"Akl, S.G., Taylor, P.D.: Cryptographic solution to a problem of access control in a hierarchy. ACM Transactions on Computer Systems\u00a01, 239\u2013248 (1983)","journal-title":"ACM Transactions on Computer Systems"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1109\/TC.1985.1676635","volume":"34","author":"S.J. MacKinnon","year":"1985","unstructured":"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\u00a034, 797\u2013802 (1985)","journal-title":"IEEE Transactions on Computers"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/0167-4048(90)90132-D","volume":"9","author":"L. Harn","year":"1990","unstructured":"Harn, L., Lin, H.Y.: A cryptographic key generation scheme for multilevel data security. Computers & Security\u00a09, 539\u2013546 (1990)","journal-title":"Computers & Security"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013202 (2006)","DOI":"10.1145\/1102120.1102147"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013297 (2006)","DOI":"10.1145\/1180405.1180441"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013230 (2006)","DOI":"10.1145\/1128817.1128851"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/TDSC.2006.15","volume":"3","author":"S.Y. Wang","year":"2006","unstructured":"Wang, S.Y., Laih, C.S.: An efficient solution for a time-bound hierarchical key assignment scheme. IEEE Transactions on Dependable and Secure Computing\u00a03, 91\u2013100 (2006)","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/S0167-4048(02)01016-7","volume":"21","author":"T.S. Chen","year":"2002","unstructured":"Chen, T.S., Chung, Y.F.: Hierarchical access control based on chinese remainder theorem and symmetric algorithm. Computers & Security\u00a021, 565\u2013570 (2002)","journal-title":"Computers & Security"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/S0167-4048(02)00211-0","volume":"21","author":"V.R.L. Shen","year":"2002","unstructured":"Shen, V.R.L., Chen, T.S.: A novel key management scheme based on discrete logarithms and polynomial interpolations. Computers & Security\u00a021, 164\u2013171 (2002)","journal-title":"Computers & Security"},{"key":"19_CR10","first-page":"25","volume":"16","author":"T.C. Wu","year":"2001","unstructured":"Wu, T.C., Chang, C.C.: Cryptographic key assignment scheme for hierarchical access control. International Journal of Computer Systems Science and Engineering\u00a016, 25\u201328 (2001)","journal-title":"International Journal of Computer Systems Science and Engineering"},{"key":"19_CR11","unstructured":"Yeh, J.-H., Chow, R., Newman, R.: A key assignment for enforcing access control policy exceptions. In: International Symposium on Internet Technology, pp. 54\u201359 (1998)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Crampton, J., Martin, K.M., Wild, P.R.: On key assignment for hierarchical access control. In: Computer Security Foundations Workshop, pp. 98\u2013111 (2006)","DOI":"10.1109\/CSFW.2006.20"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/978-3-642-13739-6_9","volume-title":"DBSec 2010","author":"J. Crampton","year":"2010","unstructured":"Crampton, J., Daud, R., Martin, K.M.: Constructing key assignment schemes from chain partitions. In: Foresti, S., Jajodia, S. (eds.) DBSec 2010. LNCS, vol.\u00a06166, pp. 130\u2013145. Springer, Heidelberg (2010)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2009.09.028","volume":"411","author":"P. D\u2019Arco","year":"2010","unstructured":"D\u2019Arco, P., Santis, A.D., Ferrara, A.L., Masucci, B.: Variations on a theme by Akl and Taylor: Security and tradeoffs. Theoretical Computer Science\u00a0411, 213\u2013227 (2010)","journal-title":"Theoretical Computer Science"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: ACM STOC, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM\u00a033, 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth, R.P.: A decomposition theorem for partially ordered sets. Annals of Mathematics\u00a051, 161\u2013166 (1950)","journal-title":"Annals of Mathematics"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-01001-9_18","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"D. Hofheinz","year":"2009","unstructured":"Hofheinz, D., Kiltz, E.: Practical chosen ciphertext secure encryption from factoring. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 313\u2013332. Springer, Heidelberg (2009)"},{"issue":"2","key":"19_CR19","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM Journal on Computing\u00a015(2), 364\u2013383 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"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\u00a017, 194\u2013209 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-39568-7_17","volume-title":"Advances in Cryptology","author":"U.V. Vazirani","year":"1985","unstructured":"Vazirani, U.V., Vazirani, V.V.: Efficient and secure pseudo-random number generation. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 193\u2013202. Springer, Heidelberg (1985)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22497-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T13:11:06Z","timestamp":1560345066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22497-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642224966","9783642224973"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22497-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}