{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:36:47Z","timestamp":1764981407825,"version":"3.46.0"},"reference-count":0,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2012,5,26]],"date-time":"2012-05-26T00:00:00Z","timestamp":1337990400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"abstract":"<jats:title>Abstract.<\/jats:title>\n                  <jats:p>This article presents an analysis of the secure key broadcasting\nscheme proposed by Wu, Ruan, Lai and Tseng [Proceedings of the 25th Annual IEEE Conference on Local Computer Networks (2000), 208\u2013212]. The study of\nthe parameters of the system is based on a connection with a special\ntype of symmetric equations over finite fields. We present two\ndifferent attacks against the system, whose efficiency depends on\nthe choice of the parameters. In particular, a time-memory tradeoff\nattack is described, effective when a parameter of the scheme is\nchosen without care. In such a situation, more than one third of the\ncases can be broken with a time and space complexity in the range of\nthe square root of the complexity of the best attack suggested by Wu\net al. against their system. This leads to a feasible attack in a\nrealistic scenario.<\/jats:p>","DOI":"10.1515\/jmc-2012-0005","type":"journal-article","created":{"date-parts":[[2012,5,24]],"date-time":"2012-05-24T18:33:18Z","timestamp":1337884398000},"page":"69-80","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of a key distribution scheme in secure multicasting"],"prefix":"10.1515","volume":"6","author":[{"given":"G\u00e9rard","family":"Maze","sequence":"first","affiliation":[{"name":"Mathematics Institute, University of Z\u00fcrich, Winterthurerstr.\u00a0190, CH-8057 Z\u00fcrich, Switzerland"}]}],"member":"374","published-online":{"date-parts":[[2012,5,26]]},"container-title":["Journal of Mathematical Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2012-0005\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2012-0005\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T00:33:42Z","timestamp":1764981222000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jmc-2012-0005\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,26]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2012,5,26]]},"published-print":{"date-parts":[[2012,6]]}},"alternative-id":["10.1515\/jmc-2012-0005"],"URL":"https:\/\/doi.org\/10.1515\/jmc-2012-0005","relation":{},"ISSN":["1862-2984","1862-2976"],"issn-type":[{"type":"electronic","value":"1862-2984"},{"type":"print","value":"1862-2976"}],"subject":[],"published":{"date-parts":[[2012,5,26]]}}}