Quantum Secure Multiparty Computation based on Secure Summation and QKD

Quantum Secure Multiparty Computation based on Secure Summation and QKD | 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 Quantum Secure Multiparty Computation based on Secure Summation and QKD Mandeep Kumar, Bhaskar Mondal This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6706796/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Secure Multiparty Computation (MPC) is a cryptography technique that allows multiple parties to securely perform operations on their private inputs without revealing them. It is used in various applications, such as data aggregation in the cloud, IoT, etc., where data privacy is the prime concern. Many researchers have explored ways to develop secure protocols with minimal risk of data leakage. Many of these classical secure MPC protocols depend on classical random number generators. However, advances in quantum information processing are putting classical key distribution methods at risk. Traditional summation protocols adopt an \(((n, n))\) threshold approach, requiring the participation of all \((n)\) players to compute the sum securely. However, the proposed quantum secure multiparty computation based on secure summation and QKD (QSMPC-SSQKD) introduces a generalised quantum secure multiparty summation protocol. The proposed protocol utilises entanglement, a fundamental property of quantum mechanics, to facilitate safe key exchange, thereby ensuring robust security measures. We use a quantum random number generator (QRNG) to generate true random numbers, ensuring privacy preservation. The protocol achieves a per-bit entropy level of 0.708 through QRNG, which provides strong randomness. The security of the proposed protocol is validated using the CHSCH test ( \((\mathcal{B}\approx2.8)\) ), ensuring that any attempt to eavesdrop on the system can be detected, and the complete process will be rescheduled. Compared to some similar protocols, the proposed QSMPC-SSQKD protocol provides higher randomness and lower quantum circuit cost without using any trusted third party (TTP). This improvement enhances the protocol’s efficiency and practicality in preventing data leakage during computation. Quantum secure multiparty computing secure summation quantum key distribution Quantum random number QPRNG Bell's inequality CHSH inequality qiskit Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted 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-6706796","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":478879224,"identity":"93d36f82-7042-4631-b285-1036fb9c6ed2","order_by":0,"name":"Mandeep Kumar","email":"","orcid":"","institution":"National Institute of Technology Patna","correspondingAuthor":false,"prefix":"","firstName":"Mandeep","middleName":"","lastName":"Kumar","suffix":""},{"id":478879225,"identity":"7f1f623a-8767-427e-9d44-e7c4a783f694","order_by":1,"name":"Bhaskar Mondal","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA6ElEQVRIiWNgGAWjYBACAwkGBsYGMJP5AEMCVPQAkVrYEhgSEkjTwmPAALcGHzCXbn78cUbNPQb+/jPfHjz8cYeBv/0A4+ECPFos5xwzk9xwrJhB4kbudoOEhGcMEmcSGA7PwOewGwlmjA+A3jCQ4N0mkZBwmIHhBgPDYR68WtI/f3zwD6iF/8wzsBZ5wlpyDCQ3tgG1MOSwgbUYENJiOSOnTHJmXwKPxI00M4mEtGc8hmcSG/BqMZdI3/yx51uCHH//4WeSP2zuyMkdP3z4Mz4tMABTc4AHHk/EggMkqR4Fo2AUjIKRAQARqk+HcSoQoQAAAABJRU5ErkJggg==","orcid":"","institution":"National Institute of Technology Patna","correspondingAuthor":true,"prefix":"","firstName":"Bhaskar","middleName":"","lastName":"Mondal","suffix":""}],"badges":[],"createdAt":"2025-05-20 10:38:11","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6706796/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6706796/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":86750338,"identity":"98773a82-e9fb-4241-92b9-46cf79852c36","added_by":"auto","created_at":"2025-07-15 08:24:16","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":401491,"visible":true,"origin":"","legend":"","description":"","filename":"MPSCQKD.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6706796/v1_covered_9de180b4-4755-4dc6-a7a0-5228758780b3.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Quantum Secure Multiparty Computation based on Secure Summation and QKD","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"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":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Quantum secure multiparty computing, secure summation, quantum key distribution, Quantum random number, QPRNG, Bell's inequality, CHSH inequality, qiskit","lastPublishedDoi":"10.21203/rs.3.rs-6706796/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6706796/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eSecure Multiparty Computation (MPC) is a cryptography technique that allows multiple parties to securely perform operations on their private inputs without revealing them. It is used in various applications, such as data aggregation in the cloud, IoT, etc., where data privacy is the prime concern. Many researchers have explored ways to develop secure protocols with minimal risk of data leakage. Many of these classical secure MPC protocols depend on classical random number generators. However, advances in quantum information processing are putting classical key distribution methods at risk. Traditional summation protocols adopt an \u003cspan class=\"InlineEquation\"\u003e\u003cspan class=\"mathinline\"\u003e\\(((n, n))\\)\u003c/span\u003e\u003c/span\u003e threshold approach, requiring the participation of all \u003cspan class=\"InlineEquation\"\u003e\u003cspan class=\"mathinline\"\u003e\\((n)\\)\u003c/span\u003e\u003c/span\u003e players to compute the sum securely. However, the proposed quantum secure multiparty computation based on secure summation and QKD (QSMPC-SSQKD) introduces a generalised quantum secure multiparty summation protocol. The proposed protocol utilises entanglement, a fundamental property of quantum mechanics, to facilitate safe key exchange, thereby ensuring robust security measures. We use a quantum random number generator (QRNG) to generate true random numbers, ensuring privacy preservation. The protocol achieves a per-bit entropy level of 0.708 through QRNG, which provides strong randomness. The security of the proposed protocol is validated using the CHSCH test (\u003cspan class=\"InlineEquation\"\u003e\u003cspan class=\"mathinline\"\u003e\\((\\mathcal{B}\\approx2.8)\\)\u003c/span\u003e\u003c/span\u003e), ensuring that any attempt to eavesdrop on the system can be detected, and the complete process will be rescheduled. Compared to some similar protocols, the proposed QSMPC-SSQKD protocol provides higher randomness and lower quantum circuit cost without using any trusted third party (TTP). This improvement enhances the protocol\u0026rsquo;s efficiency and practicality in preventing data leakage during computation.\u003c/p\u003e","manuscriptTitle":"Quantum Secure Multiparty Computation based on Secure Summation and QKD","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-07-03 15:00:44","doi":"10.21203/rs.3.rs-6706796/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"6ea35bfb-2e03-41df-81b1-78b26c1970e2","owner":[],"postedDate":"July 3rd, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-07-15T08:23:38+00:00","versionOfRecord":[],"versionCreatedAt":"2025-07-03 15:00:44","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6706796","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6706796","identity":"rs-6706796","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}