{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T13:17:26Z","timestamp":1785417446906,"version":"3.56.0"},"reference-count":25,"publisher":"International Association for Cryptologic Research","issue":"2","license":[{"start":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T00:00:00Z","timestamp":1743984000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2025,6,2]]},"abstract":"<jats:p>\n                    Tracing techniques have been used to identify users who have leaked their decryption keys in a secure multi-receiver encryption system. Very recently, in the field of distributed cryptography, where trust is distributed, Boneh et al. extended traitor tracing to the framework of threshold decryption, where a single user doesn't hold the whole secret to decrypt but needs to collaborate with others. However, the tracing capacity in their collusion-secure codes-based schemes is still centralized: only the authority holding the secret tracing key can perform tracing. We continue in the direction of not relying on a single entity and propose decentralizing tracing in this context so that the tracing procedure does not need to rely on any secret key and can be done by anyone. Technically, as binary collusion-secure codes only support secret tracing, we switch to robust\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mrow>\n                        <mml:mi>q<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    -ary IPP codes supporting public tracing. This requires us to generalize the bipartite threshold KEM for two users in Boneh et al.'s paper to\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mrow>\n                        <mml:mi>q<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    -partite KEM for q users. In terms of security, their static one-sided security in the binary case is not appropriate, which requires us to define an adaptive one-sided security notion for\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mrow>\n                        <mml:mi>q<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    -partite KEM to be compatible with\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                      <mml:mrow>\n                        <mml:mi>q<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:math>\n                    -ary IPP codes. Finally, we generalize the Boneh et al. construction to achieve this security notion and achieve public traceability for threshold decryption without degrading efficiency.\n                  <\/jats:p>","DOI":"10.62056\/akjb0lmol","type":"journal-article","created":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T17:09:09Z","timestamp":1751908149000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":2,"title":["Public Traceability in Threshold Decryption"],"prefix":"10.62056","volume":"2","author":[{"given":"S\u00e9bastien","family":"Canard","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/01naq7912","id-type":"ROR","asserted-by":"publisher"}],"name":"T\u00e9l\u00e9com Paris","place":["19 place Marguerite Perey, Palaiseau, 91120, France"],"department":["Institut Polytechnique de Paris"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nathan","family":"Papon","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/01naq7912","id-type":"ROR","asserted-by":"publisher"}],"name":"T\u00e9l\u00e9com Paris","place":["19 place Marguerite Perey, Palaiseau, 91120, France"],"department":["Institut Polytechnique de Paris"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1136-4064","authenticated-orcid":false,"given":"Duong","family":"Phan","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/01naq7912","id-type":"ROR","asserted-by":"publisher"}],"name":"T\u00e9l\u00e9com Paris","place":["19 place Marguerite Perey, Palaiseau, 91120, France"],"department":["Institut Polytechnique de Paris"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"48349","published-online":{"date-parts":[[2025,7,7]]},"reference":[{"key":"ref1:C:ChoFiaNao94","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","article-title":"Tracing Traitors","volume":"839","author":"Benny Chor","year":"1994"},{"key":"ref2:C:BonParRot24b","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-031-68394-7_11","article-title":"Accountability for Misbehavior in Threshold Decryption via\n  Threshold Traitor Tracing","volume":"14926","author":"Dan Boneh","year":"2024"},{"key":"ref3:C:BonFra99","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-48405-1_22","article-title":"An Efficient Public Key Traitor Tracing Scheme","volume":"1666","author":"Dan Boneh","year":"1999"},{"key":"ref4:DRM:KiaYun02","isbn-type":"print","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-47870-1_3","article-title":"On Crafty Pirates and Foxy Tracers","author":"Aggelos Kiayias","year":"2002","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540478706"},{"key":"ref5:Pfitzmann96","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-61996-8_31","article-title":"Trials of Traced Traitors","volume":"1174","author":"B. Pfitzmann","year":"1996"},{"key":"ref6:CCS:PfiWai97","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/266420.266453","article-title":"Asymmetric Fingerprinting for Larger Collusions","author":"Birgit Pfitzmann","year":"1997"},{"key":"ref7:RSA:WatHanIma01","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/3-540-45353-9_29","article-title":"Efficient Asymmetric Public-Key Traitor Tracing without\n  Trusted Agents","volume":"2020","author":"Yuji Watanabe","year":"2001"},{"key":"ref8:PKC:KWHI01","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/3-540-44586-2_17","article-title":"Efficient Asymmetric Self-Enforcement Scheme with Public\n  Traceability","volume":"1992","author":"Hirotaka Komaki","year":"2001"},{"key":"ref9:KiYu02:asymmetric","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-44993-5_3","article-title":"Breaking and Repairing Asymmetric Public-Key\n  Traitor Tracing","volume":"2696","author":"A. Kiayias","year":"2002"},{"key":"ref10:EC:ChaPhaPoi05","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/11426639_32","article-title":"Public Traceability in Traitor Tracing Schemes","volume":"3494","author":"Herv\u00e9 Chabanne","year":"2005"},{"key":"ref11:CCS:BonWat06","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/1180405.1180432","article-title":"A fully collusion resistant broadcast, trace, and revoke\n  system","author":"Dan Boneh","year":"2006"},{"key":"ref12:C:BonZha14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-662-44371-2_27","article-title":"Multiparty Key Exchange, Efficient Traitor Tracing, and More\n  from Indistinguishability Obfuscation","volume":"8616","author":"Dan Boneh","year":"2014"},{"key":"ref13:ICALP:PhaSafTon06","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/11787006_23","article-title":"Generic Construction of Hybrid Public Key Traitor Tracing\n  with Full-Public-Traceability","volume":"4052","author":"Duong Phan","year":"2006"},{"key":"ref14:C:BonSha95","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/3-540-44750-4_36","article-title":"Collusion-Secure Fingerprinting for Digital Data (Extended\n  Abstract)","volume":"963","author":"Dan Boneh","year":"1995"},{"key":"ref15:TIT:BarKab11","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1109\/TIT.2012.2220522","article-title":"Robust Parent-Identifying Codes and Combinatorial Arrays","volume":"59","author":"Alexander Barg","year":"2013","journal-title":"IEEE Trans. Inf. Theor.","ISSN":"https:\/\/id.crossref.org\/issn\/0018-9448","issn-type":"electronic"},{"key":"ref16:ACM:BonKiaMon10","series-title":"DRM '10","isbn-type":"print","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1866870.1866873","article-title":"Robust fingerprinting codes: a near optimal construction","author":"Dan Boneh","year":"2010","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450300919"},{"key":"ref17:ACNS:DoPhaYun20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-030-57878-7_8","article-title":"A Concise Bounded Anonymous Broadcast Yielding Combinatorial\n  Trace-and-Revoke Schemes","volume":"12147","author":"Xuan Thanh Do","year":"2020"},{"key":"ref18:STOC:GoyKopWat18","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1145\/3188745.3188844","article-title":"Collusion resistant traitor tracing from learning with\n  errors","author":"Rishab Goyal","year":"2018"},{"key":"ref19:EC:BonSahWat06","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/11761679_34","article-title":"Fully Collusion Resistant Traitor Tracing with Short\n  Ciphertexts and Private Keys","volume":"4004","author":"Dan Boneh","year":"2006"},{"key":"ref20:FC:NaoPin00","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45472-1_1","article-title":"Efficient Trace and Revoke Schemes","volume":"1962","author":"Moni Naor","year":"2001"},{"key":"ref21:C:NaoNaoLot01","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-44647-8_3","article-title":"Revocation and Tracing Schemes for Stateless Receivers","volume":"2139","author":"Dalit Naor","year":"2001"},{"key":"ref22:AC:KimHwaLee03","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-540-40061-5_23","article-title":"An Efficient Public Key Trace and Revoke Scheme Secure\n  against Adaptive Chosen Ciphertext Attack","volume":"2894","author":"Chong Hee Kim","year":"2003"},{"key":"ref23:PKC:DodFaz03","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-36288-6_8","article-title":"Public Key Trace and Revoke Scheme Secure against Adaptive\n  Chosen Ciphertext Attack","volume":"2567","author":"Yevgeniy Dodis","year":"2003"},{"key":"ref24:CCS:ABPSY17","doi-asserted-by":"publisher","first-page":"2277","DOI":"10.1145\/3133956.3134041","article-title":"Efficient Public Trace and Revoke from Standard Assumptions:\n  Extended Abstract","author":"Shweta Agrawal","year":"2017"},{"key":"ref25:EC:NisWicZha16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-662-49896-5_14","article-title":"Anonymous Traitor Tracing: How to Embed Arbitrary\n  Information in a Key","volume":"9666","author":"Ryo Nishimaki","year":"2016"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T17:09:55Z","timestamp":1751908195000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/2\/2\/21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,7]]},"references-count":25,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,7,7]]}},"URL":"https:\/\/doi.org\/10.62056\/akjb0lmol","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,7]]},"assertion":[{"value":"2025-04-07","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-06-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc2-2-53"}}