{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T08:57:48Z","timestamp":1762333068636,"version":"build-2065373602"},"reference-count":41,"publisher":"Institution of Engineering and Technology (IET)","issue":"1","license":[{"start":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T00:00:00Z","timestamp":1717891200000},"content-version":"vor","delay-in-days":160,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100007276","name":"ASELSAN","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007276","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Information Security"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:p>\n                    We present a password\u2010authenticated (2, 3)\u2010threshold group key share (PATS) mechanism. Although PATS resembles threshold secret sharing schemes, it has a different structure. The innovative perspective of the PATS mechanism that makes a difference from the standard secret\u2010sharing schemes is that it involves parties in the generation of the shares. PATS allows parties to communicate securely to establish their shares over insecure channels. Parties (shareholders) construct a secret (key) using shares obtained at the end of the protocol. PATS takes advantage of zero\u2010knowledge proofs compared to well\u2010known threshold key exchange schemes and will tolerate the existence of semi\u2010trusted parties. We present two variants of PATS, centralized and distributed, and then generalize PATS to (\n                    <jats:italic>t<\/jats:italic>\n                    ,\n                    <jats:italic>n<\/jats:italic>\n                    )\u2010threshold scheme. PATS supports the distributed operation and optionally facilitates group key verification by a trusted third party, which may also partake in group key sharing. In this paper, we present PATS, which employs finite fields and elliptic curves, along with its security and complexity analyses.\n                  <\/jats:p>","DOI":"10.1049\/2024\/7557514","type":"journal-article","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:49:09Z","timestamp":1717980549000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["PATS: Let Parties Have a Say in Threshold Group Key Sharing"],"prefix":"10.1049","volume":"2024","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9325-4795","authenticated-orcid":false,"given":"Adnan","family":"K\u0131l\u0131\u00e7","sequence":"first","affiliation":[{"name":"Department of Computer Engineering METU  Ankara T\u00fcrkiye  metu.edu.tr"},{"name":"ASELSAN  Ankara T\u00fcrkiye  aselsan.com.tr"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3691-1469","authenticated-orcid":false,"given":"Cansu","family":"Betin Onur","sequence":"additional","affiliation":[{"name":"Institute of Applied Mathematics METU  Ankara T\u00fcrkiye  metu.edu.tr"},{"name":"David R. Cheriton School of Computer Science University of Waterloo  Waterloo Canada  uwaterloo.ca"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0514-5578","authenticated-orcid":false,"given":"Ertan","family":"Onur","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering METU  Ankara T\u00fcrkiye  metu.edu.tr"},{"name":"David R. Cheriton School of Computer Science University of Waterloo  Waterloo Canada  uwaterloo.ca"},{"name":"ARLEON  Ankara T\u00fcrkiye"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"265","published-online":{"date-parts":[[2024,6,9]]},"reference":[{"key":"e_1_2_13_1_2","doi-asserted-by":"crossref","unstructured":"YaoG. WangH. andFengD. A group pake protocol using different passwords 1 2009 International Conference on Networks Security Wireless Communications and Trusted Computing 2009 Wuhan China IEEE 270\u2013273 https:\/\/doi.org\/10.1109\/NSWCTC.2009.330 2-s2.0-67650432910.","DOI":"10.1109\/NSWCTC.2009.330"},{"key":"e_1_2_13_2_2","doi-asserted-by":"crossref","unstructured":"LiuX. LiuJ. andChangG. nPAKE: an improved group PAKE protocol 2012 Ninth Web Information Systems and Applications Conference 2012 Haikou China IEEE 115\u2013118 https:\/\/doi.org\/10.1109\/WISA.2012.42 2-s2.0-84872571003.","DOI":"10.1109\/WISA.2012.42"},{"key":"e_1_2_13_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_31"},{"key":"e_1_2_13_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_15"},{"key":"e_1_2_13_5_2","doi-asserted-by":"crossref","unstructured":"HaoF. YiX. ChenL. andShahandashtiS. F. The fairy-ring dance: password authenticated key exchange in a group Proceedings of the 1st ACM Workshop on IoT Privacy Trust and Security 2015 New York NY USA Association for Computing Machinery 27\u201334 https:\/\/doi.org\/10.1145\/2732209.2732212 2-s2.0-84960385653.","DOI":"10.1145\/2732209.2732212"},{"key":"e_1_2_13_6_2","doi-asserted-by":"crossref","unstructured":"DaiQ. ZhaoX. XuQ. andJiangH. A new cross-realm group password-based authenticated key exchange protocol 2011 Seventh International Conference on Computational Intelligence and Security 2011 Sanya China IEEE 856\u2013860 https:\/\/doi.org\/10.1109\/CIS.2011.193 2-s2.0-84863017895.","DOI":"10.1109\/CIS.2011.193"},{"key":"e_1_2_13_7_2","doi-asserted-by":"crossref","unstructured":"ZhuL. GuoC. ZhangZ. FuW. andXuR. A novel contributory cross-domain group password-based authenticated key exchange protocol with adaptive security 2017 IEEE Second International Conference on Data Science in Cyberspace (DSC) 2017 Shenzhen China IEEE 213\u2013222 https:\/\/doi.org\/10.1109\/DSC.2017.89 2-s2.0-85034268650.","DOI":"10.1109\/DSC.2017.89"},{"key":"e_1_2_13_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/2955095"},{"key":"e_1_2_13_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.04.007"},{"key":"e_1_2_13_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(00)00249-8"},{"key":"e_1_2_13_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1266977.1266979"},{"key":"e_1_2_13_12_2","doi-asserted-by":"crossref","unstructured":"BlakleyG. R. Safeguarding cryptographic keys 1979 International Workshop on Managing Requirements Knowledge (MARK) 1979 New York NY USA IEEE Computer Society 313\u2013318 https:\/\/doi.org\/10.1109\/MARK.1979.8817296.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"e_1_2_13_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_2_13_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056651"},{"key":"e_1_2_13_15_2","doi-asserted-by":"crossref","unstructured":"ChorB. GoldwasserS. MicaliS. andAwerbuchB. Verifiable secret sharing and achieving simultaneity in the presence of faults 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) 1985 Portland OR USA IEEE 383\u2013395 https:\/\/doi.org\/10.1109\/SFCS.1985.64.","DOI":"10.1109\/SFCS.1985.64"},{"key":"e_1_2_13_16_2","doi-asserted-by":"crossref","unstructured":"FeldmanP. A practical scheme for non-interactive verifiable secret sharing 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) 1987 Los Angeles CA USA IEEE 427\u2013438 https:\/\/doi.org\/10.1109\/SFCS.1987.4.","DOI":"10.1109\/SFCS.1987.4"},{"key":"e_1_2_13_17_2","series-title":"Lecture Notes in Computer Science","first-page":"251","volume-title":"Advances in Cryptology\u2014CRYPTO\u2019 86","author":"Benaloh J. C.","year":"1986"},{"key":"e_1_2_13_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2020.2975792"},{"key":"e_1_2_13_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-17146-8_15"},{"key":"e_1_2_13_20_2","doi-asserted-by":"crossref","unstructured":"BagherzandiA. JareckiS. SaxenaN. andLuY. Password-protected secret sharing Proceedings of the 18th ACM conference on Computer and Communications Security 2011 ACM 433\u2013444 https:\/\/doi.org\/10.1145\/2046707.2046758 2-s2.0-80755168333.","DOI":"10.1145\/2046707.2046758"},{"key":"e_1_2_13_21_2","doi-asserted-by":"crossref","unstructured":"CamenischJ. LysyanskayaA. andNevenG. Practical yet universally composable two-server password-authenticated secret sharing Proceedings of the 2012 ACM Conference on Computer and Communications Security 2012 ACM 525\u2013536 https:\/\/doi.org\/10.1145\/2382196.2382252 2-s2.0-84869417078.","DOI":"10.1145\/2382196.2382252"},{"key":"e_1_2_13_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2023.3287487"},{"key":"e_1_2_13_23_2","doi-asserted-by":"crossref","unstructured":"WeirM. AggarwalS. CollinsM. andSternH. Testing metrics for password creation policies by attacking large sets of revealed passwords Proceedings of the 17th ACM conference on Computer and communications security 2010 ACM 162\u2013175 https:\/\/doi.org\/10.1145\/1866307.1866327 2-s2.0-78650022232.","DOI":"10.1145\/1866307.1866327"},{"key":"e_1_2_13_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17697-5_10"},{"key":"e_1_2_13_25_2","doi-asserted-by":"crossref","unstructured":"HaoF.andvan OorschotP. C. Sok: password-authenticated key exchange\u2013theory practice standardization and real-world lessons 2021 Cryptology ePrint Archive.","DOI":"10.1145\/3488932.3523256"},{"key":"e_1_2_13_26_2","doi-asserted-by":"crossref","unstructured":"AbdallaM. BarbosaM. R\u00f8nneP. B. RyanP. Y. and\u0160alaP. Security characterization of j-pake and its variants 2021 Cryptology ePrint Archive Report 2021\/824 https:\/\/ia.cr\/2021\/824.","DOI":"10.1007\/978-3-319-91280-6_300285"},{"key":"e_1_2_13_27_2","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8236"},{"key":"e_1_2_13_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOMSTD.121.2100005"},{"key":"e_1_2_13_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2721359"},{"key":"e_1_2_13_30_2","doi-asserted-by":"crossref","unstructured":"WangD. ZhangZ. WangP. YanJ. andHuangX. Targeted online password guessing: an underestimated threat Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security 2016 ACM 1242\u20131254 https:\/\/doi.org\/10.1145\/2976749.2978339 2-s2.0-84995390356.","DOI":"10.1145\/2976749.2978339"},{"key":"e_1_2_13_31_2","doi-asserted-by":"publisher","DOI":"10.17487\/RFC8235"},{"key":"e_1_2_13_32_2","doi-asserted-by":"crossref","unstructured":"BarkerE. B. JohnsonD. andSmidM. E. Sp 800-56a. recommendation for pair-wise key establishment schemes using discrete logarithm cryptography (revised) 2007.","DOI":"10.6028\/NIST.SP.800-56ar"},{"key":"e_1_2_13_33_2","first-page":"629","article-title":"Cryptanalysis of two pake protocols for body area networks and smart environments","volume":"17","author":"Toorani M.","year":"2015","journal-title":"International Journal of Network Security"},{"key":"e_1_2_13_34_2","doi-asserted-by":"crossref","unstructured":"TooraniM. Security analysis of j-pake 2014 IEEE Symposium on Computers and Communications (ISCC) 2014 IEEE 1\u20136.","DOI":"10.1109\/ISCC.2014.6912576"},{"key":"e_1_2_13_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2006.08.005"},{"key":"e_1_2_13_36_2","doi-asserted-by":"publisher","DOI":"10.1201\/9781420057133"},{"key":"e_1_2_13_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054851"},{"key":"e_1_2_13_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-23483-7_367"},{"key":"e_1_2_13_39_2","first-page":"63","article-title":"Secret sharing schemes with applications in security protocols","volume":"16","author":"Iftene S.","year":"2006","journal-title":"Scientific Annals of Cuza University"},{"volume-title":"Digital Signature Standard (dss)","year":"2013","author":"Kerry C. F.","key":"e_1_2_13_40_2"},{"key":"e_1_2_13_41_2","unstructured":"BarkerE.andDangQ. Nist special publication 800-57 part 1 revision 4 2016 NIST Tech. Rep vol. 16."}],"container-title":["IET Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/2024\/7557514","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T08:52:16Z","timestamp":1762332736000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/2024\/7557514"}},"subtitle":[],"editor":[{"given":"Helena","family":"Rif\u00e0-Pous","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["10.1049\/2024\/7557514"],"URL":"https:\/\/doi.org\/10.1049\/2024\/7557514","archive":["Portico"],"relation":{},"ISSN":["1751-8709","1751-8717"],"issn-type":[{"type":"print","value":"1751-8709"},{"type":"electronic","value":"1751-8717"}],"subject":[],"published":{"date-parts":[[2024,1]]},"assertion":[{"value":"2023-08-09","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-04-23","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"7557514"}}