Secure and Efficient Fully Dynamic Lattice-based Group Signature Scheme

Secure and Efficient Fully Dynamic Lattice-based Group Signature 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 Research Article Secure and Efficient Fully Dynamic Lattice-based Group Signature Scheme Vishal Pareek, Chinmoy Biswas, Aditi Kar Gangopadhyay, Sugata Gangopadhyay This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6556636/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 9 You are reading this latest preprint version Abstract Group signature is an interesting primitive of cryptography, enabling each group member to sign messages on behalf of the entire group anonymously. In the literature, most lattice-based group signatures are designed for static settings, hindering their practical efficiency and effectiveness. A practically feasible group signature scheme should prioritize user-friendliness and provide flexibility in the processes of user enrollment and revocation, maintaining an appropriate signature size. Keeping these considerations in mind, we have developed a variant of a lattice-based fully dynamic group signature scheme. Our scheme does not rely on a trapdoor function, which reduces its operational complexity. In our scheme, we have employed an updatable Merkle tree accumulator based on shortest integer solution (SIS) hardness to ensure the security of a user’s identity and to enable timely updates to user information as required. For explicit standard parameter size, we have presented our signature size under different security levels and compared our results with the existing similar schemes. Lattice-Based Cryptography Fully Dynamic Group Signature Merkle Tree Learning With Errors Short Integer Solutions Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 27 Sep, 2025 Reviews received at journal 23 Jul, 2025 Reviewers agreed at journal 09 Jul, 2025 Reviews received at journal 19 Jun, 2025 Reviewers agreed at journal 09 Jun, 2025 Reviewers invited by journal 05 Jun, 2025 Editor assigned by journal 05 May, 2025 Submission checks completed at journal 05 May, 2025 First submitted to journal 29 Apr, 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-6556636","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":467955104,"identity":"13853540-9221-4102-ad02-d5cdc62afe7b","order_by":0,"name":"Vishal Pareek","email":"","orcid":"","institution":"IITR","correspondingAuthor":false,"prefix":"","firstName":"Vishal","middleName":"","lastName":"Pareek","suffix":""},{"id":467955106,"identity":"324b1f39-81c2-41c2-b4fd-46a6b3e5371f","order_by":1,"name":"Chinmoy Biswas","email":"","orcid":"","institution":"University of Calgary","correspondingAuthor":false,"prefix":"","firstName":"Chinmoy","middleName":"","lastName":"Biswas","suffix":""},{"id":467955107,"identity":"e339d7ec-cedf-4ecb-a059-6e4b9f157b01","order_by":2,"name":"Aditi Kar Gangopadhyay","email":"","orcid":"","institution":"IITR","correspondingAuthor":false,"prefix":"","firstName":"Aditi","middleName":"Kar","lastName":"Gangopadhyay","suffix":""},{"id":467955114,"identity":"00a2549a-0bb7-4347-9aa6-7a9efc484452","order_by":3,"name":"Sugata Gangopadhyay","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABUElEQVRIie2PMWvCQBiGvxCIHWLnK0rTn3BFSFsU81cMAbMcRcjikEEoxKXaNdI/0f6DK0K6pIjblTooQicHoSAZrPTurEPUpWPhnuHjvS/3cG8AFIp/gN7gQ5vyYRq/K/PYPbqn6Fgqxh8UA8lsHN4UWLE//lqGUH947I7nrbB6i19Tu52toXxq9aaQhVC+yiuYkQDRBLx4kgaVOPEDnBL7vReJYgWs3Sdg3nTyCiINRA3wgJFmyTSG7hMl9ofWEQpvVuQB05xixcTL6AY8SyobrowWdgDrraJ9HyrA/AS9RFDHPJSKEVcYsXX+61LRj7yC04Vx/dZHjUtG9Mqg77sD9hmc9SLElSYMywk6KNb156y9qjnnzJ/NW6uq2x95z8tsXXOsu0SbLcKas1+Mv8sHckUBXZwv6IncyI90F3IUpmI6IkjF6mw3CoVCodjxA5eJdHLn7ZU/AAAAAElFTkSuQmCC","orcid":"","institution":"IITR","correspondingAuthor":true,"prefix":"","firstName":"Sugata","middleName":"","lastName":"Gangopadhyay","suffix":""}],"badges":[],"createdAt":"2025-04-29 12:53:20","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6556636/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6556636/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":84175810,"identity":"aa16d5aa-c804-4b2f-aab4-b7bfa3196291","added_by":"auto","created_at":"2025-06-09 02:16:57","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1683482,"visible":true,"origin":"","legend":"","description":"","filename":"ClusterComputingPaper11.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6556636/v1_covered_135e9eed-6752-4bcf-9f84-b9072df3b66e.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Secure and Efficient Fully Dynamic Lattice-based Group Signature Scheme","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":"cluster-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [Cluster Computing](https://www.springer.com/journal/10586)","snPcode":"10586","submissionUrl":"https://submission.nature.com/new-submission/10586/3","title":"Cluster Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Lattice-Based Cryptography, Fully Dynamic Group Signature, Merkle Tree, Learning With Errors, Short Integer Solutions","lastPublishedDoi":"10.21203/rs.3.rs-6556636/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6556636/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Group signature is an interesting primitive of cryptography, enabling each group member to sign messages on behalf of the entire group anonymously. In the literature, most lattice-based group signatures are designed for static settings, hindering their practical efficiency and effectiveness. A practically feasible group signature scheme should prioritize user-friendliness and provide flexibility in the processes of user enrollment and revocation, maintaining an appropriate signature size. Keeping these considerations in mind, we have developed a variant of a lattice-based fully dynamic group signature scheme. Our scheme does not rely on a trapdoor function, which reduces its operational complexity. In our scheme, we have employed an updatable Merkle tree accumulator based on shortest integer solution (SIS) hardness to ensure the security of a user’s identity and to enable timely updates to user information as required. For explicit standard parameter size, we have presented our signature size under different security levels and compared our results with the existing similar schemes.","manuscriptTitle":"Secure and Efficient Fully Dynamic Lattice-based Group Signature Scheme","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-06-09 02:08:48","doi":"10.21203/rs.3.rs-6556636/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-09-27T14:03:32+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-07-23T05:47:07+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"77224449500049916842265266840337902115","date":"2025-07-09T04:20:05+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-06-19T07:04:43+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"143961245613316397706153235796620016018","date":"2025-06-09T05:45:26+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-06-05T12:44:34+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-05-05T08:26:18+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-05-05T06:38:28+00:00","index":"","fulltext":""},{"type":"submitted","content":"Cluster Computing","date":"2025-04-29T12:46:11+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"cluster-computing","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"","sideBox":"Learn more about [Cluster Computing](https://www.springer.com/journal/10586)","snPcode":"10586","submissionUrl":"https://submission.nature.com/new-submission/10586/3","title":"Cluster Computing","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"f98ff029-b4bd-4df1-bd30-e831b50eb256","owner":[],"postedDate":"June 9th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-05-01T11:54:53+00:00","versionOfRecord":[],"versionCreatedAt":"2025-06-09 02:08:48","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6556636","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6556636","identity":"rs-6556636","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}