{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:22:15Z","timestamp":1742941335653,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030616373"},{"type":"electronic","value":"9783030616380"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61638-0_4","type":"book-chapter","created":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T23:08:28Z","timestamp":1602630508000},"page":"58-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Group Key Agreement for Resource-constrained Devices Using Blockchains"],"prefix":"10.1007","author":[{"given":"Ya\u015far Berkay","family":"Ta\u00e7y\u0131ld\u0131z","sequence":"first","affiliation":[]},{"given":"Orhan","family":"Ermi\u015f","sequence":"additional","affiliation":[]},{"given":"G\u00fcrkan","family":"G\u00fcr","sequence":"additional","affiliation":[]},{"given":"Fatih","family":"Alag\u00f6z","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,14]]},"reference":[{"unstructured":"Hyperledger Fabric. https:\/\/www.hyperledger.org\/projects\/fabric . Accessed 30 September 2019","key":"4_CR1"},{"unstructured":"Alwen, J., et al.: Keep the dirt: tainted treekem, adaptively and actively secure continuous group key agreement. Cryptology ePrint Archive, Report 2019\/1489 (2019). https:\/\/eprint.iacr.org\/2019\/1489","key":"4_CR2"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-45708-9_11","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"M Bellare","year":"2002","unstructured":"Bellare, M., Palacio, A.: GQ and schnorr identification schemes: proofs of security against impersonation under active and concurrent attacks. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 162\u2013177. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_11"},{"unstructured":"Bobrysheva, J., Zapechnikov, S.: Post-quantum group key agreement scheme. Cryptology ePrint Archive, Report 2020\/873 (2020). https:\/\/eprint.iacr.org\/2020\/873","key":"4_CR4"},{"doi-asserted-by":"crossref","unstructured":"Brandenburger, M., Cachin, C., Kapitza, R., Sorniotti, A.: Blockchain and trusted computing: problems, pitfalls, and a solution for hyperledger fabric. arXiv e-prints arXiv:1805.08541 , May 2018","key":"4_CR5","DOI":"10.1109\/SRDS47363.2019.00045"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BFb0053443","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201994","author":"M Burmester","year":"1995","unstructured":"Burmester, M., Desmedt, Y.: A secure and efficient conference key distribution system. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 275\u2013286. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0053443"},{"unstructured":"Buterin, V.: A next-generation smart contract and decentralized application platforme. https:\/\/github.com\/ethereum\/wiki\/wiki\/White-Paper","key":"4_CR7"},{"issue":"4","key":"4_CR8","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. (TOCS) 20(4), 398\u2013461 (2002)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"94610","DOI":"10.1109\/ACCESS.2020.2993296","volume":"8","author":"R Choi","year":"2020","unstructured":"Choi, R., Hong, D., Han, S., Baek, S., Kang, W., Kim, K.: Design and implementation of constant-round dynamic group key exchange from rlwe. IEEE Access 8, 94610\u201394630 (2020)","journal-title":"IEEE Access"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/nem.739","volume":"20","author":"YH Chuang","year":"2010","unstructured":"Chuang, Y.H., Tseng, Y.M.: An efficient dynamic group key agreement protocol for imbalanced wireless networks. Int. J. Net. Man. 20, 167\u2013180 (2010)","journal-title":"Int. J. Net. Man."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inform. Theor. 22, 644\u2013654 (1976). https:\/\/doi.org\/10.1109\/TIT.1976.1055638","journal-title":"IEEE Trans. Inform. Theor."},{"doi-asserted-by":"crossref","unstructured":"Dutta, R., Barua, R.: Constant round dynamic group key agreement. In: Zhou, J., Lopez, J., Deng, R.H., Bao, F. (eds.) Information Security (2005)","key":"4_CR12","DOI":"10.1007\/11556992_6"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/11506157_9","volume-title":"Information Security and Privacy","author":"R Dutta","year":"2005","unstructured":"Dutta, R., Barua, R.: Dynamic group key agreement in tree-based setting. In: Boyd, C., Gonz\u00e1lez Nieto, J.M. (eds.) Information Security and Privacy, pp. 101\u2013112. Springer, Berlin Heidelberg, Berlin, Heidelberg (2005)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-01004-0_6","volume-title":"Transactions on Computational Science IV","author":"R Dutta","year":"2009","unstructured":"Dutta, R., Dowling, T.: Secure and efficient group key agreements for cluster based networks. In: Gavrilova, M.L., Tan, C.J.K., Moreno, E.D. (eds.) Transactions on Computational Science IV. LNCS, vol. 5430, pp. 87\u2013116. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01004-0_6"},{"issue":"7","key":"4_CR15","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1002\/sec.1089","volume":"8","author":"O Ermi\u015f","year":"2015","unstructured":"Ermi\u015f, O., Bahtiyar, \u015e., Anarim, E., \u00c7a\u011flayan, U.: An improved conference-key agreement protocol for dynamic groups with efficient fault correction. Secur. Commun. Netw. 8(7), 1347\u20131359 (2015)","journal-title":"Secur. Commun. Netw."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.comnet.2017.09.008","volume":"129","author":"O Ermi\u015f","year":"2017","unstructured":"Ermi\u015f, O., Bahtiyar, \u015e., Anarim, E., \u00c7a\u011flayan, U.: A key agreement protocol with partial backward confidentiality. Comput. Netw. 129, 159\u2013177 (2017)","journal-title":"Comput. Netw."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.adhoc.2017.10.003","volume":"67","author":"O Ermi\u015f","year":"2017","unstructured":"Ermi\u015f, O., Bahtiyar, \u015e., Anarim, E., \u00c7a\u011flayan, U.: A secure and efficient group key agreement approach for mobile ad hoc networks. Ad Hoc Netw. 67, 24\u201339 (2017)","journal-title":"Ad Hoc Netw."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TIT.1982.1056542","volume":"28","author":"I Ingemarsson","year":"1982","unstructured":"Ingemarsson, I., Tang, D., Wong, C.: A conference key distribution system. IEEE Trans. Inform. Theor. 28, 714\u2013719 (1982)","journal-title":"IEEE Trans. Inform. Theor."},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s00145-006-0361-5","volume":"20","author":"J Katz","year":"2007","unstructured":"Katz, J., Yung, M.: Scalable protocols for authenticated group key exchange. J. Cryptol. 20(1), 85\u2013113 (2007)","journal-title":"J. Cryptol."},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/984334.984337","volume":"7","author":"Y Kim","year":"2004","unstructured":"Kim, Y., Perrig, A., Tsudik, G.: Tree-based group key agreement. ACM Trans. Inform. Syst. Secur. 7(1), 60\u201396 (2004)","journal-title":"ACM Trans. Inform. Syst. Secur."},{"doi-asserted-by":"publisher","unstructured":"Konstantinou, E.: Cluster-based group key agreement for wireless ad hoc networks. In: 2008 Third International Conference on Availability, Reliability and Security, pp. 550\u2013557, March 2008. https:\/\/doi.org\/10.1109\/ARES.2008.106","key":"4_CR21","DOI":"10.1109\/ARES.2008.106"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1016\/j.jss.2009.02.006","volume":"82","author":"S Lee","year":"2009","unstructured":"Lee, S., Kim, J., Hong, S.: Security weakness of Tseng\u2019s fault-tolerant conference key agreement protocol. J. Syst. Softw. 82, 1163\u20131167 (2009)","journal-title":"J. Syst. Softw."},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-30840-1_2","volume-title":"Information Security and Cryptology \u2013 ICISC 2015","author":"H Morita","year":"2016","unstructured":"Morita, H., Schuldt, J.C.N., Matsuda, T., Hanaoka, G., Iwata, T.: On the security of the schnorr signature scheme and DSA against related-key attacks. In: Kwon, S., Yun, A. (eds.) ICISC 2015. LNCS, vol. 9558, pp. 20\u201335. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30840-1_2"},{"unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system. Technical report, Manubot (2008)","key":"4_CR24"},{"unstructured":"Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. In: 2014 USENIX Annual Technical Conference (ATC), pp. 305\u2013319 (2014)","key":"4_CR25"},{"unstructured":"Paverd, A., Martin, A., Brown, I.: Modelling and automatically analysing privacy properties for honest-but-curious adversaries. Uni. of Oxford, Technical report (2014)","key":"4_CR26"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/3-540-46885-4_68","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 89","author":"CP Schnorr","year":"1990","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Quisquater, J.J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 688\u2013689. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_68"},{"issue":"8","key":"4_CR28","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/71.877936","volume":"11","author":"M Steiner","year":"2000","unstructured":"Steiner, M., Tsudik, G., Waidner, M.: Key agreement in dynamic peer groups. IEEE Trans. Parallel Distrib. Syst. 11(8), 769\u2013780 (2000)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"4_CR29","first-page":"275","volume":"16","author":"YM Tseng","year":"2005","unstructured":"Tseng, Y.M.: An improved conference-key agreement protocol with forward secrecy. Informatica Lith. Acad. Sci. 16(2), 275\u2013284 (2005)","journal-title":"Informatica Lith. Acad. Sci."},{"issue":"7","key":"4_CR30","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1016\/j.jss.2006.10.053","volume":"80","author":"YM Tseng","year":"2007","unstructured":"Tseng, Y.M.: A communication-efficient and fault-tolerant conference-key agreement protocol with forward secrecy. J. Syst. Softw. 80(7), 1091\u20131101 (2007)","journal-title":"J. Syst. Softw."},{"unstructured":"Vukoli\u0107, M.: Hyperledger fabric: towards scalable blockchain for business. Technical report, Trust in Digital Life 2016. IBM Research (2016)","key":"4_CR31"},{"key":"4_CR32","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ins.2018.12.023","volume":"480","author":"Q Zhang","year":"2019","unstructured":"Zhang, Q., et al.: A hierarchical group key agreement protocol using orientable attributes for cloud computing. Inform. Sci. 480, 55\u201369 (2019)","journal-title":"Inform. Sci."}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61638-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T21:46:15Z","timestamp":1723758375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61638-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030616373","9783030616380"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61638-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/di.uniroma1.it\/ACNS2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"214","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":"46","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":"0","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":"21% - 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":"3.7","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":"10","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)"}},{"value":"Due to the Corona pandemic the conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}