Federated k-Core Decomposition: A Secure Distributed Approach

Federated k-Core Decomposition: A Secure Distributed Approach | 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 Federated k-Core Decomposition: A Secure Distributed Approach Bin Guo, Emil Sekerinski, Lingyang Chu This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6606890/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 As one of the most well-studied cohesive subgraph models, the k-core is widely used to find graph nodes that are “central” or “important” in many applications, such as biological networks, social networks, ecological networks, and financial networks. For Decentralized Online Social Networks (DOSNs), where each vertex is a client as a single computing unit, distributed k-core decomposition algorithms have already been proposed. However, current distributed approaches fail to adequately protect privacy and security. In today’s data-driven world, data privacy and security have attracted more and more attention, e.g., DOSNs are proposed to protect privacy by storing user information locally without using a single centralized server. In this work, we are the first to propose the secure version of the distributed k-core decomposition. graph k-core decomposition distributed privacy Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 10 May, 2025 Reviews received at journal 10 May, 2025 Reviewers agreed at journal 08 May, 2025 Reviewers invited by journal 08 May, 2025 Editor assigned by journal 08 May, 2025 Submission checks completed at journal 07 May, 2025 First submitted to journal 06 May, 2025 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-6606890","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":454623499,"identity":"804af1a4-ea23-486f-a38a-27e2d5a20c01","order_by":0,"name":"Bin Guo","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAuUlEQVRIiWNgGAWjYBACA2YwZUO6ljQJIMHYQJwWCHWYBC3m7LyHX/NUnK8zb+89/piHwU6eoBbLZr40a54ztyVkzpxLbOZhSDYkaJXBYR4zY9622xISEjmGQC0HCLsOquWchIT8G7AWe2K0GD/mbTsAtIUHrCWRoBbLZh4zxjlnkiVn8OQYzpxjkJxMUIs5/xnjD28q7Pgl2M8YgBi2BLUAAZsEkjuJUA8EzB+IUzcKRsEoGAUjFgAAWwAzkYU1uPoAAAAASUVORK5CYII=","orcid":"","institution":"Trent University","correspondingAuthor":true,"prefix":"","firstName":"Bin","middleName":"","lastName":"Guo","suffix":""},{"id":454623500,"identity":"584e8cb0-9bfd-414b-b0e1-e2638be07fe9","order_by":1,"name":"Emil Sekerinski","email":"","orcid":"","institution":"McMaster University","correspondingAuthor":false,"prefix":"","firstName":"Emil","middleName":"","lastName":"Sekerinski","suffix":""},{"id":454623501,"identity":"97fa47e1-46eb-4e78-977f-430b5fb8baad","order_by":2,"name":"Lingyang Chu","email":"","orcid":"","institution":"McMaster University","correspondingAuthor":false,"prefix":"","firstName":"Lingyang","middleName":"","lastName":"Chu","suffix":""}],"badges":[],"createdAt":"2025-05-07 01:23:13","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6606890/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6606890/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":82570217,"identity":"123022d7-91aa-4e5d-a0d5-1ddbc47374a1","added_by":"auto","created_at":"2025-05-13 04:04:09","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":780427,"visible":true,"origin":"","legend":"","description":"","filename":"FederatedkcoreSNAMJournal.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6606890/v1_covered_15e98c5a-868e-4992-957e-09ae080ce6e8.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Federated k-Core Decomposition: A Secure Distributed Approach","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"social-network-analysis-and-mining","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"snam","sideBox":"Learn more about [Social Network Analysis and Mining](http://link.springer.com/journal/13278)","snPcode":"13278","submissionUrl":"https://submission.nature.com/new-submission/13278/3","title":"Social Network Analysis and Mining","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"graph, k-core decomposition, distributed, privacy","lastPublishedDoi":"10.21203/rs.3.rs-6606890/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6606890/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eAs one of the most well-studied cohesive subgraph models, the k-core is widely used to find graph nodes that are “central” or “important” in many applications, such as biological networks, social networks, ecological networks, and financial networks. For Decentralized Online Social Networks (DOSNs), where each vertex is a client as a single computing unit, distributed k-core decomposition algorithms have already been proposed. However, current distributed approaches fail to adequately protect privacy and security. In today’s data-driven world, data privacy and security have attracted more and more attention, e.g., DOSNs are proposed to protect privacy by storing user information locally without using a single centralized server. In this work, we are the first to propose the secure version of the distributed k-core decomposition.\u003c/p\u003e","manuscriptTitle":"Federated k-Core Decomposition: A Secure Distributed Approach","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-05-13 03:56:04","doi":"10.21203/rs.3.rs-6606890/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-05-10T08:28:58+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-05-10T06:41:40+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"115210532391953968887969530167641134960","date":"2025-05-08T11:54:18+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-05-08T08:16:44+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-05-08T05:23:27+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-05-08T03:38:18+00:00","index":"","fulltext":""},{"type":"submitted","content":"Social Network Analysis and Mining","date":"2025-05-07T01:15:49+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"social-network-analysis-and-mining","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"snam","sideBox":"Learn more about [Social Network Analysis and Mining](http://link.springer.com/journal/13278)","snPcode":"13278","submissionUrl":"https://submission.nature.com/new-submission/13278/3","title":"Social Network Analysis and Mining","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"0ec7e8f2-0da1-40a8-b73e-156d95906cfa","owner":[],"postedDate":"May 13th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2025-05-29T16:53:27+00:00","versionOfRecord":[],"versionCreatedAt":"2025-05-13 03:56:04","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6606890","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6606890","identity":"rs-6606890","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}