Access Control for Information-Theoretically Secure Key-Document Stores

• URL: http://arxiv.org/abs/2507.10730v1
• Date: Mon, 14 Jul 2025 18:51:20 GMT
• Title: Access Control for Information-Theoretically Secure Key-Document Stores
• Authors: Yin Li, Sharad Mehrota, Shantanu Sharma, Komal Kumari,
• Abstract summary: 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.
• Score: 8.696766687524237
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper presents a novel key-based access control technique for secure outsourcing key-value stores where values correspond to documents that are indexed and accessed using keys. The proposed approach adopts Shamir's secret-sharing that offers unconditional or information-theoretic security. It supports keyword-based document retrieval while preventing leakage of the data, access rights of users, or the size (\textit{i}.\textit{e}., volume of the output that satisfies a query). The proposed approach allows servers to detect (and abort) malicious clients from gaining unauthorized access to data, and prevents malicious servers from altering data undetected while ensuring efficient access -- it takes 231.5ms over 5,000 keywords across 500,000 files.

Related papers

• Encrypted Federated Search Using Homomorphic Encryption [0.0]
  This paper introduces a privacy-preserving federated search system that allows law enforcement agencies to conduct queries on encrypted criminal databases.<n>The key innovation here is the ability to execute encrypted queries across distributed databases, without the decryption of the data.
  arXiv  Detail & Related papers  (2025-05-05T07:03:30Z)
• 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)
• TEE-based Key-Value Stores: a Survey [1.1060425537315088]
  Key-Value Stores (KVSs) store data as key-value pairs and have gained popularity due to their simplicity, scalability, and fast retrieval capabilities.<n> storing sensitive data in KVSs requires strong security properties to prevent data leakage and unauthorized tampering.<n>This paper examines the state of the art in TEE-based confidential KVSs and highlights common design strategies used in KVSs to leverage TEE security features.
  arXiv  Detail & Related papers  (2025-01-06T16:26:44Z)
• DREW : Towards Robust Data Provenance by Leveraging Error-Controlled Watermarking [58.37644304554906]
  We propose Data Retrieval with Error-corrected codes and Watermarking (DREW) DREW randomly clusters the reference dataset and injects unique error-controlled watermark keys into each cluster. After locating the relevant cluster, embedding vector similarity retrieval is performed within the cluster to find the most accurate matches.
  arXiv  Detail & Related papers  (2024-06-05T01:19:44Z)
• Enc2DB: A Hybrid and Adaptive Encrypted Query Processing Framework [47.11111145443189]
  We introduce Enc2DB, a novel secure database system following a hybrid strategy on and openGauss. We present a micro-benchmarking test and self-adaptive mode switch strategy that can choose the best execution path (cryptography or TEE) to answer a given query. We also design and implement a ciphertext index compatible with native cost model and querys to accelerate query processing.
  arXiv  Detail & Related papers  (2024-04-10T08:11:12Z)
• dabih -- encrypted data storage and sharing platform [0.0]
  dabih is an open-source web application designed to facilitate user-friendly encrypted data management. Its approach to data security involves a two-stage envelope encryption process. The private key necessary for decrypting the data remains exclusively on the owner's device.
  arXiv  Detail & Related papers  (2024-01-16T12:57:35Z)
• Hiding Access-pattern is Not Enough! Veil: A Storage and Communication Efficient Volume-Hiding Algorithm [7.810877430779854]
  Volume leakage can reveal ciphertexts and current user queries. We develop a solution to prevent volume leakage, entitled Veil, that partitions the dataset by randomly mapping keys to a set of equi-sized buckets.
  arXiv  Detail & Related papers  (2023-10-19T05:51:11Z)
• LDKP: A Dataset for Identifying Keyphrases from Long Scientific Documents [48.84086818702328]
  Identifying keyphrases (KPs) from text documents is a fundamental task in natural language processing and information retrieval. Vast majority of the benchmark datasets for this task are from the scientific domain containing only the document title and abstract information. This presents three challenges for real-world applications: human-written summaries are unavailable for most documents, the documents are almost always long, and a high percentage of KPs are directly found beyond the limited context of title and abstract.
  arXiv  Detail & Related papers  (2022-03-29T08:44:57Z)
• PolicyQA: A Reading Comprehension Dataset for Privacy Policies [77.79102359580702]
  We present PolicyQA, a dataset that contains 25,017 reading comprehension style examples curated from an existing corpus of 115 website privacy policies. We evaluate two existing neural QA models and perform rigorous analysis to reveal the advantages and challenges offered by PolicyQA.
  arXiv  Detail & Related papers  (2020-10-06T09:04:58Z)
• TypeNet: Scaling up Keystroke Biometrics [79.19779718346128]
  We first analyze to what extent our method based on a Recurrent Neural Network (RNN) is able to authenticate users when the amount of data per user is scarce. With 1K users for testing the network, a population size comparable to previous works, TypeNet obtains an equal error rate of 4.8%. Using the same amount of data per user, as the number of test users is scaled up to 100K, the performance in comparison to 1K decays relatively by less than 5%.
  arXiv  Detail & Related papers  (2020-04-07T18:05:33Z)
• DC-BERT: Decoupling Question and Document for Efficient Contextual Encoding [90.85913515409275]
  Recent studies on open-domain question answering have achieved prominent performance improvement using pre-trained language models such as BERT. We propose DC-BERT, a contextual encoding framework that has dual BERT models: an online BERT which encodes the question only once, and an offline BERT which pre-encodes all the documents and caches their encodings. On SQuAD Open and Natural Questions Open datasets, DC-BERT achieves 10x speedup on document retrieval, while retaining most (about 98%) of the QA performance.
  arXiv  Detail & Related papers  (2020-02-28T08:18:37Z)
• A Quantum-based Database Query Scheme for Privacy Preservation in Cloud Environment [7.331387596311974]
  Privacy-preserving database query allows the user to retrieve a data item from the cloud database without revealing the information of the queried data item. All the data items of the database are encrypted by different keys for protecting server's privacy. Two oracle operations, a modified Grover iteration, and a special offset encryption mechanism are combined together to ensure that the client can correctly query the desirable data item.
  arXiv  Detail & Related papers  (2020-02-01T11:14:38Z)

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.