A trustworthy and reliable multi-keyword search inblockchain-assisted cloud-edge storage

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher

Abstract

Edge computing has low transmission delay and unites more agile interconnected devices spread acrossgeographies, which enables cloud-edge storage more suitable for distributed data sharing. This paper proposes a trustworthy and reliable multi-keyword search (TRMS) in blockchain-assisted cloud-edgestorage, where data users can choose a faster search based on edge servers or a wider search based on cloud servers. To acquire trustworthy search results and find reliable servers, the blockchain-based smart contract is introduced in our scheme, which will execute the search algorithm and update the score-based trust management model. In this way, search results and trust scores will be published and recorded on the blockchain. By checking search results, data users can judge whether the returned documents are top-k documents. Based on the trust management model, we can punish the malicious behavior of search servers, while data users can choose more reliable servers based on trust scores. To improve efficiency, we design a threshold-based depth-first search algorithm. Security analysis and extensive experiments are conducted to prove the security and efficiency of the proposed scheme.
Full text 14,340 characters · extracted from preprint-html · click to expand
A trustworthy and reliable multi-keyword search inblockchain-assisted cloud-edge storage | 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 A trustworthy and reliable multi-keyword search inblockchain-assisted cloud-edge storage Xingchen Liu, Shaohui Zhang, Haiping Huang, Reza Malekian This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-3240497/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 07 Feb, 2024 Read the published version in Peer-to-Peer Networking and Applications → Version 1 posted 13 You are reading this latest preprint version Abstract Edge computing has low transmission delay and unites more agile interconnected devices spread acrossgeographies, which enables cloud-edge storage more suitable for distributed data sharing. This paper proposes a trustworthy and reliable multi-keyword search (TRMS) in blockchain-assisted cloud-edgestorage, where data users can choose a faster search based on edge servers or a wider search based on cloud servers. To acquire trustworthy search results and find reliable servers, the blockchain-based smart contract is introduced in our scheme, which will execute the search algorithm and update the score-based trust management model. In this way, search results and trust scores will be published and recorded on the blockchain. By checking search results, data users can judge whether the returned documents are top-k documents. Based on the trust management model, we can punish the malicious behavior of search servers, while data users can choose more reliable servers based on trust scores. To improve efficiency, we design a threshold-based depth-first search algorithm. Security analysis and extensive experiments are conducted to prove the security and efficiency of the proposed scheme. trustworthy multi-keyword search reliable servers cloud-edge storage blockchain-based smart contracts Full Text Additional Declarations No competing interests reported. Supplementary Files Atrustworthyandreliablemultikeywordsearchinblockchainassistedcloudedgestorage.zip Cite Share Download PDF Status: Published Journal Publication published 07 Feb, 2024 Read the published version in Peer-to-Peer Networking and Applications → Version 1 posted Editorial decision: Revision requested 01 Dec, 2023 Reviews received at journal 19 Nov, 2023 Reviewers agreed at journal 14 Nov, 2023 Reviewers agreed at journal 26 Oct, 2023 Reviewers agreed at journal 24 Oct, 2023 Reviews received at journal 05 Oct, 2023 Reviewers agreed at journal 02 Oct, 2023 Reviewers agreed at journal 27 Sep, 2023 Reviewers agreed at journal 19 Sep, 2023 Reviewers invited by journal 19 Sep, 2023 Editor assigned by journal 04 Sep, 2023 Submission checks completed at journal 13 Aug, 2023 First submitted to journal 06 Aug, 2023 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-3240497","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":226102373,"identity":"5f6e718e-5077-4a2d-bbf6-da6c1221a532","order_by":0,"name":"Xingchen Liu","email":"","orcid":"","institution":"Nanjing University of Posts and Telecommunications","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Xingchen","middleName":"","lastName":"Liu","suffix":""},{"id":226102374,"identity":"0079b8e2-de44-4493-9ce7-57e6194de4f4","order_by":1,"name":"Shaohui Zhang","email":"","orcid":"","institution":"Nanjing University of Posts and Telecommunications","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Shaohui","middleName":"","lastName":"Zhang","suffix":""},{"id":226102375,"identity":"ab91f8ad-de42-426a-8454-63f3f4103d61","order_by":2,"name":"Haiping Huang","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAtUlEQVRIiWNgGAWjYBACAwkGxgcMPBCOBLFamA1AWnhI0cIGVkm8FnPp3mPVBTKH8+wZmA/e5mGwyyOoxXLOubTbM3gOF/MwsCVb8zAkFxN22I0cs9s8PIcTexh4zKR5GA4kNhCjpRiihf8b8VqYobawEaslL1mahye9mOcwm7HlHINkYrTkHvzM22Odx97e/PDGmwo7wlrAEcLYw5DAwAw2gbB6iBaGH0Ato2AUjIJRMApwAQB7qzQd/IeD5gAAAABJRU5ErkJggg==","orcid":"","institution":"Nanjing University of Posts and Telecommunications","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Haiping","middleName":"","lastName":"Huang","suffix":""},{"id":226102376,"identity":"0d0bb2e9-9606-4098-b576-3f163acd0238","order_by":3,"name":"Reza Malekian","email":"","orcid":"","institution":"Malmo University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Reza","middleName":"","lastName":"Malekian","suffix":""}],"badges":[],"createdAt":"2023-08-07 03:44:09","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-3240497/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-3240497/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s12083-024-01635-9","type":"published","date":"2024-02-07T15:01:03+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":51005594,"identity":"aac1ad65-f412-4f98-97ca-39f362209fd6","added_by":"auto","created_at":"2024-02-12 15:10:38","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":596491,"visible":true,"origin":"","legend":"","description":"","filename":"Atrustworthyandreliablemultikeywordsearchinblockchainassistedcloudedgestorage.pdf","url":"https://assets-eu.researchsquare.com/files/rs-3240497/v1_covered_9160a52d-9c84-4b19-8540-7ef878deca4a.pdf"},{"id":41750222,"identity":"1d5a6393-2634-42c0-849a-c1b52a5baeee","added_by":"auto","created_at":"2023-08-18 07:41:32","extension":"zip","order_by":2,"title":"","display":"","copyAsset":false,"role":"supplement","size":1094345,"visible":true,"origin":"","legend":"","description":"","filename":"Atrustworthyandreliablemultikeywordsearchinblockchainassistedcloudedgestorage.zip","url":"https://assets-eu.researchsquare.com/files/rs-3240497/v1/278d9ac1420e62caafbce2fd.zip"}],"financialInterests":"No competing interests reported.","formattedTitle":"A trustworthy and reliable multi-keyword search inblockchain-assisted cloud-edge storage","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":"peer-to-peer-networking-and-applications","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"ppna","sideBox":"Learn more about [Peer-to-Peer Networking and Applications](http://link.springer.com/journal/12083)","snPcode":"12083","submissionUrl":"https://submission.nature.com/new-submission/12083/3","title":"Peer-to-Peer Networking and Applications","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"trustworthy multi-keyword search, reliable servers, cloud-edge storage, blockchain-based smart contracts","lastPublishedDoi":"10.21203/rs.3.rs-3240497/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-3240497/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Edge computing has low transmission delay and unites more agile interconnected devices spread acrossgeographies, which enables cloud-edge storage more suitable for distributed data sharing. This paper proposes a trustworthy and reliable multi-keyword search (TRMS) in blockchain-assisted cloud-edgestorage, where data users can choose a faster search based on edge servers or a wider search based on cloud servers. To acquire trustworthy search results and find reliable servers, the blockchain-based smart contract is introduced in our scheme, which will execute the search algorithm and update the score-based trust management model. In this way, search results and trust scores will be published and recorded on the blockchain. By checking search results, data users can judge whether the returned documents are top-k documents. Based on the trust management model, we can punish the malicious behavior of search servers, while data users can choose more reliable servers based on trust scores. To improve efficiency, we design a threshold-based depth-first search algorithm. Security analysis and extensive experiments are conducted to prove the security and efficiency of the proposed scheme.","manuscriptTitle":"A trustworthy and reliable multi-keyword search inblockchain-assisted cloud-edge storage","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2023-08-18 07:41:28","doi":"10.21203/rs.3.rs-3240497/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2023-12-02T01:48:44+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2023-11-19T11:45:01+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"5ef40274-f5ef-4502-a91d-8e31a9bf27b5","date":"2023-11-14T10:31:36+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"78bf96f9-e4a3-4afc-a7f4-7226a7edd5ba","date":"2023-10-27T02:03:01+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"a103d619-9f9d-4635-aa22-597719d63f6a","date":"2023-10-24T04:18:57+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2023-10-05T13:36:38+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"98cfa9c5-757b-45cf-ab78-fbecfd3b09dd","date":"2023-10-02T15:25:13+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"67155bed-8a56-4b1a-8709-425f4027ad2c_SNPRID","date":"2023-09-27T10:53:34+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"2d604cab-aa7c-4f60-aafa-3d065ffc02b0","date":"2023-09-19T09:48:20+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2023-09-19T09:41:46+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2023-09-04T13:16:34+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2023-08-13T20:49:38+00:00","index":"","fulltext":""},{"type":"submitted","content":"Peer-to-Peer Networking and Applications","date":"2023-08-07T03:31:53+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"peer-to-peer-networking-and-applications","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"ppna","sideBox":"Learn more about [Peer-to-Peer Networking and Applications](http://link.springer.com/journal/12083)","snPcode":"12083","submissionUrl":"https://submission.nature.com/new-submission/12083/3","title":"Peer-to-Peer Networking and Applications","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"0f27569b-c7f7-44c2-96e3-0544352f543a","owner":[],"postedDate":"August 18th, 2023","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2024-02-12T15:04:04+00:00","versionOfRecord":{"articleIdentity":"rs-3240497","link":"https://doi.org/10.1007/s12083-024-01635-9","journal":{"identity":"peer-to-peer-networking-and-applications","isVorOnly":false,"title":"Peer-to-Peer Networking and Applications"},"publishedOn":"2024-02-07 15:01:03","publishedOnDateReadable":"February 7th, 2024"},"versionCreatedAt":"2023-08-18 07:41:28","video":"","vorDoi":"10.1007/s12083-024-01635-9","vorDoiUrl":"https://doi.org/10.1007/s12083-024-01635-9","workflowStages":[]},"version":"v1","identity":"rs-3240497","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-3240497","identity":"rs-3240497","version":["v1"]},"buildId":"ApUGefWb6u5IBVtyqm6d5","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00
unpaywall
last seen: 2026-05-30T02:00:01.510937+00:00
License: CC-BY-4.0