{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T22:59:16Z","timestamp":1780873156040,"version":"3.54.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T00:00:00Z","timestamp":1776988800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T00:00:00Z","timestamp":1780876800000},"content-version":"vor","delay-in-days":45,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100011033","name":"Agencia Estatal de Investigaci\u00f3n","doi-asserted-by":"publisher","award":["PID2021-124613OB-I00"],"award-info":[{"award-number":["PID2021-124613OB-I00"]}],"id":[{"id":"10.13039\/501100011033","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013410","name":"Instituto Nacional de Ciberseguridad","doi-asserted-by":"publisher","award":["C039\/24"],"award-info":[{"award-number":["C039\/24"]}],"id":[{"id":"10.13039\/501100013410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Inf. Secur."],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Priced oblivious transfer (POT) is a cryptographic protocol in which a merchant provides a set of items for sale and a customer acquires one of them. The protocol guarantees that the customer receives the item if and only if they have paid its price, while the merchant remains oblivious to the acquired item. Obviously, the merchant cannot not know what price the client has paid, as such price could be unique. A recent paper proposes a POT protocol that is built from two blocks: an e-coin system and an asymmetric secure computation protocol. In this paper, we present a quantum-resistant proposal for the latter building block. As a result, we are able to construct a quantum-resistant POT protocol implemented from the newly proposed asymmetric secure computation protocol and a post-quantum implementation of the mentioned e-coin system. To our knowledge, no quantum-resistant POT protocol has been proposed so far.<\/jats:p>","DOI":"10.1186\/s13635-026-00236-8","type":"journal-article","created":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T05:17:01Z","timestamp":1777007821000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantum-resistant asymmetric secure computation with applications to priced oblivious transfer"],"prefix":"10.1186","volume":"2026","author":[{"given":"Francesc","family":"Seb\u00e9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergi","family":"Simon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,24]]},"reference":[{"issue":"5","key":"236_CR1","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/S0097539704383633","volume":"35","author":"M Naor","year":"2006","unstructured":"M. Naor, B. Pinkas, Oblivious polynomial evaluation. SIAM J. Comput. 35(5), 1254\u20131281 (2006). https:\/\/doi.org\/10.1137\/S0097539704383633","journal-title":"SIAM J. Comput."},{"key":"236_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44987-6_8","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"B Aiello","year":"2001","unstructured":"B. Aiello, Y. Ishai, O. Reingold, Priced oblivious transfer: How to sell digital goods, in Advances in Cryptology \u2014 EUROCRYPT 2001. ed. by B. Pfitzmann (Springer, Berlin, Heidelberg, 2001), pp.119\u2013135. https:\/\/doi.org\/10.1007\/3-540-44987-6_8"},{"issue":"2","key":"236_CR3","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1109\/TIFS.2017.2746058","volume":"13","author":"W Biesmans","year":"2017","unstructured":"W. Biesmans, J. Balasch, A. Rial, B. Preneel, I. Verbauwhede, Private mobile pay-TV from priced oblivious transfer. IEEE Trans. Inf. Forensics Secur. 13(2), 280\u2013291 (2017). https:\/\/doi.org\/10.1109\/TIFS.2017.2746058","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"236_CR4","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1007\/s10207-022-00604-8","volume":"21","author":"R Borges","year":"2022","unstructured":"R. Borges, F. Seb\u00e9, M. Valls, Anonymous and unlinkable electronic toll collection system. Int. J. Inf. Secur. 21, 1151\u20131162 (2022). https:\/\/doi.org\/10.1007\/s10207-022-00604-8","journal-title":"Int. J. Inf. Secur."},{"key":"236_CR5","doi-asserted-by":"publisher","unstructured":"F. Seb\u00e9, S. Sim\u00f3n, E-coin-based priced oblivious transfer with a fast item retrieval. Cryptography 8(1), (2024). https:\/\/doi.org\/10.3390\/cryptography8010010","DOI":"10.3390\/cryptography8010010"},{"key":"236_CR6","doi-asserted-by":"publisher","unstructured":"J.M. Miret, F. Seb\u00e9, S. Sim\u00f3n, A quantum-resistant implementation of a digital cash system with valued and no-valued e-coins. In: XVIII Spanish Meeting on Cryptology and Information Security, Le\u00f3n, Spain. https:\/\/doi.org\/10.18002\/recsi","DOI":"10.18002\/recsi"},{"issue":"6","key":"236_CR7","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"S. Even, O. Goldreich, A. Lempel, A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985). https:\/\/doi.org\/10.1145\/3812.3818","journal-title":"Commun. ACM"},{"key":"236_CR8","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1145\/2976749.2978381","volume-title":"Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201916","author":"V Kolesnikov","year":"2016","unstructured":"V. Kolesnikov, R. Kumaresan, M. Rosulek, N. Trieu, Efficient batched oblivious prf with applications to private set intersection, in Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201916. (Association for Computing Machinery, New York, 2016), pp.818\u2013829. https:\/\/doi.org\/10.1145\/2976749.2978381"},{"key":"236_CR9","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-47721-7","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"G Brassard","year":"1987","unstructured":"G. Brassard, C. Crepeau, J.-M. Robert, All-or-nothing disclosure of secrets, in Advances in Cryptology \u2014 CRYPTO\u2019 86. ed. by A.M. Odlyzko (Springer, Berlin, Heidelberg, 1987), pp.234\u2013238. https:\/\/doi.org\/10.1007\/3-540-47721-7"},{"key":"236_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.compeleceng.2019.01.021","volume":"75","author":"B Mi","year":"2019","unstructured":"B. Mi, D. Huang, S. Wan, Y. Hu, K.-K.R. Choo, A post-quantum light weight 1-out-n oblivious transfer protocol. Comput. Electr. Eng. 75, 90\u2013100 (2019). https:\/\/doi.org\/10.1016\/j.compeleceng.2019.01.021","journal-title":"Comput. Electr. Eng."},{"key":"236_CR11","doi-asserted-by":"publisher","DOI":"10.1145\/3339252.3339280","volume-title":"Post-quantum uc-secure oblivious transfer in the standard model with adaptive corruptions. ARES \u201919","author":"O Blazy","year":"2019","unstructured":"O. Blazy, C. Chevalier, Q.H. Vu, Post-quantum uc-secure oblivious transfer in the standard model with adaptive corruptions. ARES \u201919 (Association for Computing Machinery, New York, 2019). https:\/\/doi.org\/10.1145\/3339252.3339280"},{"key":"236_CR12","unstructured":"A. Abadi, Y. Desmedt, Scalable Post-Quantum Oblivious Transfers for Resource-Constrained Receivers. Cryptology ePrint Archive, Paper 2025\/036 (2025). Accessed 22 April 2026. https:\/\/eprint.iacr.org\/2025\/036"},{"key":"236_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-12678-9_9","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2010","author":"A Rial","year":"2010","unstructured":"A. Rial, B. Preneel, Optimistic fair priced oblivious transfer, in Progress in Cryptology \u2013 AFRICACRYPT 2010. ed. by D.J. Bernstein, T. Lange (Springer, Berlin, Heidelberg, 2010), pp.131\u2013147. https:\/\/doi.org\/10.1007\/978-3-642-12678-9_9"},{"key":"236_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-030-35423-7_14","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2019","author":"A Damodaran","year":"2019","unstructured":"A. Damodaran, M. Dubovitskaya, A. Rial, UC priced oblivious transfer with purchase statistics and dynamic pricing, in Progress in Cryptology \u2013 INDOCRYPT 2019. ed. by F. Hao, S. Ruj, S. Sen\u00a0Gupta (Springer, Cham, 2019), pp.273\u2013296. https:\/\/doi.org\/10.1007\/978-3-030-35423-7_14"},{"key":"236_CR15","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-14577-3_8","volume-title":"Financial Cryptography and Data Security","author":"J Camenisch","year":"2010","unstructured":"J. Camenisch, M. Dubovitskaya, G. Neven, Unlinkable priced oblivious transfer with rechargeable wallets, in Financial Cryptography and Data Security. ed. by R. Sion (Springer, Berlin, Heidelberg, 2010), pp.66\u201381"},{"issue":"3","key":"236_CR16","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1093\/comjnl\/bxad031","volume":"67","author":"R Borges","year":"2023","unstructured":"R. Borges, F. Seb\u00e9, An e-Coin based construction for unlinkable priced oblivious transfer. Comput. J. 67(3), 933\u2013940 (2023). https:\/\/doi.org\/10.1093\/comjnl\/bxad031","journal-title":"Comput. J."},{"key":"236_CR17","doi-asserted-by":"publisher","unstructured":"R. Borges, F. Seb\u00e9, A digital cash paradigm with valued and no-valued e-coins. Appl. Sci. 11(21), (2021). https:\/\/doi.org\/10.3390\/app11219892","DOI":"10.3390\/app11219892"},{"key":"236_CR18","doi-asserted-by":"publisher","unstructured":"P.W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, in Proceedings 35th Annual Symposium on Foundations of Computer Science. (1994), pp.124\u2013134. https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"236_CR19","doi-asserted-by":"publisher","unstructured":"D. Micciancio, in Shortest Vector Problem. ed by H.C.A. Tilborg (Springer, Boston, 2005), pp. 569\u2013570. https:\/\/doi.org\/10.1007\/0-387-23483-7_392","DOI":"10.1007\/0-387-23483-7_392"},{"key":"236_CR20","unstructured":"P.-A. Fouque, J. Hoffstein, P. Kirchner, V. Lyubashevsky, T. Pornin, T. Prest, T. Ricosset, G. Seiler, W. Whyte, Z. Zhang, FALCON: Fast-Fourier Lattice-based Compact Signatures over NTRU. https:\/\/falcon-sign.info\/. Accessed 18 Mar 2024"},{"key":"236_CR21","doi-asserted-by":"publisher","unstructured":"J. Bos, L. Ducas, E. Kiltz, T. Lepoint, V. Lyubashevsky, J.M. Schanckk, P. Schwabe, G. Seiler, D. Stehl\u00e9, CRYSTALS - Kyber: A CCA-secure module-lattice-based KEM. in IEEE European Symposium on Security and Privacy. (London, 2018), pp. 353\u2013367. https:\/\/doi.org\/10.1109\/EuroSP.2018.00032","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"236_CR22","unstructured":"L. Ducas, T. Lepoint, V. Lyubashevsky, P. Schwabe, G. Seiler, D. Stehl\u00e9, CRYSTALS \u2013 Dilithium: Digital Signatures from Module Lattices. Cryptology ePrint Archive, Paper 2017\/633 (2017). Accessed 22 April 2026. https:\/\/eprint.iacr.org\/2017\/633"},{"key":"236_CR23","doi-asserted-by":"publisher","unstructured":"M. Ajtai, Generating hard instances of lattice problems. in Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing (1996), pp. 99\u2013108. https:\/\/doi.org\/10.1145\/237814.237838","DOI":"10.1145\/237814.237838"},{"key":"236_CR24","unstructured":"Q. Lai, C. Chen, F.-H. Liu, A. Lysyanskaya, Z. Wang, Lattice-based Commit-Transferrable Signatures and Applications to Anonymous Credentials. Cryptology ePrint Archive, Paper 2023\/766 (2023). Accessed 22 April 2026. https:\/\/eprint.iacr.org\/2023\/766"},{"key":"236_CR25","unstructured":"R. Avanzi, J. Bos, L. Ducas, E. Kiltz, T. Lepoint, V. Lyubashevsky, J.M. Schanck, P. Schwabe, G. Seiler, D. Stehl\u00e9, CRYSTALS-Kyber (version 3.02)-submission to round 3 of the NIST post-quantum project. NIST, Tech. Rep (2020)"},{"key":"236_CR26","unstructured":"M.R. Albrecht, C. Cid, J.-C. Faug\u00e8re, L. Perret, Algebraic Algorithms for LWE. Cryptology ePrint Archive, Paper 2014\/1018 (2014). Accessed 22 April 2026. https:\/\/eprint.iacr.org\/2014\/1018"},{"issue":"3","key":"236_CR27","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"M.R. Albrecht, R. Player, S. Scott, On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). https:\/\/doi.org\/10.1515\/jmc-2015-0016","journal-title":"J. Math. Cryptol."},{"key":"236_CR28","unstructured":"S. Simon, GitHub - sergisi\/failure-probability. (2025). https:\/\/github.com\/sergisi\/failure-probability. Accessed 30 Jul 2025"},{"key":"236_CR29","unstructured":"S. Simon, GitHub - sergisi\/postquantic-pot. (2025). https:\/\/github.com\/sergisi\/postquantic-pot. Accessed 30 Jul 2025"}],"container-title":["Journal on Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13635-026-00236-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13635-026-00236-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13635-026-00236-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,7]],"date-time":"2026-06-07T22:35:45Z","timestamp":1780871745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s13635-026-00236-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,24]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["236"],"URL":"https:\/\/doi.org\/10.1186\/s13635-026-00236-8","relation":{},"ISSN":["3091-4515"],"issn-type":[{"value":"3091-4515","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,24]]},"assertion":[{"value":"30 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"15"}}