IACR Communications in Cryptology IACR CiC

Public Traceability in Threshold Decryption

Authors

Sébastien Canard, Nathan Papon, Duong Hieu Phan
Sébastien Canard
Télécom Paris, Palaiseau, France
sebastien dot canard at telecom-paris dot fr
Nathan Papon
Télécom Paris, Palaiseau, France
nathan dot papon at telecom-paris dot fr
Duong Hieu Phan ORCID
Télécom Paris, Palaiseau, France
hieu dot phan at telecom-paris dot fr
Keywords: Threshold decryption Traitor Tracing IPP codes

Abstract

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 $q$-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 $q$-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 $q$-partite KEM to be compatible with $q$-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.

References

[ABP+17]
Shweta Agrawal, Sanjay Bhattacherjee, Duong Hieu Phan, Damien Stehlé, and Shota Yamada. Efficient Public Trace and Revoke from Standard Assumptions: Extended Abstract. In Bhavani M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu, editors, ACM CCS 2017, pages 2277–2293. 2017. ACM Press. DOI: 10.1145/3133956.3134041
Google Scholar ePrint
[BF99]
Dan Boneh and Matthew K. Franklin. An Efficient Public Key Traitor Tracing Scheme. In Michael J. Wiener, editor, CRYPTO'99, volume 1666 of LNCS, pages 338–353. August 1999. Springer, Berlin, Heidelberg. DOI: 10.1007/3-540-48405-1_22
Google Scholar ePrint
[BK13]
Alexander Barg and Grigory Kabatiansky. Robust Parent-Identifying Codes and Combinatorial Arrays. IEEE Trans. Inf. Theor., 59(2):994–1003, February 2013. DOI: 10.1109/TIT.2012.2220522
Google Scholar ePrint
[BKM10]
Dan Boneh, Aggelos Kiayias, and Hart William Montgomery. Robust fingerprinting codes: a near optimal construction. In Proceedings of the Tenth Annual ACM Workshop on Digital Rights Management, pages 3–12, New York, NY, USA. 2010. Association for Computing Machinery. DOI: 10.1145/1866870.1866873
Google Scholar ePrint
[BPR24]
Dan Boneh, Aditi Partap, and Lior Rotem. Accountability for Misbehavior in Threshold Decryption via Threshold Traitor Tracing. In Leonid Reyzin and Douglas Stebila, editors, CRYPTO 2024, Part VII, volume 14926 of LNCS, pages 317–351. August 2024. Springer, Cham. DOI: 10.1007/978-3-031-68394-7_11
Google Scholar ePrint
[BS95]
Dan Boneh and James Shaw. Collusion-Secure Fingerprinting for Digital Data (Extended Abstract). In Don Coppersmith, editor, CRYPTO'95, volume 963 of LNCS, pages 452–465. August 1995. Springer, Berlin, Heidelberg. DOI: 10.1007/3-540-44750-4_36
Google Scholar ePrint
[BSW06]
Dan Boneh, Amit Sahai, and Brent Waters. Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys. In Serge Vaudenay, editor, EUROCRYPT 2006, volume 4004 of LNCS, pages 573–592. 2006. Springer, Berlin, Heidelberg. DOI: 10.1007/11761679_34
Google Scholar ePrint
[BW06]
Dan Boneh and Brent Waters. A fully collusion resistant broadcast, trace, and revoke system. In Ari Juels, Rebecca N. Wright, and Sabrina De Capitani di Vimercati, editors, ACM CCS 2006, pages 211–220. 2006. ACM Press. DOI: 10.1145/1180405.1180432
Google Scholar ePrint
[BZ14]
Dan Boneh and Mark Zhandry. Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation. In Juan A. Garay and Rosario Gennaro, editors, CRYPTO 2014, Part I, volume 8616 of LNCS, pages 480–499. August 2014. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-662-44371-2_27
Google Scholar ePrint
[CFN94]
Benny Chor, Amos Fiat, and Moni Naor. Tracing Traitors. In Yvo Desmedt, editor, CRYPTO'94, volume 839 of LNCS, pages 257–270. August 1994. Springer, Berlin, Heidelberg. DOI: 10.1007/3-540-48658-5_25
Google Scholar ePrint
[CPP05]
Hervé Chabanne, Duong Hieu Phan, and David Pointcheval. Public Traceability in Traitor Tracing Schemes. In Ronald Cramer, editor, EUROCRYPT 2005, volume 3494 of LNCS, pages 542–558. May 2005. Springer, Berlin, Heidelberg. DOI: 10.1007/11426639_32
Google Scholar ePrint
[DF03]
Yevgeniy Dodis and Nelly Fazio. Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack. In Yvo Desmedt, editor, PKC 2003, volume 2567 of LNCS, pages 100–115. January 2003. Springer, Berlin, Heidelberg. DOI: 10.1007/3-540-36288-6_8
Google Scholar ePrint
[DPY20]
Xuan Thanh Do, Duong Hieu Phan, and Moti Yung. A Concise Bounded Anonymous Broadcast Yielding Combinatorial Trace-and-Revoke Schemes. In Mauro Conti, Jianying Zhou, Emiliano Casalicchio, and Angelo Spognardi, editors, ACNS 20International Conference on Applied Cryptography and Network Security, Part II, volume 12147 of LNCS, pages 145–164. October 2020. Springer, Cham. DOI: 10.1007/978-3-030-57878-7_8
Google Scholar ePrint
[GKW18]
Rishab Goyal, Venkata Koppula, and Brent Waters. Collusion resistant traitor tracing from learning with errors. In Ilias Diakonikolas, David Kempe, and Monika Henzinger, editors, 50th ACM STOC, pages 660–670. June 2018. ACM Press. DOI: 10.1145/3188745.3188844
Google Scholar ePrint
[KHL03]
Chong Hee Kim, Yong Ho Hwang, and Pil Joong Lee. An Efficient Public Key Trace and Revoke Scheme Secure against Adaptive Chosen Ciphertext Attack. In Chi-Sung Laih, editor, ASIACRYPT 2003, volume 2894 of LNCS, pages 359–373. 2003. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-540-40061-5_23
Google Scholar ePrint
[KWHI01]
Hirotaka Komaki, Yuji Watanabe, Goichiro Hanaoka, and Hideki Imai. Efficient Asymmetric Self-Enforcement Scheme with Public Traceability. In Kwangjo Kim, editor, PKC 2001, volume 1992 of LNCS, pages 225–239. February 2001. Springer, Berlin, Heidelberg. DOI: 10.1007/3-540-44586-2_17
Google Scholar ePrint
[KY02a]
A. Kiayias and M. Yung. Breaking and Repairing Asymmetric Public-Key Traitor Tracing. In Digital Rights Management—DRM '02, volume 2696 of LNCS, pages 32–50. 2002. Springer. DOI: 10.1007/978-3-540-44993-5_3
Google Scholar ePrint
[KY02b]
Aggelos Kiayias and Moti Yung. On Crafty Pirates and Foxy Tracers. In Tomas Sander, editor, Security and Privacy in Digital Rights Management, pages 22–39, Berlin, Heidelberg. 2002. Springer Berlin Heidelberg. DOI: 10.1007/3-540-47870-1_3
Google Scholar ePrint
[NNL01]
Dalit Naor, Moni Naor, and Jeffery Lotspiech. Revocation and Tracing Schemes for Stateless Receivers. In Joe Kilian, editor, CRYPTO 2001, volume 2139 of LNCS, pages 41–62. August 2001. Springer, Berlin, Heidelberg. DOI: 10.1007/3-540-44647-8_3
Google Scholar ePrint
[NP01]
Moni Naor and Benny Pinkas. Efficient Trace and Revoke Schemes. In Yair Frankel, editor, FC 2000, volume 1962 of LNCS, pages 1–20. February 2001. Springer, Berlin, Heidelberg. DOI: 10.1007/3-540-45472-1_1
Google Scholar ePrint
[NWZ16]
Ryo Nishimaki, Daniel Wichs, and Mark Zhandry. Anonymous Traitor Tracing: How to Embed Arbitrary Information in a Key. In Marc Fischlin and Jean-Sébastien Coron, editors, EUROCRYPT 2016, Part II, volume 9666 of LNCS, pages 388–419. May 2016. Springer, Berlin, Heidelberg. DOI: 10.1007/978-3-662-49896-5_14
Google Scholar ePrint
[Pfi96]
B. Pfitzmann. Trials of Traced Traitors. In Information Hiding, volume 1174 of LNCS, pages 49–64. 1996. Springer. DOI: 10.1007/3-540-61996-8_31
Google Scholar ePrint
[PST06]
Duong Phan, Reihaneh Safavi-Naini, and Dongvu Tonien. Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability. In Michele Bugliesi, Bart Preneel, Vladimiro Sassone, and Ingo Wegener, editors, ICALP 2006, Part II, volume 4052 of LNCS, pages 264–275. July 2006. Springer, Berlin, Heidelberg. DOI: 10.1007/11787006_23
Google Scholar ePrint
[PW97]
Birgit Pfitzmann and Michael Waidner. Asymmetric Fingerprinting for Larger Collusions. In Richard Graveman, Philippe A. Janson, Clifford Neuman, and Li Gong, editors, ACM CCS 97, pages 151–160. April 1997. ACM Press. DOI: 10.1145/266420.266453
Google Scholar ePrint
[WHI01]
Yuji Watanabe, Goichiro Hanaoka, and Hideki Imai. Efficient Asymmetric Public-Key Traitor Tracing without Trusted Agents. In David Naccache, editor, CT-RSA 2001, volume 2020 of LNCS, pages 392–407. April 2001. Springer, Berlin, Heidelberg. DOI: 10.1007/3-540-45353-9_29
Google Scholar ePrint

PDFPDF Open access

DOI: https://doi.org/10.62056/akjb0lmol
History
Submitted: 2025-04-07
Accepted: 2025-06-02
Published: 2025-07-07
Crossmark logo
How to cite

Sébastien Canard, Nathan Papon, and Duong Hieu Phan, Public Traceability in Threshold Decryption. IACR Communications in Cryptology, vol. 2, no. 2, Jul 07, 2025, doi: 10.62056/akjb0lmol.

Citations

There are at least 2 citations.

License

Copyright is held by the author(s)

This work is licensed under a Creative Commons Attribution (CC BY) license.