{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T08:17:59Z","timestamp":1773735479968,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2018,6,26]],"date-time":"2018-06-26T00:00:00Z","timestamp":1529971200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s11128-018-1968-9","type":"journal-article","created":{"date-parts":[[2018,6,26]],"date-time":"2018-06-26T09:51:26Z","timestamp":1530006686000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Quantum secure two-party computation for set intersection with rational players"],"prefix":"10.1007","volume":"17","author":[{"given":"Arpita","family":"Maitra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,26]]},"reference":[{"key":"1968_CR1","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 413\u2013422. ACM Press (2008)","DOI":"10.1145\/1374376.1374436"},{"key":"1968_CR2","doi-asserted-by":"crossref","unstructured":"Asharov, G., Canetti, R., Hazay, C.: Towards a game theoretic view of secure computation. In: Advances in Cryptology\u2014EUROCRYPT 2011, LNCS, vol. 6632, pp. 426\u2013445 (2011)","DOI":"10.1007\/978-3-642-20465-4_24"},{"key":"1968_CR3","doi-asserted-by":"crossref","unstructured":"Groce, A., Katz, J.: Fair computation with rational players. In: Advances in Cryptology\u2014EUROCRYPT 2012, pp. 81\u201398. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-29011-4_7"},{"key":"1968_CR4","doi-asserted-by":"publisher","first-page":"2057","DOI":"10.1038\/ncomms3057","volume":"4","author":"N Brunner","year":"2013","unstructured":"Brunner, N., Linden, N.: Bell nonlocality and Bayesian game theory. Nat. Commun. 4, 2057 (2013)","journal-title":"Nat. Commun."},{"key":"1968_CR5","doi-asserted-by":"publisher","first-page":"022305","DOI":"10.1103\/PhysRevA.92.022305","volume":"92","author":"A Maitra","year":"2015","unstructured":"Maitra, A., De, S.J., Paul, G., Pal, A.: Proposal for quantum rational secret sharing. Phys. Rev. A 92, 022305 (2015)","journal-title":"Phys. Rev. A"},{"key":"1968_CR6","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s00145-011-9098-x","volume":"25","author":"C Hazay","year":"2012","unstructured":"Hazay, C., Nissim, K.: Efficient set operations in the presence of malicious adversaries. J. Cryptol. 25, 383\u2013433 (2012)","journal-title":"J. Cryptol."},{"key":"1968_CR7","doi-asserted-by":"crossref","unstructured":"Hazay, C.: Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs. In: TCC 2015, LNCS 9015, pp. 90\u2013120 (2015)","DOI":"10.1007\/978-3-662-46497-7_4"},{"key":"1968_CR8","doi-asserted-by":"crossref","unstructured":"Jarecki, S., Liu, X.: Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In: TCC 2009, LNCS 5444, pp. 577\u2013594 (2009)","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"1968_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22, 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1968_CR10","volume-title":"Cryptography Theory and Practice","author":"D Stinson","year":"2005","unstructured":"Stinson, D.: Cryptography Theory and Practice, 3rd edn. Chapman & Hall\/CRC, Boca Raton (2005)","edition":"3"},{"key":"1968_CR11","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Foundations of Computer Science (FOCS) 1994, pp. 124\u2013134. IEEE Computer Society Press (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"1968_CR12","doi-asserted-by":"publisher","first-page":"022309","DOI":"10.1103\/PhysRevA.92.022309","volume":"92","author":"R-H Shi","year":"2015","unstructured":"Shi, R.-H., Mu, Y., Zhong, H., Zhang, S.: Quantum oblivious set-member decision protocol. Phys. Rev. A 92, 022309 (2015)","journal-title":"Phys. Rev. A"},{"key":"1968_CR13","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s11128-015-1165-z","volume":"15","author":"R-H Shi","year":"2016","unstructured":"Shi, R.-H., Mu, Y., Zhong, H., Cui, J., Zhang, S.: An efficient quantum scheme for private set intersection. Quant. Inf. Process. 15, 363\u2013371 (2016)","journal-title":"Quant. Inf. Process."},{"key":"1968_CR14","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049698","author":"SD Gordon","year":"2011","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. J. ACM (2011). https:\/\/doi.org\/10.1145\/2049697.2049698","journal-title":"J. ACM"},{"key":"1968_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00145-010-9064-z","volume":"24","author":"G Asharov","year":"2010","unstructured":"Asharov, G., Lindell, Y.: Utility dependence in correct and fair rational secret sharing. J. Cryptol. 24, 157\u2013202 (2010)","journal-title":"J. Cryptol."},{"key":"1968_CR16","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s11128-013-0692-8","volume":"13","author":"YG Yang","year":"2014","unstructured":"Yang, Y.G., Sun, S.J., Xu, P., Tiang, J.: Flexible protocol for quantum private query based on B92 protocol. Quantum Inf. Process. 13, 805\u2013813 (2014)","journal-title":"Quantum Inf. Process."},{"key":"1968_CR17","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1017\/9781316809976","volume-title":"Quantum Information Theory","author":"MM Wilde","year":"2017","unstructured":"Wilde, M.M.: Quantum Information Theory, p. 2. Cambridge University Press, Cambridge (2017)"},{"key":"1968_CR18","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1214\/aos\/1176342611","volume":"2","author":"RJ Serfling","year":"1974","unstructured":"Serfling, R.J.: Probability inequalities for the sum in sampling without replacement. Ann. Stat. 2, 39 (1974)","journal-title":"Ann. Stat."},{"key":"1968_CR19","doi-asserted-by":"publisher","first-page":"802803","DOI":"10.1038\/299802a0","volume":"299","author":"WK Wootters","year":"1982","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299, 802803 (1982)","journal-title":"Nature"},{"issue":"6","key":"1968_CR20","doi-asserted-by":"publisher","first-page":"271272","DOI":"10.1016\/0375-9601(82)90084-6","volume":"92","author":"D Dieks","year":"1982","unstructured":"Dieks, D.: Communication by EPR devices. Phys. Lett. A 92(6), 271272 (1982)","journal-title":"Phys. Lett. A"},{"key":"1968_CR21","doi-asserted-by":"crossref","unstructured":"Freedman, M., Nissim, K., Pinkas, B.: Efficient private matching and set-intersection. In: EUROCRYPT\u201904, LNCS 3027, pp. 1\u201319. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"1968_CR22","doi-asserted-by":"crossref","unstructured":"Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: 5th TCC, LNCS 4948, pp. 155\u2013175. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"1968_CR23","doi-asserted-by":"crossref","unstructured":"Dachman-Soled, D., Malkin, T., Raykova, M., Yung, M.: Efficient robust private set intersection. In: ANCS, LNCS 5479, pp. 125\u2013142. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-01957-9_8"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-018-1968-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-018-1968-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-018-1968-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T09:57:16Z","timestamp":1751709436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-018-1968-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,26]]},"references-count":23,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["1968"],"URL":"https:\/\/doi.org\/10.1007\/s11128-018-1968-9","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,26]]},"assertion":[{"value":"25 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"197"}}