Aug 2026· Journal of Cybersecurity and Privacy· 0 citations· 29 references
TL;DR
These results quantify the performance distinction between the lower-latency KR-PEKS mode and the sender-authenticated searchable encryption provided by KR-PAEKS.
Abstract
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.
This paper presents Project Anonymous, an open-source platform for real-time voice, video, and text communication, deployable on both web browsers and Android, built entirely on the NIST-standardized ML-KEM-1024 (FIPS 203) and ML-DSA-87 (FIPS 204) primitives. Inorder to secure from Shor’s algorithm offering a reduced p...
Muhammad Sulthan K. M, Haseena M. K.· International Conference Inn...· 0 citations
This work presents an identity-based directly revocable proxy re-encryption scheme (IBPRE-DR) based on the Learning With Errors (LWE) assumption, which is the first lattice-based identity-based proxy re-encryption scheme that integrates direct user revocation under the standard LWE assumption.
The integration of a Modified SHA-256 algorithm into distributed ledger-based medical record systems enhances cryptographic security, data integrity, and computational efficiency. The proposed model optimizes padding, message scheduling, and compression functions. A public repository containing 50,000 de-identified Ele...
R. Palaniyappan, D. Sasikala· International journal of com...· 0 citations
This study presents a user-centric Web 3.0 authentication framework combining Elliptic Curve Cryptography with an ephemeral Elliptic Curve ElGamal character-encoding scheme, building on an ephemeral-encoding design for constrained IoT devices and its subsequent hash/XOR authentication extension.
Adarsh S. V. Nair, R. Achary· International Journal of Adv...· 0 citations
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.
Yandong Su, Bing-Hang Wang, Yan-Jie Xiang et al.· Mathematics· 0 citations
This paper proposes a high-security Hadoop storage architecture that uses Raft consensus to deal with decentralized metadata and Merkle trees to verify integrity and demonstrates the model's ability to provide scalable, enterprise-level, and quantum-resilient cloud storage for high-stakes industries such as finance and...
Mohammed Yousif, Wael Hadeed, Nagham Sultan· International Journal on Adv...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.