A novel VMKSE scheme (VMKSE-BFF) is presented by adopting BFF, which can simultaneously support verifiability of and secure data sharing in a multi-user setting and a comparison with the existing VMKSE schemes is provided.
Abstract
Multi-Key Searchable Encryption (MKSE) enables data owners (DOs) to outsource their data to a cloud server (CS) while supporting fine-grained data sharing with other authorized users. Most existing MKSE schemes can protect data users’ (DUs’) search query privacy against collusion attacks between malicious DOs and the CS. However, the CS is not fully trusted and may maliciously return forged or incomplete search results. To address this issue, Verifiable MKSE (VMKSE) is proposed by leveraging Garbled Bloom Filter (GBF), which can support verifiability even when the search results are empty. Unfortunately, due to the massive native storage redundancy of GBF, the storage and computational overhead of verification evidence generated in the sharing phase increases as the number of shared documents grows. Therefore, in this paper, we present a novel VMKSE scheme (VMKSE-BFF) by adopting BFF, which can simultaneously support verifiability of and secure data sharing in a multi-user setting. We provide a comparison with the existing VMKSE schemes. Experimental results on a real-world dataset show a significant performance improvement of VMKSE-BFF.
A viable, privacy-friendly auditing framework of clouds which guarantees the end-toend encrypted verification without sacrificing the efficiency is presented.
Deepshikha Chaturvedi, Vidyullata Devmane, Shashikant S. Radke et al.· International Journal of Com...· 0 citations
With the popularity of cloud storage, data encryption protects user privacy but also hinders efficient data retrieval. Existing searchable encryption schemes generally suffer from low query efficiency, unverifiable results, and high leakage risks in dynamic updates. This paper proposes an efficient and verifiable multi-keyword searchable encryption scheme based on blockchain. The scheme uses Bloom filter and multiset hash to achieve result integrity verification, realizes forward security through chained index and pseudo-random function (PRF), and supports multi-keyword conjunctive query. Experimental results show that the query latency of the proposed scheme is only 2.38∼24.12 ms and the client verification latency is only 13.85∼154.63 ms in single-keyword query mode. For multikeyword queries, only one primary search address set is required regardless of the number of query keywords. The scheme performs well in query latency, verification overhead and security.
Zhi-Wu Zhou· 2026 3rd World Conference on...· 0 citations
This paper presents a secure data sharing platform that organises KR-IBI, KR-IBE, KR-PEKS, and KR-PAEKS into an end-to-end Rust/Tauri workflow for registration, authentication, encrypted upload, searchable retrieval, and authorised decryption. The work addresses a deployment-level composition problem rather than proposing a new primitive: practical data sharing requires coordinated credential handling, payload representation, searchable indexing, session control, and record integrity across schemes with distinct interfaces. The platform supports text, file, and image payloads through a hybrid KR-IBE/HKDF-SHA-256/AES-256-GCM layer. Fresh KR-IBE key material is generated by uniformly sampling a nonzero scalar and multiplying the Ed25519 prime-order subgroup generator, providing approximately 252 bits of min-entropy before HKDF derivation. An evaluation with 100 repetitions per configuration over Enron-derived workloads containing 100–10,000 records and 1, 5, 10, or 20 authorised identities achieved 100/100 correctness for authorised retrieval and decryption, wrong-keyword and wrong-scheme rejection, and unauthorised-access rejection. KR-PEKS search latency ranged from 29.26 ms at 100 records to 3023.82 ms at 10,000 records, whereas KR-PAEKS ranged from 775.53 ms to 93,045.52 ms. These results quantify the performance distinction between the lower-latency KR-PEKS mode and the sender-authenticated searchable encryption provided by KR-PAEKS.
Public cloud file sharing enhances accessibility and scalability but still suffer from the same issues as bearer tokens and centralized key services: credential theft, credential replay, single point compromise, and continued key availability after credential expiration. To tackle these deficiencies, this study presents a file-sharing prototype system which is a combination of AES-256-GCM encryption, ES256 recipient-bound JSON Web Tokens, proof-of-possession signatures, nonce based replay prevention, atomic single use enforcement, and 3-of-5 Shamir threshold key sharing. A set of trials was employed to evaluate the cryptographic processing, token attacks, threshold recovery, guardian failures, expiration behaviour, and concurrent access, along with synthetic access logs for anomaly detection. The legitimate access succeeded in all trials, while most of the other types of attacks (expired, modified, replayed, stolen-token attacks) reached 0% success rate. Key reconstruction failed with less than 3 guardian failures, was still possible with a maximum of 2 guardian failures and was not possible after deletion of guardian shares. The threshold design had a small amount of extra latency across centralized baseline designs and was able to serve 100 concurrent requests with 100% success. The study concludes that with a combination of recipient bound temporal authorization with distributed key custody, auditable cryptographic expiration becomes possible. The most significant contribution it makes is the union of different features in an integrated and experimented verified workflow, which consists of secure access, replay resistance, threshold recovery, and verifiable post-expiry key unavailability.
M. Mrunalini, Chethan Venkatesh, K. Suneetha et al.· Journal of Intelligent Decis...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
