Secure Multi-Party Computation Based on Blind Quantum Computing

Secure Multi-Party Computation Based on Blind Quantum Computing | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Secure Multi-Party Computation Based on Blind Quantum Computing Yongli Wang, Tianci Cao, Yixin Wang, Rui Zhang, Yinghui Yang, and 1 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-9186808/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 7 You are reading this latest preprint version Abstract Blind Quantum Computing (BQC) is a protocol proposed in recent years to tackle the practical need where users want to perform quantum computing tasks but lack the necessary capabilities, and thus delegate the work to quantum computing platforms while keeping their data secure throughout the process. Besides, its characteristics provide new ways for secure multi-party computation, helping multiple untrusted users to compute together securely. Most existing secure multi-party computation protocol based on blind quantum computing rely on DT(G) states to perform joint computation. However, this can lead to security risks because one client has too much authority, and these schemes also lack generality. In this paper, a secure multi-party computation protocol is proposed based on brickwork states. By exploiting and optimizing the properties of these states, the security issues in joint client computation are solved and centralized authority is avoided. Meanwhile, it reflects the interactive mode in multi-party computation. The proposed protocol effectively improves the generality of computation. Blind Quantum Computing Secure Multi-Party Computation Brickwork State Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Reviews received at journal 06 May, 2026 Reviewers agreed at journal 05 May, 2026 Reviewers agreed at journal 05 May, 2026 Reviewers invited by journal 05 May, 2026 Editor assigned by journal 23 Mar, 2026 Submission checks completed at journal 23 Mar, 2026 First submitted to journal 21 Mar, 2026 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-9186808","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":635855478,"identity":"1310f350-e097-4fb7-aeee-d9dc5593a8b0","order_by":0,"name":"Yongli Wang","email":"","orcid":"","institution":"Henan Polytechnic University","correspondingAuthor":false,"prefix":"","firstName":"Yongli","middleName":"","lastName":"Wang","suffix":""},{"id":635855479,"identity":"2eb344e3-21ef-4902-83fa-e2d53a3e6d42","order_by":1,"name":"Tianci Cao","email":"","orcid":"","institution":"Henan Polytechnic University","correspondingAuthor":false,"prefix":"","firstName":"Tianci","middleName":"","lastName":"Cao","suffix":""},{"id":635855480,"identity":"6625b070-afab-4136-8050-b719f7102536","order_by":2,"name":"Yixin Wang","email":"","orcid":"","institution":"Henan Polytechnic University","correspondingAuthor":false,"prefix":"","firstName":"Yixin","middleName":"","lastName":"Wang","suffix":""},{"id":635855481,"identity":"4d587019-60b0-4376-af95-7fd003fc9677","order_by":3,"name":"Rui Zhang","email":"","orcid":"","institution":"Henan Polytechnic University","correspondingAuthor":false,"prefix":"","firstName":"Rui","middleName":"","lastName":"Zhang","suffix":""},{"id":635855482,"identity":"3396341f-b045-4644-a521-d30c0ffad90a","order_by":4,"name":"Yinghui Yang","email":"","orcid":"","institution":"Henan Polytechnic University","correspondingAuthor":false,"prefix":"","firstName":"Yinghui","middleName":"","lastName":"Yang","suffix":""},{"id":635855483,"identity":"acf02dfc-686c-46cc-ba41-5dcb8f414a20","order_by":5,"name":"Yongli Tang","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAxUlEQVRIiWNgGAWjYDACdjBpkwCmeIjSwswMItNI13KYBC0Gh/kPfi74dT7PXCKB8cHbNgZ5c8JamJmlZ/bdLrackcBsOLeNwXBnA2EtDNK8PbcTN9xIYJPmbWNIMDhAhC2/eXvOgbSw/yZWC5s0z48DYFuYidIieZjZzJq3ITlxZ8/DZsk55yQMNxDSwne88fFtnj92idvZkw9+eFNmI0/QFgWQAsY2oAsZGBuATAkC6oFAHqSO4Q9IyygYBaNgFIwCHAAAwzRAFHN3hJUAAAAASUVORK5CYII=","orcid":"","institution":"Henan Polytechnic University","correspondingAuthor":true,"prefix":"","firstName":"Yongli","middleName":"","lastName":"Tang","suffix":""}],"badges":[],"createdAt":"2026-03-21 15:38:19","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-9186808/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-9186808/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":109205535,"identity":"12a842c1-e199-4adf-82cb-2727eecf2e1c","added_by":"auto","created_at":"2026-05-13 15:05:19","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1324163,"visible":true,"origin":"","legend":"","description":"","filename":"researchpaper.pdf","url":"https://assets-eu.researchsquare.com/files/rs-9186808/v1_covered_e953cec9-a1f0-4845-b752-3abd487c26e3.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Secure Multi-Party Computation Based on Blind Quantum Computing","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"quantum-information-processing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"qinp","sideBox":"Learn more about [Quantum Information Processing](http://link.springer.com/journal/11128)","snPcode":"11128","submissionUrl":"https://submission.nature.com/new-submission/11128/3","title":"Quantum Information Processing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Blind Quantum Computing, Secure Multi-Party Computation, Brickwork State","lastPublishedDoi":"10.21203/rs.3.rs-9186808/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-9186808/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Blind Quantum Computing (BQC) is a protocol proposed in recent years to tackle the practical need where users want to perform quantum computing tasks but lack the necessary capabilities, and thus delegate the work to quantum computing platforms while keeping their data secure throughout the process. Besides, its characteristics provide new ways for secure multi-party computation, helping multiple untrusted users to compute together securely. Most existing secure multi-party computation protocol based on blind quantum computing rely on DT(G) states to perform joint computation. However, this can lead to security risks because one client has too much authority, and these schemes also lack generality. In this paper, a secure multi-party computation protocol is proposed based on brickwork states. By exploiting and optimizing the properties of these states, the security issues in joint client computation are solved and centralized authority is avoided. Meanwhile, it reflects the interactive mode in multi-party computation. The proposed protocol effectively improves the generality of computation.","manuscriptTitle":"Secure Multi-Party Computation Based on Blind Quantum Computing","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-05-13 13:05:19","doi":"10.21203/rs.3.rs-9186808/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"editorInvitedReview","content":"","date":"2026-05-06T14:14:21+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"129125600061377513467773594684163519863","date":"2026-05-06T01:00:48+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"199815302965679754373176163226176262155","date":"2026-05-05T11:47:53+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2026-05-05T08:39:11+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2026-03-23T06:37:28+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2026-03-23T06:37:25+00:00","index":"","fulltext":""},{"type":"submitted","content":"Quantum Information Processing","date":"2026-03-21T15:23:30+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"quantum-information-processing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"qinp","sideBox":"Learn more about [Quantum Information Processing](http://link.springer.com/journal/11128)","snPcode":"11128","submissionUrl":"https://submission.nature.com/new-submission/11128/3","title":"Quantum Information Processing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"2f920042-96dd-47b0-bd98-c800686c8def","owner":[],"postedDate":"May 13th, 2026","published":true,"recentEditorialEvents":[{"type":"editorInvitedReview","content":"","date":"2026-05-06T14:14:21+00:00","index":16,"fulltext":""},{"type":"reviewerAgreed","content":"129125600061377513467773594684163519863","date":"2026-05-06T01:00:48+00:00","index":14,"fulltext":""},{"type":"reviewerAgreed","content":"199815302965679754373176163226176262155","date":"2026-05-05T11:47:53+00:00","index":13,"fulltext":""},{"type":"reviewersInvited","content":"5","date":"2026-05-05T08:39:11+00:00","index":"","fulltext":""}],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-05-13T13:05:19+00:00","versionOfRecord":[],"versionCreatedAt":"2026-05-13 13:05:19","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-9186808","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-9186808","identity":"rs-9186808","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}