{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:57:50Z","timestamp":1750309070839,"version":"3.41.0"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2004,11,11]],"date-time":"2004-11-11T00:00:00Z","timestamp":1100131200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst. Secur."],"published-print":{"date-parts":[[2004,11,11]]},"abstract":"<jats:p>\n            We propose a novel secure group keying scheme using\n            <jats:italic>hash chain<\/jats:italic>\n            for\n            <jats:italic>many-to-many<\/jats:italic>\n            secure group communication. This scheme requires a\n            <jats:italic>key predistribution center<\/jats:italic>\n            to generate multiple hash chains and allocates exactly one hash value from each chain to a group member. A group member can use its allocated hash values (secrets) to generate group and subgroup keys. Key distribution can be offline or online via the key distribution protocol. Once keys are distributed, this scheme enables a group member to communicate with any possible subgroups\n            <jats:italic>without<\/jats:italic>\n            the help of the key distribution center, and without having to leave the overall group, thus avoiding any setup delay. Our scheme is suitable for applications where the population of a system is stable, group size is moderate, subgroup formation is frequent, and the application is delay sensitive. Through analysis, we present effectiveness of our approach.\n          <\/jats:p>","DOI":"10.1145\/1042031.1042033","type":"journal-article","created":{"date-parts":[[2005,1,26]],"date-time":"2005-01-26T16:35:53Z","timestamp":1106757353000},"page":"523-552","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["A key-chain-based keying scheme for many-to-many secure group communication"],"prefix":"10.1145","volume":"7","author":[{"given":"Dijiang","family":"Huang","sequence":"first","affiliation":[{"name":"University of Missouri-Kansas City, Kansas City, MO"}]},{"given":"Deep","family":"Medhi","sequence":"additional","affiliation":[{"name":"University of Missouri-Kansas City, Kansas City, MO"}]}],"member":"320","published-online":{"date-parts":[[2004,11,11]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings 23rd National Information Systems Security Conference (NISSC). National Institute of Standards and Technology, National Computer Security Center","author":"Alves-Foss J.","year":"2000","unstructured":"Alves-Foss , J. 2000 . An efficient secure authenticated group key exchange algorithm for large and dynamic groups . In Proceedings 23rd National Information Systems Security Conference (NISSC). National Institute of Standards and Technology, National Computer Security Center , Baltimore, MD, USA, 254--266.]] Alves-Foss, J. 2000. An efficient secure authenticated group key exchange algorithm for large and dynamic groups. In Proceedings 23rd National Information Systems Security Conference (NISSC). National Institute of Standards and Technology, National Computer Security Center, Baltimore, MD, USA, 254--266.]]"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/288090.288097"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1949"},{"key":"e_1_2_1_4_1","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology: EUROCRPT '91","author":"Berkovits S.","unstructured":"Berkovits , S. 1992. How to broadcast a secret . In Advances in Cryptology: EUROCRPT '91 . Lecture Notes in Computer Science , vol. 547 . Springer-Verlag , Berlin , 536--541.]] Berkovits, S. 1992. How to broadcast a secret. In Advances in Cryptology: EUROCRPT '91. Lecture Notes in Computer Science, vol. 547. Springer-Verlag, Berlin, 536--541.]]"},{"key":"e_1_2_1_5_1","series-title":"Lecture Notes in Computer Science","volume-title":"EUROCRYPT'84","author":"Blom R.","unstructured":"Blom , R. 1985. An optimal class of symmetric key generation systems . In EUROCRYPT'84 . Lecture Notes in Computer Science , vol. 209 . Springer-Verlag , Paris, France , 335--338.]] Blom, R. 1985. An optimal class of symmetric key generation systems. In EUROCRYPT'84. Lecture Notes in Computer Science, vol. 209. Springer-Verlag, Paris, France, 335--338.]]"},{"key":"e_1_2_1_6_1","series-title":"Lecture Notes in Computer Science","volume-title":"Cryptology: EUROCRYPT '94","author":"Blundo C.","year":"1995","unstructured":"Blundo , C. and Cresti , A . 1995 . Space requirements for broadcast encryption. In Advances in Cryptology: EUROCRYPT '94 . Lecture Notes in Computer Science . Springer-Verlag , New York , 287--298.]] Blundo, C. and Cresti, A. 1995. Space requirements for broadcast encryption. In Advances in Cryptology: EUROCRYPT '94. Lecture Notes in Computer Science. Springer-Verlag, New York, 287--298.]]"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-1994\/1995-3406"},{"volume-title":"Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology. Springer-Verlag","author":"Blundo C.","key":"e_1_2_1_8_1","unstructured":"Blundo , C. , Mattos , L. A. F. , and Stinson , D. R . 1996. Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution . In Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology. Springer-Verlag , Santa Barbara, California, USA, 387--400.]] Blundo, C., Mattos, L. A. F., and Stinson, D. R. 1996. Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution. In Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology. Springer-Verlag, Santa Barbara, California, USA, 387--400.]]"},{"key":"e_1_2_1_9_1","volume-title":"Lecture Notes in Computer Science","volume":"740","author":"Blundo C.","unstructured":"Blundo , C. , Santis , A. D. , Herzberg , A. , Kutten , S. , Vaccaro , U. , and Yung , M . 1993. Perfectly-secure key distribution for dynamic conferences . Lecture Notes in Computer Science , vol. 740 . Springer-Verlag, Berlin, 471--486.]] Blundo, C., Santis, A. D., Herzberg, A., Kutten, S., Vaccaro, U., and Yung, M. 1993. Perfectly-secure key distribution for dynamic conferences. Lecture Notes in Computer Science, vol. 740. Springer-Verlag, Berlin, 471--486.]]"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2717"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0095"},{"key":"e_1_2_1_12_1","volume-title":"Marks: Zero side effect multicast key management using arbitrarily revealed key","author":"Briscoe B.","year":"1999","unstructured":"Briscoe , B. 1999 . Marks: Zero side effect multicast key management using arbitrarily revealed key . In Networked Group Communication (NGC'99). Springer-Verlag , Pisa, Italy.]] Briscoe, B. 1999. Marks: Zero side effect multicast key management using arbitrarily revealed key. In Networked Group Communication (NGC'99). Springer-Verlag, Pisa, Italy.]]"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of Eurocrypt' 94","volume":"950","author":"Burmester M.","unstructured":"Burmester , M. and Desmedt , Y . 1995. A secure and efficient conference key distribution system . In Proceedings of Eurocrypt' 94 . Lecture Notes in Computer Science , vol. 950 . Springer-Verlag, Berlin, 275--286.]] Burmester, M. and Desmedt, Y. 1995. A secure and efficient conference key distribution system. In Proceedings of Eurocrypt' 94. Lecture Notes in Computer Science, vol. 950. Springer-Verlag, Berlin, 275--286.]]"},{"volume-title":"Security Protocols Workshop. Springer-Verlag","author":"Burmester M.","key":"e_1_2_1_14_1","unstructured":"Burmester , M. and Desmedt , Y . 1996. Efficient and secure conference-key distribution . In Security Protocols Workshop. Springer-Verlag , Cambridge, UK, 119--129.]] Burmester, M. and Desmedt, Y. 1996. Efficient and secure conference-key distribution. In Security Protocols Workshop. Springer-Verlag, Cambridge, UK, 119--129.]]"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-2196-8"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Coppersmith D. and Jakobsson M. 2002. Almost optimal hash sequence traversal. In Finacial Cryptography. InterVarsity Press Southampton Bermuda.]]   Coppersmith D. and Jakobsson M. 2002. Almost optimal hash sequence traversal. In Finacial Cryptography. InterVarsity Press Southampton Bermuda.]]","DOI":"10.1007\/3-540-36504-4_8"},{"key":"e_1_2_1_17_1","unstructured":"Dondeti L. R. Mukherjee S. and Samal A. 1999. Survey and Comparison of Secure Group Communication Protocols. Tech. rep. University of Nebraska Lincoln.]]  Dondeti L. R. Mukherjee S. and Samal A. 1999. Survey and Comparison of Secure Group Communication Protocols. Tech. rep. University of Nebraska Lincoln.]]"},{"volume-title":"Fifth IEEE Symposium on Computers and Communications. Antibes-Juan les Pins, France.]]","author":"Dondeti L. R.","key":"e_1_2_1_18_1","unstructured":"Dondeti , L. R. , Mukherjee , S. , and Samal , A . 2000. A distributed framework for scalable secure many-to-many communication . In Fifth IEEE Symposium on Computers and Communications. Antibes-Juan les Pins, France.]] Dondeti, L. R., Mukherjee, S., and Samal, A. 2000. A distributed framework for scalable secure many-to-many communication. In Fifth IEEE Symposium on Computers and Communications. Antibes-Juan les Pins, France.]]"},{"key":"e_1_2_1_19_1","volume-title":"CRYPTO'93","volume":"773","author":"Fiat A.","unstructured":"Fiat , A. and Naor , M . 1994. Broadcast encryption . In CRYPTO'93 . Lecture Notes in Computer Science , vol. 773 . Springer-Verlag, Santa Barbara, California, 480--491.]] Fiat, A. and Naor, M. 1994. Broadcast encryption. In CRYPTO'93. Lecture Notes in Computer Science, vol. 773. Springer-Verlag, Santa Barbara, California, 480--491.]]"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/191177.191218"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02252869"},{"volume-title":"Graph Theory","author":"Harary F.","key":"e_1_2_1_22_1","unstructured":"Harary , F. 1969. Graph Theory . Addison-Wesley Publishing Company, Inc. ]] Harary, F. 1969. Graph Theory. Addison-Wesley Publishing Company, Inc.]]"},{"key":"e_1_2_1_23_1","volume-title":"RFC","author":"Harney H.","year":"2094","unstructured":"Harney , H. and Muckenhirn , C . 1997. Group key management protocol (GKMP) architecture . RFC 2094 .]] Harney, H. and Muckenhirn, C. 1997. Group key management protocol (GKMP) architecture. RFC 2094.]]"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023709"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/191177.191195"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/352600.352638"},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Kim Y. Perrig A. and Tsudik G. 2001. Communication-efficient group key agreement. Tech. rep. Department of Information and Computer Science University of California Irvine.]]  Kim Y. Perrig A. and Tsudik G. 2001. Communication-efficient group key agreement. Tech. rep. Department of Information and Computer Science University of California Irvine.]]","DOI":"10.1007\/0-306-46998-7_16"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/647992.742111"},{"key":"e_1_2_1_29_1","series-title":"Lecture Notes in Computer Science.]]","volume-title":"Cryptology: ASIACRYPT '94","author":"Kurosawa K.","year":"1995","unstructured":"Kurosawa , K. , Okada , K. , and Sakano , K . 1995 . Security of the center in key distribution schemes. In Advances in Cryptology: ASIACRYPT '94 . Lecture Notes in Computer Science.]] Kurosawa, K., Okada, K., and Sakano, K. 1995. Security of the center in key distribution schemes. In Advances in Cryptology: ASIACRYPT '94. Lecture Notes in Computer Science.]]"},{"key":"e_1_2_1_30_1","series-title":"Lecture Notes in Computer Science","volume-title":"Cryptology: CRYPTO '93","author":"Leighton T.","year":"1994","unstructured":"Leighton , T. and Micali , S . 1994 . Secret-key agreement without public-key cryptography. Advances in Cryptology: CRYPTO '93 . Lecture Notes in Computer Science , vol. 773 . 456--479.]] Leighton, T. and Micali, S. 1994. Secret-key agreement without public-key cryptography. Advances in Cryptology: CRYPTO '93. Lecture Notes in Computer Science, vol. 773. 456--479.]]"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/263105.263179"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.806981"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/646766.704277"},{"key":"e_1_2_1_34_1","first-page":"180","article-title":"Secure Hash Standard","author":"NIST.","year":"1995","unstructured":"NIST. 1995 . Secure Hash Standard . FIPS PUB 180 - 181 .]] NIST. 1995. Secure Hash Standard. FIPS PUB 180-1.]]","journal-title":"FIPS PUB"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/937503.937506"},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Rivest R. L. 1992. The MD5 message-digest algorithm. RFC 1321.]]   Rivest R. L. 1992. The MD5 message-digest algorithm. RFC 1321.]]","DOI":"10.17487\/rfc1321"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2003.1199073"},{"volume-title":"Implementing Discrete Mathematics","author":"Skiena S.","key":"e_1_2_1_38_1","unstructured":"Skiena , S. 1990. Implementing Discrete Mathematics . Addison-Wesley Publishing Company .]] Skiena, S. 1990. Implementing Discrete Mathematics. Addison-Wesley Publishing Company.]]"},{"key":"e_1_2_1_39_1","first-page":"22","article-title":"A lower bound for multicast key distribution","volume":"1","author":"Snoeyink J.","year":"2001","unstructured":"Snoeyink , J. , Suri , S. , and Varghese , G. 2001 . A lower bound for multicast key distribution . In IEEE INFOCOM 1 , 22 -- 26 .]] Snoeyink, J., Suri, S., and Varghese, G. 2001. A lower bound for multicast key distribution. In IEEE INFOCOM 1, 22--26.]]","journal-title":"IEEE INFOCOM"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/238168.238182"},{"volume-title":"Proceedings of the 18th International Conference on Distributed Computing Systems (ICDCS'98)","author":"Steiner M.","key":"e_1_2_1_41_1","unstructured":"Steiner , M. , Tsudik , G. , and Waidner , M . 1998. CLIQUES: A new approach to group key agreement . In Proceedings of the 18th International Conference on Distributed Computing Systems (ICDCS'98) . IEEE Computer Society Press, Amsterdam, 380--387.]] Steiner, M., Tsudik, G., and Waidner, M. 1998. CLIQUES: A new approach to group key agreement. In Proceedings of the 18th International Conference on Distributed Computing Systems (ICDCS'98). IEEE Computer Society Press, Amsterdam, 380--387.]]"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008268610932"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008209004667"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.790485"},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Wallner D. M. Harder E. J. and Agee R. C. 1999. Key management for multicast: Issues and architectures. RFC 2627.]]   Wallner D. M. Harder E. J. and Agee R. C. 1999. Key management for multicast: Issues and architectures. RFC 2627.]]","DOI":"10.17487\/rfc2627"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.836475"}],"container-title":["ACM Transactions on Information and System Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1042031.1042033","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1042031.1042033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:43:15Z","timestamp":1750286595000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1042031.1042033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,11,11]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,11,11]]}},"alternative-id":["10.1145\/1042031.1042033"],"URL":"https:\/\/doi.org\/10.1145\/1042031.1042033","relation":{},"ISSN":["1094-9224","1557-7406"],"issn-type":[{"type":"print","value":"1094-9224"},{"type":"electronic","value":"1557-7406"}],"subject":[],"published":{"date-parts":[[2004,11,11]]},"assertion":[{"value":"2004-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}