Secure interval keyword search protocol based on interval function secret sharing

Secure interval keyword search protocol based on interval function secret sharing | 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 Article Secure interval keyword search protocol based on interval function secret sharing DaZeng Yuan, MingXing He, Ling Xiong This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6195106/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 keyword retrieval means that a querying user submits a query to a database server containing multiple keywords without disclosing the query information to anyone and completes the query. Here, secure interval keyword retrieval refers to querying the occurrence frequency of keywords within an interval (a,b). Regarding the privacy and security issues in secure interval keyword retrieval,an additive interval function secret sharing (IFSS) scheme based on modular operation is initially proposed. The correctness, security, and efficiency of this scheme is analyzed, and it is the first IFSS scheme. Subsequently, using this IFSS scheme as a tool, a secure interval keyword retrieval protocol based on IFSS is constructed. In this protocol, it is assumed that p servers possess a database D consisting of m keywords wi. The querying user forms his query interval (a,b) into an interval function f(a,b)1, generates p sub-key kj for this interval function using IFSS technology, and sends them to the p servers. Then, the client performs modular addition operations based on the responses yj returned by the p servers to obtain the occurrence frequency of the keywords within the interval (a,b) in the database D. The protocol is analyzed, and it is verified that this protocol is correct, secure, and relatively efficient, and it is the first multi-server secure interval keyword retrieval protocol. Physical sciences/Engineering Physical sciences/Mathematics and computing 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-6195106","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":437441840,"identity":"0ef9398e-4448-4e7b-a281-9442c8cc52d3","order_by":0,"name":"DaZeng Yuan","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAxUlEQVRIiWNgGAWjYNACNgY7xvbGxocfSNGSzNxzuNlYghQtjO0z0tsEeIhRbHAj+dkDhrI6Zt6ZD9sYJBjs5HQbCGpJMzdgOMfGJzk7se1BAUOysdkBgloSzCQY23iYDWcnthtIMBxI3EZYS/o3oBYJxv03D7ZJ8BCnJQdkiwFj4wxGIrVInnlTJsFwLiGZsScRGMgGRPiF73j6NglgiAGj8vjDhx8q7OQIalEAKmD+g3AnAeUgIN9AhKJRMApGwSgY4QAAF3ZAZMyA3EwAAAAASUVORK5CYII=","orcid":"","institution":"Dazhou Vocational College of Chinese Medicine","correspondingAuthor":true,"prefix":"","firstName":"DaZeng","middleName":"","lastName":"Yuan","suffix":""},{"id":437441842,"identity":"0a5a8cd9-8d00-4763-b1c0-e07f5c436c17","order_by":1,"name":"MingXing He","email":"","orcid":"","institution":"Xihua University","correspondingAuthor":false,"prefix":"","firstName":"MingXing","middleName":"","lastName":"He","suffix":""},{"id":437441844,"identity":"f57abeca-f082-4328-9acc-bdd0e20d19d6","order_by":2,"name":"Ling Xiong","email":"","orcid":"","institution":"Xihua University","correspondingAuthor":false,"prefix":"","firstName":"Ling","middleName":"","lastName":"Xiong","suffix":""}],"badges":[],"createdAt":"2025-03-10 11:38:16","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6195106/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6195106/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":86134402,"identity":"6dce0d41-574e-44ad-91ee-f9088c245fdf","added_by":"auto","created_at":"2025-07-07 07:32:17","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":244536,"visible":true,"origin":"","legend":"","description":"","filename":"Re3Secureintervalkeywordsearchprotocolbasedonintervalfunctionsecretsharing.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6195106/v1_covered_1ca75a48-e24f-442e-9b26-4f53f06b51c5.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Secure interval keyword search protocol based on interval function secret sharing","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":"","lastPublishedDoi":"10.21203/rs.3.rs-6195106/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6195106/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Secure keyword retrieval means that a querying user submits a query to a database server containing multiple keywords without disclosing the query information to anyone and completes the query. Here, secure interval keyword retrieval refers to querying the occurrence frequency of keywords within an interval (a,b). Regarding the privacy and security issues in secure interval keyword retrieval,an additive interval function secret sharing (IFSS) scheme based on modular operation is initially proposed. The correctness, security, and efficiency of this scheme is analyzed, and it is the first IFSS scheme. Subsequently, using this IFSS scheme as a tool, a secure interval keyword retrieval protocol based on IFSS is constructed. In this protocol, it is assumed that p servers possess a database D consisting of m keywords wi. The querying user forms his query interval (a,b) into an interval function f(a,b)1, generates p sub-key kj for this interval function using IFSS technology, and sends them to the p servers. Then, the client performs modular addition operations based on the responses yj returned by the p servers to obtain the occurrence frequency of the keywords within the interval (a,b) in the database D. The protocol is analyzed, and it is verified that this protocol is correct, secure, and relatively efficient, and it is the first multi-server secure interval keyword retrieval protocol.","manuscriptTitle":"Secure interval keyword search protocol based on interval function secret sharing","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-04-03 04:49:28","doi":"10.21203/rs.3.rs-6195106/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":"ed3daad9-a660-4812-83c1-f9a2e0b0e07e","owner":[],"postedDate":"April 3rd, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":46578563,"name":"Physical sciences/Engineering"},{"id":46578564,"name":"Physical sciences/Mathematics and computing"}],"tags":[],"updatedAt":"2025-07-07T07:24:07+00:00","versionOfRecord":[],"versionCreatedAt":"2025-04-03 04:49:28","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6195106","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6195106","identity":"rs-6195106","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}