Hierarchical Identity-Based Signature with Designated Aggregator from Lattices

• URL: http://arxiv.org/abs/2606.14090v1
• Date: Fri, 12 Jun 2026 04:06:17 GMT
• Title: Hierarchical Identity-Based Signature with Designated Aggregator from Lattices
• Abstract summary: We introduce the HIBS-DA framework and present the emfirst lattice-based construction of HIBS-DA.<n>Our scheme allows users at different hierarchical levels to generate individual signatures that can be aggregated into a single, compact signature.<n>The proposed construction is secure, correct, and resistant to forgery, making it suitable for large-scale environments such as universities, corporations, and government agencies.
• Score: 0.612477318852572
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In hierarchical organizations, authenticating data from multiple users can be complex and resource-intensive. Hierarchical Identity-Based Signature with Designated Aggregator (HIBS-DA) provides an efficient solution by allowing users at different levels to generate signatures that can be combined into a single, compact signature. We first introduce the HIBS-DA framework and present the {\em{first}} lattice-based construction of HIBS-DA. Our scheme allows users at different hierarchical levels to generate individual signatures that can be aggregated into a single, compact signature, reducing communication and verification costs. The proposed construction is secure, correct, and resistant to forgery, making it suitable for large-scale environments such as universities, corporations, and government agencies.

Related papers

• The Native-Signature Boundary in Post-Quantum Distributed Authorization [0.0]
  Post-quantum signature migration poses a distinct systems problem when authorization is distributed among multiple parties.<n>This paper organizes that design boundary through three properties: native-signature compatibility, unilateral-signing resistance, and threshold-layer agility.
  arXiv  Detail & Related papers  (2026-09-03T08:47:05Z)
• Collaborative Memory Augmentation for Generative Recommendation [49.76630658239287]
  We propose textbfOMEGA, a cOllaborative MEmory augmentation framework for Generative recommendAtion.<n>We first introduce a latent context compression method that utilizes learnable query tokens to distill sequential user behavior into compact representations.<n>These compressed representations are aggregated into a collaborative memory bank, serving as an explicit repository of global behavioral patterns.
  arXiv  Detail & Related papers  (2026-08-02T15:34:43Z)
• Interoperable Architecture for Digital Identity Delegation for AI Agents with Blockchain Integration [0.0]
  We introduce a unified framework that enables bounded, auditable, and least-privilege delegation across heterogeneous identity ecosystems.<n>The framework includes four key elements: Delegation Grants (DGs), first-class authorization artefacts that encode revocable transfers of authority with enforced scope reduction.<n>It also includes a layered reference architecture that separates trust anchoring, credential and proof validation, policy evaluation, and protocol mediation via a Trust Gateway.
  arXiv  Detail & Related papers  (2026-01-21T13:29:23Z)
• The Best of the Two Worlds: Harmonizing Semantic and Hash IDs for Sequential Recommendation [51.62815306481903]
  We propose textbfname, a novel framework that harmonizes the SID and HID. Specifically, we devise a dual-branch modeling architecture that enables the model to capture both the multi-granular semantics within SID while preserving the unique collaborative identity of HID.<n>Experiments on three real-world datasets show that name balances recommendation quality for both head and tail items while surpassing the existing baselines.
  arXiv  Detail & Related papers  (2025-12-11T07:50:53Z)
• Assemble Your Crew: Automatic Multi-agent Communication Topology Design via Autoregressive Graph Generation [91.17994756436259]
  Multi-agent systems (MAS) based on large language models (LLMs) have emerged as a powerful solution for dealing with complex problems across diverse domains.<n>Existing approaches are fundamentally constrained by their reliance on a template graph modification paradigm with a predefined set of agents and hard-coded interaction structures.<n>We propose ARG-Designer, a novel autoregressive model that operationalizes this paradigm by constructing the collaboration graph from scratch.
  arXiv  Detail & Related papers  (2025-07-24T09:17:41Z)
• One For All: Formally Verifying Protocols which use Aggregate Signatures (extended version) [6.604074204101799]
  BLS aggregate signatures are a popular kind of aggregate signature, deployed by Dfinity, and Cloudflare amongst others.<n> BLS aggregate signatures are difficult to use correctly, with nuanced requirements that must be carefully handled by protocol developers.<n>We design the first models of aggregate signatures that enable formal verification tools, such as Tamarin and ProVerif, to be applied to protocols using these signatures.
  arXiv  Detail & Related papers  (2025-05-15T14:01:30Z)
• A Dynamic Tree Structure for Hierarchical On-Chain Asset Management [1.6114012813668932]
  Sarv is a novel non-monolithic blockchain-based data structure designed to represent hierarchical relationships between digitally representable components.<n>Our approach leverages a tree-based data structure to accurately reflect products and their sub-components, enabling functionalities such as modification, disassembly, borrowing, and refurbishment.<n>The uniqueness of Sarv lies in its compact and non-monolithic architecture, its mutability, and a two-layer action authorization scheme.
  arXiv  Detail & Related papers  (2024-12-08T18:58:28Z)
• Block Induced Signature Generative Adversarial Network (BISGAN): Signature Spoofing Using GANs and Their Evaluation [1.0177118388531325]
  Generative adversarial networks (GANs) learn from original and forged signatures to generate forged signatures. This work focuses on creating a generator that produces forged samples that achieve a benchmark in spoofing signature verification systems.
  arXiv  Detail & Related papers  (2024-10-08T13:40:33Z)
• Investigating the Common Authorship of Signatures by Off-Line Automatic Signature Verification Without the Use of Reference Signatures [3.3498759480099856]
  This paper addresses the problem of automatic signature verification when no reference signatures are available. The scenario we explore consists of a set of signatures, which could be signed by the same author or by multiple signers. We discuss three methods which estimate automatically the common authorship of a set of off-line signatures.
  arXiv  Detail & Related papers  (2024-05-23T10:30:48Z)
• Revocable Quantum Digital Signatures [57.25067425963082]
  We define and construct digital signatures with revocable signing keys from the LWE assumption. In this primitive, the signing key is a quantum state which enables a user to sign many messages. Once the key is successfully revoked, we require that the initial recipient of the key loses the ability to sign.
  arXiv  Detail & Related papers  (2023-12-21T04:10:07Z)
• FedSOV: Federated Model Secure Ownership Verification with Unforgeable Signature [60.99054146321459]
  Federated learning allows multiple parties to collaborate in learning a global model without revealing private data. We propose a cryptographic signature-based federated learning model ownership verification scheme named FedSOV.
  arXiv  Detail & Related papers  (2023-05-10T12:10:02Z)
• Secure access system using signature verification over tablet PC [62.21072852729544]
  We describe a highly versatile and scalable prototype for Web-based secure access using signature verification. The proposed architecture can be easily extended to work with different kinds of sensors and large-scale databases.
  arXiv  Detail & Related papers  (2023-01-11T11:05:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.