A Hierarchical Key Assignment Scheme

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract This work introduces a novel access control scheme employing a hierarchical key assignment mechanism based on inner product spaces. The scheme is computationally lightweight and designed for digital environments with hierarchical access control policies. By leveraging orthogonal projection and distributing a basis to each group, it supports flexible and efficient left-to-right and top-down policies, accommodating dynamic updates in the hierarchy. The scheme allows parent groups to derive the secret keys of their child groups while preventing the reverse. It ensures resistance to collusion attacks and privilege creep, offering key recovery and indistinguishability properties. With low storage overhead and an efficient key derivation process, the scheme provides a practical solution for secure hierarchical access control.
Full text 9,720 characters · extracted from preprint-html · click to expand
A Hierarchical Key Assignment Scheme | 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 A Hierarchical Key Assignment Scheme Baris Celiktas, Ibrahim Celikbilek, Sueda Guzey, Enver Ozdemir This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-5780348/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 This work introduces a novel access control scheme employing a hierarchical key assignment mechanism based on inner product spaces. The scheme is computationally lightweight and designed for digital environments with hierarchical access control policies. By leveraging orthogonal projection and distributing a basis to each group, it supports flexible and efficient left-to-right and top-down policies, accommodating dynamic updates in the hierarchy. The scheme allows parent groups to derive the secret keys of their child groups while preventing the reverse. It ensures resistance to collusion attacks and privilege creep, offering key recovery and indistinguishability properties. With low storage overhead and an efficient key derivation process, the scheme provides a practical solution for secure hierarchical access control. Physical sciences/Mathematics and computing/Information technology Physical sciences/Mathematics and computing/Computer science Physical sciences/Mathematics and computing/Computational science 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-5780348","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":400532587,"identity":"ede9cd3a-dfc3-4178-8291-84e55bb45896","order_by":0,"name":"Baris Celiktas","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABF0lEQVRIie2Rv0rEQBCHRwYmzWoeIMa8wh4p5PCIr2II7LWW15lwsDb+aSO+xD3CHgux0muFaxThKguvSxHQ3VxjsVFLi/1g2WHYD34zC+Dx/EO4OcoWB0j2mjDYFbBX/qYQkn0kvis4qPQQ9Iruyx+V4+DxddlCdkQBTV/abnWYXJKIzmESL1TYfDiU8dWUawZFaoItq2u5ZlxTE9Ug0oVCrF3BlLBhVC4xqMr90igYyIiBzq3inGW1ARNMXVil6ronlsx75XNYeRagGKgzG2zOyNQ2mOkMKuN6A5rxYiSR8vtYFnaW4sR00juNqXNjocBtO8uSMGz49r3LTpPbZrRmsyy+eajenFvexXN23N/i8Xg8nj/wBdqqWCZQoP/7AAAAAElFTkSuQmCC","orcid":"","institution":"Işık University","correspondingAuthor":true,"prefix":"","firstName":"Baris","middleName":"","lastName":"Celiktas","suffix":""},{"id":400532588,"identity":"7e8656ec-221c-417d-acce-92369cf66bc7","order_by":1,"name":"Ibrahim Celikbilek","email":"","orcid":"","institution":"Istanbul Technical University","correspondingAuthor":false,"prefix":"","firstName":"Ibrahim","middleName":"","lastName":"Celikbilek","suffix":""},{"id":400532590,"identity":"338d3a6e-aebb-4a79-bb23-6fdd9b62f356","order_by":2,"name":"Sueda Guzey","email":"","orcid":"","institution":"Istanbul Technical University","correspondingAuthor":false,"prefix":"","firstName":"Sueda","middleName":"","lastName":"Guzey","suffix":""},{"id":400532589,"identity":"61386d73-f8df-4084-a07e-cc3cbfaf5a3f","order_by":3,"name":"Enver Ozdemir","email":"","orcid":"","institution":"Istanbul Technical University","correspondingAuthor":false,"prefix":"","firstName":"Enver","middleName":"","lastName":"Ozdemir","suffix":""}],"badges":[],"createdAt":"2025-01-07 10:23:29","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-5780348/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-5780348/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":85478686,"identity":"fa8d67a3-e26e-42d3-a19e-28a10958ebcc","added_by":"auto","created_at":"2025-06-26 10:32:11","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":542883,"visible":true,"origin":"","legend":"","description":"","filename":"HierarchicalKeyAssignmentSchemeScientificReports.pdf","url":"https://assets-eu.researchsquare.com/files/rs-5780348/v1_covered_7977cd94-d65b-4ee9-a8f3-a1609597219b.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"A Hierarchical Key Assignment Scheme","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-5780348/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-5780348/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"This work introduces a novel access control scheme employing a hierarchical key assignment mechanism based on inner product spaces. The scheme is computationally lightweight and designed for digital environments with hierarchical access control policies. By leveraging orthogonal projection and distributing a basis to each group, it supports flexible and efficient left-to-right and top-down policies, accommodating dynamic updates in the hierarchy. The scheme allows parent groups to derive the secret keys of their child groups while preventing the reverse. It ensures resistance to collusion attacks and privilege creep, offering key recovery and indistinguishability properties. With low storage overhead and an efficient key derivation process, the scheme provides a practical solution for secure hierarchical access control.","manuscriptTitle":"A Hierarchical Key Assignment Scheme","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-01-13 15:58:32","doi":"10.21203/rs.3.rs-5780348/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":"5c7d1626-d154-43bc-a3c0-9aa4b1ab6922","owner":[],"postedDate":"January 13th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":42690968,"name":"Physical sciences/Mathematics and computing/Information technology"},{"id":42690969,"name":"Physical sciences/Mathematics and computing/Computer science"},{"id":42690970,"name":"Physical sciences/Mathematics and computing/Computational science"}],"tags":[],"updatedAt":"2025-06-26T10:24:04+00:00","versionOfRecord":[],"versionCreatedAt":"2025-01-13 15:58:32","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-5780348","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-5780348","identity":"rs-5780348","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","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. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00