{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:20:37Z","timestamp":1742912437908,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030874728"},{"type":"electronic","value":"9783030874735"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87473-5_4","type":"book-chapter","created":{"date-parts":[[2021,9,23]],"date-time":"2021-09-23T15:24:12Z","timestamp":1632410652000},"page":"25-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Friendly Interference Game in Wireless Secret Communication Networks"],"prefix":"10.1007","author":[{"given":"Zhifan","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Melike","family":"Baykal-G\u00fcrsoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,17]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72709-5_1","volume-title":"Network Control and Optimization","author":"E Altman","year":"2007","unstructured":"Altman, E., Avrachenkov, K., Garnaev, A.: A jamming game in wireless networks with transmission cost. In: Chahed, T., Tuffin, B. (eds.) NET-COOP 2007. LNCS, vol. 4465, pp. 1\u201312. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72709-5_1"},{"issue":"1\u20132","key":"4_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s11235-010-9308-0","volume":"47","author":"E Altman","year":"2011","unstructured":"Altman, E., Avrachenkov, K., Garnaev, A.: Closed form solutions for water-filling problems in optimization and game frameworks. Telecommun. Syst. 47(1\u20132), 153\u2013164 (2011)","journal-title":"Telecommun. Syst."},{"issue":"8","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1278","DOI":"10.1109\/TIFS.2014.2329241","volume":"9","author":"A Garnaev","year":"2014","unstructured":"Garnaev, A., Baykal-G\u00fcrsoy, M., Poor, H.V.: Incorporating attack-type uncertainty into network protection. IEEE Trans. Inf. Forensics Secur. 9(8), 1278\u20131287 (2014)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"4_CR4","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-05284-2_9","volume-title":"Security and Privacy in Communication Networks","author":"A Garnaev","year":"2009","unstructured":"Garnaev, A., Trappe, W.: An eavesdropping game with SINR as an objective function. In: Chen, Y., Dimitriou, T.D., Zhou, J. (eds.) SecureComm 2009. LNICST, vol. 19, pp. 142\u2013162. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05284-2_9"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-10262-7_12","volume-title":"Multiple Access Communications","author":"A Garnaev","year":"2014","unstructured":"Garnaev, A., Trappe, W.: Secret communication when the eavesdropper might be an active adversary. In: Jonsson, M., Vinel, A., Bellalta, B., Belyaev, E. (eds.) MACOM 2014. LNCS, vol. 8715, pp. 121\u2013136. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10262-7_12"},{"issue":"6","key":"4_CR6","doi-asserted-by":"publisher","first-page":"2180","DOI":"10.1109\/TWC.2008.060848","volume":"7","author":"S Goel","year":"2008","unstructured":"Goel, S., Negi, R.: Guaranteeing secrecy using artificial noise. IEEE Trans. Wirel. Commun. 7(6), 2180\u20132189 (2008)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"5","key":"4_CR7","doi-asserted-by":"publisher","first-page":"2110","DOI":"10.1109\/TIT.2008.920340","volume":"54","author":"L Lai","year":"2008","unstructured":"Lai, L., El Gamal, H.: The water-filling game in fading multiple-access channels. IEEE Trans. Inf. Theory 54(5), 2110\u20132122 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1109\/TIT.1978.1055917","volume":"24","author":"S Leung-Yan-Cheong","year":"1978","unstructured":"Leung-Yan-Cheong, S., Hellman, M.: The Gaussian wire-tap channel. IEEE Trans. Inf. Theory 24(4), 451\u2013456 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Rabbachin, A., Conti, A., Win, M.Z.: Intentional network interference for denial of wireless eavesdropping. In: 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, pp. 1\u20136, December 2011","DOI":"10.1109\/GLOCOM.2011.6134361"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28(4), 656\u2013715 (1949)","journal-title":"Bell Syst. Tech. J."},{"issue":"5","key":"4_CR11","doi-asserted-by":"publisher","first-page":"3153","DOI":"10.1109\/TIT.2011.2121450","volume":"57","author":"X Tang","year":"2011","unstructured":"Tang, X., Liu, R., Spasojevic, P., Poor, H.V.: Interference assisted secret communication. IEEE Trans. Inf. Theory 57(5), 3153\u20133167 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Tang, X., Liu, R., Spasojevic, P., Poor, H.V.: The Gaussian wiretap channel with a helping interferer. In: 2008 IEEE International Symposium on Information Theory, pp. 389\u2013393. IEEE (2008)","DOI":"10.1109\/ISIT.2008.4595014"},{"issue":"8","key":"4_CR13","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","volume":"54","author":"AD Wyner","year":"1975","unstructured":"Wyner, A.D.: The wire-tap channel. Bell Syst. Tech. J. 54(8), 1355\u20131387 (1975)","journal-title":"Bell Syst. Tech. J."}],"container-title":["Communications in Computer and Information Science","Network Games, Control and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87473-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:09:06Z","timestamp":1725822546000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87473-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030874728","9783030874735"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87473-5_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETGCOOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Network Games, Control and Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Carg\u00e8se","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netcoop2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/project.inria.fr\/netgcoop2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EDAS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}