{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T14:47:32Z","timestamp":1774018052563,"version":"3.50.1"},"reference-count":17,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T00:00:00Z","timestamp":1773964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Henan Province Youth Talent Support Program","award":["2021HYTP011"],"award-info":[{"award-number":["2021HYTP011"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>Oblivious Transfer (OT) is a fundamental cryptographic primitive for privacy-preserving data exchange. While traditional OT protocols guarantee unconditional receiver anonymity, they inherently lack the mechanisms to prevent abusive mass data harvesting. Traceable Oblivious Transfer (TOT) addresses this by introducing \u201cconditional anonymity,\u201d revoking the privacy of malicious users. However, existing TOT mechanisms either rely on computationally expensive dynamic assumptions or require continuous interaction with a Trusted Third Party (TTP) to manage credentials. To overcome these limitations, we present an Identity-Based Traceable Oblivious Transfer (IB-TOT) protocol. By synergizing polynomial-based secret sharing with Blind Identity-Based Encryption (Blind IBE), our scheme completely eliminates the TTP during the data transfer stage. The Blind IBE extraction algorithm serves as the primary oblivious channel, utilizing data indices as user identities. We strictly bound the receiver\u2019s query quota by embedding a degree-k tracing polynomial directly into the key issuance phase. Honest clients enjoy fully protected retrieval of up to k items, whereas any attempt to exceed this quota deterministically exposes the violator\u2019s identity. Comprehensive security proofs demonstrate that IB-TOT satisfies sender privacy, receiver privacy, and strict accountability under standard static assumptions (DBDH and DL).<\/jats:p>","DOI":"10.3390\/axioms15030233","type":"journal-article","created":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T12:58:53Z","timestamp":1774011533000},"page":"233","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["IB-TOT: Identity-Based Traceable Oblivious Transfer and Its Applications"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3986-8347","authenticated-orcid":false,"given":"Weiwei","family":"Liu","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, North China University of Water Resources and Electric Power, Zhengzhou 450046, China"}]},{"given":"Yankang","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, North China University of Water Resources and Electric Power, Zhengzhou 450046, China"}]},{"given":"Kunhao","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, North China University of Water Resources and Electric Power, Zhengzhou 450046, China"}]}],"member":"1968","published-online":{"date-parts":[[2026,3,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Yao, A.C. (1982, January 3\u20135). Protocols for secure computations. Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS), Chicago, IL, USA.","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref_2","unstructured":"Rabin, M.O. (1981). How to Exchange Secrets by Oblivious Transfer, Aiken Computation Laboratory, Harvard University. Technical Report TR-81."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Yao, A.C. (1986, January 27\u201329). How to generate and exchange secrets. Proceedings of the 27th Annual Symposium on Foundations of Computer Science (FOCS), Toronto, ON, Canada.","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/3812.3818","article-title":"A randomized protocol for signing contracts","volume":"28","author":"Even","year":"1985","journal-title":"Commun. ACM"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/18.50372","article-title":"A fair protocol for signing contracts","volume":"36","author":"Goldreich","year":"1990","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","unstructured":"Brassard, G., Cr\u00e9peau, C., and Robert, J.-M. (1986). All-or-nothing disclosure of secrets. Advances in Cryptology\u2014CRYPTO \u201986, Springer."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Naor, M., and Pinkas, B. (1999). Oblivious transfer with adaptive queries. Advances in Cryptology\u2014CRYPTO \u201999, Springer.","DOI":"10.1007\/3-540-48405-1_36"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Liu, W., Zhang, Y., Mu, Y., Yang, G., and Tian, Y. (2018, January 25\u201327). Efficient traceable oblivious transfer and its applications. Proceedings of the 14th International Conference on Information Security Practice and Experience (ISPEC), Tokyo, Japan.","DOI":"10.1007\/978-3-319-99807-7_39"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Dubovitskaya, M., and Neven, G. (2009, January 9\u201313). Oblivious transfer with access control. Proceedings of the 16th ACM Conference on Computer and Communications Security (CCS), Chicago, IL, USA.","DOI":"10.1145\/1653662.1653679"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1016\/j.camwa.2011.11.048","article-title":"Efficient oblivious transfers with access control","volume":"63","author":"Han","year":"2012","journal-title":"Comput. Math. Appl."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1016\/j.jss.2010.11.886","article-title":"Oblivious transfer with timed-release receiver\u2019s privacy","volume":"84","author":"Ma","year":"2011","journal-title":"J. Syst. Softw."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Green, M., and Hohenberger, S. (2008). Universally Composable Adaptive Oblivious Transfer, Cryptology ePrint Archive. Report 2008\/163.","DOI":"10.1007\/978-3-540-89255-7_12"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Neven, G., and Shelat, A. (2007). Simulatable adaptive oblivious transfer. Advances in Cryptology\u2014EUROCRYPT 2007, Springer.","DOI":"10.1007\/978-3-540-72540-4_33"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Coull, S.E., Green, M., and Hohenberger, S. (2009). Controlling access to an oblivious database using stateful anonymous credentials. Public Key Cryptography\u2014PKC 2009, Springer.","DOI":"10.1007\/978-3-642-00468-1_28"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2502","DOI":"10.1109\/TIFS.2015.2464781","article-title":"AAC-OT: Accountable oblivious transfer with access control","volume":"10","author":"Han","year":"2015","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Liu, W., Zhang, Y., Yang, K., and Fu, B. (2025). Efficient traceable oblivious transfer schemes with access control. Symmetry, 17.","DOI":"10.3390\/sym17122066"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00145-004-0102-6","article-title":"Computationally secure oblivious transfer","volume":"18","author":"Naor","year":"2005","journal-title":"J. Cryptol."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/15\/3\/233\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T13:02:20Z","timestamp":1774011740000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/15\/3\/233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,20]]},"references-count":17,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2026,3]]}},"alternative-id":["axioms15030233"],"URL":"https:\/\/doi.org\/10.3390\/axioms15030233","relation":{},"ISSN":["2075-1680"],"issn-type":[{"value":"2075-1680","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,20]]}}}