{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T05:40:09Z","timestamp":1743572409086,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031856990","type":"print"},{"value":"9783031857003","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-85700-3_22","type":"book-chapter","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T05:00:12Z","timestamp":1743570012000},"page":"301-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Private Computation of\u00a0Boolean Functions Using Single Qubits"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6357-4923","authenticated-orcid":false,"given":"Zeinab","family":"Rahmani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2101-5896","authenticated-orcid":false,"given":"Armando N.","family":"Pinto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5037-2588","authenticated-orcid":false,"given":"Luis S.","family":"Barbosa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,1]]},"reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.93.032339","volume":"93","author":"S Barz","year":"2016","unstructured":"Barz, S., Dunjko, V., Schlederer, F., Moore, M., Kashefi, E., Walmsley, I.A.: Enhanced delegated computing using coherence. Phys. Rev. A 93(3), 032339 (2016). https:\/\/doi.org\/10.1103\/PhysRevA.93.032339","journal-title":"Phys. Rev. A"},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, STOC 1990, pp. 503\u2013513. Association for Computing Machinery, New York (1990). https:\/\/doi.org\/10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"22_CR3","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation, pp. 351\u2013371. Association for Computing Machinery, New York (2019). https:\/\/doi.org\/10.1145\/3335741.3335756","DOI":"10.1145\/3335741.3335756"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.tcs.2014.05.025","volume":"560","author":"CH Bennett","year":"2014","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. Theoret. Comput. Sci. 560, 7\u201311 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2014.05.025","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1038\/nphys1157","volume":"5","author":"HJ Briegel","year":"2009","unstructured":"Briegel, H.J., Browne, D.E., D\u00fcr, W., Raussendorf, R., Van den Nest, M.: Measurement-based quantum computation. Nat. Phys. 5(1), 19\u201326 (2009). https:\/\/doi.org\/10.1038\/nphys1157","journal-title":"Nat. Phys."},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-021-09403-1","volume":"34","author":"SS Burra","year":"2021","unstructured":"Burra, S.S., et al.: High-performance multi-party computation for binary circuits based on oblivious transfer. J. Cryptol. 34(3), 1\u201387 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09403-1","journal-title":"J. Cryptol."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"2793","DOI":"10.1007\/s10773-010-0472-5","volume":"49","author":"XB Chen","year":"2010","unstructured":"Chen, X.B., Xu, G., Yang, Y.X., Wen, Q.Y.: An efficient protocol for the secure multi-party quantum summation. Int. J. Theor. Phys. 49, 2793\u20132804 (2010). https:\/\/doi.org\/10.1007\/s10773-010-0472-5","journal-title":"Int. J. Theor. Phys."},{"issue":"6","key":"22_CR8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.96.062317","volume":"96","author":"M Clementi","year":"2017","unstructured":"Clementi, M., Pappa, A., Eckstein, A., Walmsley, I.A., Kashefi, E., Barz, S.: Classical multiparty computation using quantum resources. Phys. Rev. A 96(6), 062317 (2017). https:\/\/doi.org\/10.1103\/PhysRevA.96.062317","journal-title":"Phys. Rev. A"},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s11047-012-9353-6","volume":"12","author":"W van Dam","year":"2012","unstructured":"van Dam, W.: Implausible consequences of superstrong nonlocality. Nat. Comput. 12(1), 9\u201312 (2012). https:\/\/doi.org\/10.1007\/s11047-012-9353-6","journal-title":"Nat. Comput."},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40203-6_1","volume-title":"Computer Security \u2013 ESORICS 2013","author":"I Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure MPC for dishonest majority \u2013 or: breaking the SPDZ limits. In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 1\u201318. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40203-6_1"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography, 1 edn, pp. 365\u2013390. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3549993.3550007","DOI":"10.1145\/3549993.3550007"},{"key":"22_CR13","doi-asserted-by":"publisher","unstructured":"Ferreira, M.J., Silva, N.A., Pinto, A.N., Muga, N.J.: Statistical validation of a physical prime random number generator based on quantum noise. Appl. Sci. 13(23) (2023). https:\/\/doi.org\/10.3390\/app132312619","DOI":"10.3390\/app132312619"},{"issue":"1","key":"22_CR14","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/j.optcom.2010.09.005","volume":"284","author":"HY Jia","year":"2011","unstructured":"Jia, H.Y., Wen, Q.Y., Song, T.T., Gao, F.: Quantum protocol for millionaire problem. Opt. Commun. 284(1), 545\u2013549 (2011). https:\/\/doi.org\/10.1016\/j.optcom.2010.09.005","journal-title":"Opt. Commun."},{"key":"22_CR15","doi-asserted-by":"publisher","unstructured":"Keller, M., Orsini, E., Scholl, P.: Mascot: faster malicious arithmetic secure computation with oblivious transfer. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS 2016, pp. 830\u2013842. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2976749.2978357","DOI":"10.1145\/2976749.2978357"},{"key":"22_CR16","doi-asserted-by":"publisher","unstructured":"Knott, B., Venkataraman, S., Hannun, A., Sengupta, S., Ibrahim, M., van\u00a0der Maaten, L.: Crypten: secure multi-party computation meets machine learning. In: Proceedings of the 35th International Conference on Neural Information Processing Systems, NIPS 2021. Curran Associates Inc., Red Hook (2024). https:\/\/doi.org\/10.48550\/arXiv.2109.00984","DOI":"10.48550\/arXiv.2109.00984"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-662-44381-1_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"E Larraia","year":"2014","unstructured":"Larraia, E., Orsini, E., Smart, N.P.: Dishonest majority multi-party computation for binary circuits. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 495\u2013512. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_28"},{"key":"22_CR18","doi-asserted-by":"publisher","unstructured":"Lemus, M., et al.: Generation and distribution of quantum oblivious keys for secure multiparty computation. Appl. Sci. 10(12) (2020). https:\/\/doi.org\/10.3390\/app10124080","DOI":"10.3390\/app10124080"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"16456","DOI":"10.1109\/ACCESS.2020.2966800","volume":"8","author":"W Liu","year":"2020","unstructured":"Liu, W., Zhang, W.: A quantum protocol for secure manhattan distance computation. IEEE Access 8, 16456\u201316461 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2966800","journal-title":"IEEE Access"},{"issue":"2","key":"22_CR20","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1103\/PhysRevA.56.1154","volume":"56","author":"HK Lo","year":"1997","unstructured":"Lo, H.K.: Insecurity of quantum secure computations. Phys. Rev. A 56(2), 1154\u20131162 (1997). https:\/\/doi.org\/10.1103\/PhysRevA.56.1154","journal-title":"Phys. Rev. A"},{"issue":"6","key":"22_CR21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.81.062336","volume":"81","author":"K Loukopoulos","year":"2010","unstructured":"Loukopoulos, K., Browne, D.E.: Secure multiparty computation with a dishonest majority via quantum means. Phys. Rev. A 81(6), 062336 (2010). https:\/\/doi.org\/10.1103\/PhysRevA.81.062336","journal-title":"Phys. Rev. A"},{"issue":"8","key":"22_CR22","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8121\/ab9aea","volume":"54","author":"C Lu","year":"2021","unstructured":"Lu, C., Miao, F., Hou, J., Su, Z., Xiong, Y.: Secure multi-party computation with a quantum manner. J. Phys. A: Math. Theor. 54(8), 085301 (2021). https:\/\/doi.org\/10.1088\/1751-8121\/ab9aea","journal-title":"J. Phys. A: Math. Theor."},{"issue":"1","key":"22_CR23","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0034-4877(06)80014-5","volume":"57","author":"MA Nielsen","year":"2006","unstructured":"Nielsen, M.A.: Cluster-state quantum computation. Rep. Math. Phys. 57(1), 147\u2013161 (2006). https:\/\/doi.org\/10.1016\/S0034-4877(06)80014-5","journal-title":"Rep. Math. Phys."},{"issue":"3","key":"22_CR24","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1049\/qtc2.12059","volume":"4","author":"Z Rahmani","year":"2023","unstructured":"Rahmani, Z., Barbosa, L.S., Pinto, A.N.: Quantum privacy-preserving service for secure lane change in vehicular networks. IET Quantum Commun. 4(3), 103\u2013111 (2023). https:\/\/doi.org\/10.1049\/qtc2.12059","journal-title":"IET Quantum Commun."},{"key":"22_CR25","doi-asserted-by":"publisher","unstructured":"Rahmani, Z., Pinto, A.H.M.N., Barbosa, L.M.D.C.S.: Secure two-party computation via measurement-based quantum computing. Quantum Inf. Process. 23(6), 221 (2024). https:\/\/doi.org\/10.1007\/s11128-024-04433-7","DOI":"10.1007\/s11128-024-04433-7"},{"issue":"2","key":"22_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.68.022312","volume":"68","author":"R Raussendorf","year":"2003","unstructured":"Raussendorf, R., Browne, D.E., Briegel, H.J.: Measurement-based quantum computation on cluster states. Phys. Rev. A 68(2), 022312 (2003). https:\/\/doi.org\/10.1103\/PhysRevA.68.022312","journal-title":"Phys. Rev. A"},{"issue":"2","key":"22_CR27","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978). https:\/\/doi.org\/10.1145\/359340.359342","journal-title":"Commun. ACM"},{"key":"22_CR28","doi-asserted-by":"publisher","unstructured":"Santos, M.B., Gomes, A.C., Pinto, A.N., Mateus, P.: Quantum secure multiparty computation of phylogenetic trees of sars-cov-2 genome. In: 2021 Telecoms Conference (ConfTELE), pp.\u00a01\u20135 (2021). https:\/\/doi.org\/10.1109\/ConfTELE50222.2021.9435479","DOI":"10.1109\/ConfTELE50222.2021.9435479"},{"issue":"170","key":"22_CR29","doi-asserted-by":"publisher","first-page":"483","DOI":"10.2307\/2007968","volume":"44","author":"R Schoof","year":"1985","unstructured":"Schoof, R.: Elliptic curves over finite fields and the computation of square roots mod p. Math. Comput. 44(170), 483\u2013494 (1985). https:\/\/doi.org\/10.2307\/2007968","journal-title":"Math. Comput."},{"issue":"4","key":"22_CR30","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/TCSII.2020.3032550","volume":"68","author":"RH Shi","year":"2021","unstructured":"Shi, R.H.: Quantum multiparty privacy set intersection cardinality. IEEE Trans. Circuits Syst. II Express Briefs 68(4), 1203\u20131207 (2021). https:\/\/doi.org\/10.1109\/TCSII.2020.3032550","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"22_CR31","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science, pp. 160\u2013164 (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.38","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-85700-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T05:00:15Z","timestamp":1743570015000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-85700-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031856990","9783031857003"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-85700-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ostrava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppam.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}