{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:28:24Z","timestamp":1710347304636},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2012,12]]},"abstract":"<jats:p> Assume that there are players and an eavesdropper Eve of unlimited computational power and that several pairs of players have shared secret keys beforehand. In a key sharing graph, each vertex corresponds to a player, and each edge corresponds to a secret key shared by the two players corresponding to the ends of the edge. Given a key sharing graph, a player wishes to send a message to another player so that the eavesdropper Eve and any other player can get no information on the message. In this paper, we first give a necessary and sufficient condition on a key sharing graph for the existence of such a unicast protocol. We then extend the condition to the case where a multiple number of players other than the sender and receiver passively collude. We finally give a sufficient condition for the existence of a secure multicast protocol. <\/jats:p>","DOI":"10.1142\/s179383091250053x","type":"journal-article","created":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T19:17:45Z","timestamp":1348600665000},"page":"1250053","source":"Crossref","is-referenced-by-count":1,"title":["ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH"],"prefix":"10.1142","volume":"04","author":[{"given":"YOSHIHIRO","family":"INDO","sequence":"first","affiliation":[{"name":"School of Science and Technology, Kwansei Gakuin University, 2\u20131 Gakuen, Sanda-shi, 669\u20131337, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TAKAAKI","family":"MIZUKI","sequence":"additional","affiliation":[{"name":"Cyberscience Center, Tohoku University, Aramaki-Aza-Aoba 6\u20133, Aoba-ku, Sendai-shi, 980\u20138578, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TAKAO","family":"NISHIZEKI","sequence":"additional","affiliation":[{"name":"School of Science and Technology, Kwansei Gakuin University, 2\u20131 Gakuen, Sanda-shi, 669\u20131337, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,1,4]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00206326"},{"key":"rf3","volume-title":"Graph Theory","author":"Diestel R.","year":"2000"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1145\/138027.138036"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910002"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480198335215"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008659"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.04.004"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"rf14","first-page":"1906","volume":"71","author":"Suzuki H.","year":"1988","journal-title":"IEICE Trans. A J"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-001-0002-y"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383091250053X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:14:23Z","timestamp":1565126063000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383091250053X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":10,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2013,1,4]]},"published-print":{"date-parts":[[2012,12]]}},"alternative-id":["10.1142\/S179383091250053X"],"URL":"https:\/\/doi.org\/10.1142\/s179383091250053x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}