Enabling Multi-Client Authorization in Dynamic SSE

• URL: http://arxiv.org/abs/2603.09550v1
• Date: Tue, 10 Mar 2026 11:59:00 GMT
• Title: Enabling Multi-Client Authorization in Dynamic SSE
• Abstract summary: MASSE is a dynamic multi-client SSE scheme incorporating attribute-based access control, which expands the OXT framework.<n> MASSE supports practical dynamic updates to documents, and client authorizations, including revocation, without requiring reencryption of the database or indices.<n>It takes less than two seconds to generate 10 to 100 keyword queries and 14 seconds to retrieve 50 matching documents.
• Score: 1.2234742322758416
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Outsourcing encrypted data to the cloud creates a fundamental tension between data privacy and functional searchability. Current Searchable Symmetric Encryption (SSE) solutions frequently have significant limitations, such as excessive metadata leakage, or a lack of fine-grained access control. These issues restrict the scalability of secure searches in real-world applications where multiple clients require different levels of authorization. Our paper proposes MASSE, a dynamic multi-client SSE scheme incorporating attribute-based access control, which expands the OXT framework. With MASSE, clients are restricted sto searching for keywords authorized by their specific attribute sets, and the server remains unaware of the keywords and attributes. MASSE supports practical dynamic updates to documents, and client authorizations, including revocation, without requiring reencryption of the database or indices, or a large number of interactions. We formally prove the security of MASSE, that is, forward and backward privacy under a well-defined leakage profile, and token unforgeability. An experimental evaluation in a database containing 100 keywords, each associated with 150 documents, demonstrates the practical efficiency of MASSE. It takes less than two seconds to generate 10 to 100 keyword queries and 14 seconds to retrieve 50 matching documents. Theoretical results show that MASSE outperforms competing solutions, including OXT, and can be scaled to large encrypted databases. MASSE is also suitable for dynamic cloud deployments. Keywords: Searchable Encryption, SSE, Multi-Client, Attribute Based SSE, Access Control, Revocation, OXT

Related papers

• KeyPooling: Measuring Where LLM API Relay Paths Collapse Prompt Cache Isolation [53.952294884822955]
  Large language model (LLM) API relays authenticate customers separately but often forward requests through shared provider credentials.<n>We present KeyPooling, a measurement method that traces customer identity through cache lookup and write.<n>We derive a defense contract: every customer must enter a provider-enforced domain.
  arXiv  Detail & Related papers  (2026-08-18T08:12:34Z)
• BRASP: Boolean Range Queries over Encrypted Spatial Data with Access and Search Pattern Privacy [11.343216631656661]
  This paper presents BRASP, a searchable encryption scheme for Boolean range queries over encrypted spatial data.<n>We formalize the security of BRASP through confidentiality, shuffle indistinguishability, query unforgeability, and forward-security analyses.
  arXiv  Detail & Related papers  (2026-04-09T04:50:25Z)
• SafeLoad: Efficient Admission Control Framework for Identifying Memory-Overloading Queries in Cloud Data Warehouses [59.68732483257323]
  Memory overload is a common form of resource exhaustion in cloud data warehouses.<n>We propose SafeLoad, the first query admission control framework specifically designed to identify memory-overloading (MO) queries.<n>We show that SafeLoad achieves state-of-the-art prediction performance with low online and offline time overhead.
  arXiv  Detail & Related papers  (2026-01-05T08:29:51Z)
• Multiparty Authorization for Secure Data Storage in Cloud Environments using Improved Attribute-Based Encryption [0.0]
  Attribute-Based Encryption (ABE) is one of the potential security and access control techniques for secure data storage and authorization.<n>The proposed work divides into two objectives: (i) provide access to authorized users and (ii) secure data storage in a cloud environment.<n>The security and performance analysis results demonstrate that the proposed scheme is more robust and secure.
  arXiv  Detail & Related papers  (2025-12-29T05:41:08Z)
• VisR-Bench: An Empirical Study on Visual Retrieval-Augmented Generation for Multilingual Long Document Understanding [49.07705729597171]
  VisR-Bench is a benchmark for question-driven multimodal retrieval in long documents.<n>Our benchmark comprises over 35K high-quality QA pairs across 1.2K documents.<n>We evaluate various retrieval models, including text-based methods, multimodal encoders, and MLLMs.
  arXiv  Detail & Related papers  (2025-08-10T21:44:43Z)
• Access Control for Information-Theoretically Secure Key-Document Stores [8.696766687524237]
  This paper presents a novel key-based access control technique for secure outsourcing key-value stores.<n>The proposed approach adopts Shamir's secret-sharing that offers unconditional or information-theoretic security.
  arXiv  Detail & Related papers  (2025-07-14T18:51:20Z)
• Efficient and Expressive Public Key Authenticated Encryption with Keyword Search in Multi-user Scenarios [8.765944076844985]
  Public key authenticated encryption with keyword search (PAEKS) represents a significant advancement of secure and searchable data sharing in public network systems, such as medical systems.<n>It can effectively mitigate the risk of keyword guessing attacks (KGA), which is a critical issue in public key encryption with keyword search (PEKS)<n>However, in scenarios with a large number of users, the enforced point-to-point access control necessitates that the data sender encrypt the same keyword using the public keys of multiple receivers to create indexes, while the data receiver also must generate trapdoors of size linear to senders in the system.<n>
  arXiv  Detail & Related papers  (2025-03-21T03:51:43Z)
• HOPE: Homomorphic Order-Preserving Encryption for Outsourced Databases -- A Stateless Approach [0.7770535067924795]
  Homomorphic OPE (HOPE) is a new OPE scheme that eliminates client-side storage and avoids additional client-server interaction during query execution.<n>We provide a formal cryptographic analysis of HOPE, proving its security under the widely accepted IND-OCPA model.
  arXiv  Detail & Related papers  (2024-11-26T00:38:46Z)
• Robust Utility-Preserving Text Anonymization Based on Large Language Models [80.5266278002083]
  Anonymizing text that contains sensitive information is crucial for a wide range of applications.<n>Existing techniques face the emerging challenges of the re-identification ability of large language models.<n>We propose a framework composed of three key components: a privacy evaluator, a utility evaluator, and an optimization component.
  arXiv  Detail & Related papers  (2024-07-16T14:28:56Z)
• Database-Augmented Query Representation for Information Retrieval [71.41745087624528]
  We present a novel retrieval framework called Database-Augmented Query representation (DAQu)<n>DAQu augments the original query with various (query-related) metadata across multiple tables.<n>We validate our DAQu in diverse retrieval scenarios, demonstrating that it significantly enhances overall retrieval performance.
  arXiv  Detail & Related papers  (2024-06-23T05:02:21Z)
• Scalable Private Search with Wally [23.88335656904761]
  Wally is a private search system that supports efficient search queries against large databases.<n>For a database with 3.2 million entries, Wally's queries per second (QPS) is 7-28x higher, and communication is 6.69-31x smaller than Tiptoe.
  arXiv  Detail & Related papers  (2024-06-10T19:41:25Z)
• MaskSearch: Querying Image Masks at Scale [60.82746984506577]
  MaskSearch is a system that focuses on accelerating queries over databases of image masks while guaranteeing the correctness of query results. Experiments with our prototype show that MaskSearch, using indexes approximately 5% of the compressed data size, accelerates individual queries by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2023-05-03T18:28:14Z)

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.