Database
Retained Encrypted Search with Certified Split Joins
arXiv cs.CR0 views
arXiv:2611.24265v1 Announce Type: new Abstract: Retaining encrypted search across data edits and worker replacement requires separating computational validity from current release authority. We give exact Hamming search with at most one authorized decryption and decoding attempt per query preparation. Under authenticated prescribed execution, exclusive nonrollback owner state, an ideal public seed-expansion interface and a stated observation model, we reduce bounded adaptive privacy to ordinary ring learning with errors (Ring-LWE). Expanded second components depend only on public masks and fixed maps, independently of queries and the fresh database key. This compiler invariant permits a retained split join against a smaller-modulus encrypted database. A simultaneous bound on the completed circuit covers a finite honest reservation family, including adaptive queries and slot selection, with explicit statistical correctness and privacy losses. In three post-calibration local CPU comparisons on 32,768 vectors of 512 bits, the 60-bit-join construction takes a median 9.825 s for an end-to-end two-query workload, versus 12.159 s for the optimized full-source-modulus baseline. These times include setup, transfers, preparation and private completion. They are local implementation results, not deployment or concrete-security claims.
Source:https://arxiv.org/abs/2611.24265PreviousPMKPIR: Parallel Multi-Keyword PIR with Interleaved Batching for Private Boolean RetrievalNextWhen Shuffling Fails: Token Recovery from Obfuscated KV Caches
Related posts
Azure Free Account in 2026: $200 Credit, 12-Month and Always-Free Services
0dev.to Tutorial
Upgrade Laravel to PHP 8.6: Step-by-Step Guide (2026)
0dev.to PHP
Benchmarking TypeScript KV & Cache Engines in 2026: KVDock vs. Unstorage vs. Keyv
0dev.to Node
Contract Review Retrieval Explained: Node.js Fallbacks for Cited Change Alerts
0dev.to Node

SQL Running Total: Calculate Cumulative Daily Sales Using SUM() OVER() in Oracle SQL
0dev.to Database
Logical Design Tuning via Workload-aware E/R-to-Relational Mapping
0arXiv cs.DB