--- title: Oblivious Key Homomorphic Encryption Retrieval url: https://www.emergentmind.com/topics/oblivious-key-homomorphic-encryption-retrieval-okher type: topic --- # Oblivious Key Homomorphic Encryption Retrieval Oblivious Key Homomorphic Encryption Retrieval (OKHER) denotes a class of protocols facilitating privacy-preserving key–value queries on homomorphically encrypted databases. OKHER ensures that a sender can retrieve ciphertexts of values matching queried keys, without leaking additional information about the database or the query pattern beyond what is strictly necessary. The term encompasses instantiations on full, leveled, and linearly homomorphic cryptosystems, spanning applications from structured private set operations to proxy re-encryption for multi-key support. ## 1. Core Definition and Context At its foundation, OKHER is an idealized two-party protocol, denoted $\mathcal{F}_\mathrm{OKHER}$, where a Receiver $\mathcal{R}$ possesses a database $KV = \{(k_i,v_i)\}_{i=1}^N$ encrypted under a public key $pk$, and a Sender $\mathcal{S}$ forms queries $Q = \{q_j\}_{j=1}^m$ against this store. Upon protocol execution, the sender learns (for each $q_j$) only the encryption $\mathsf{Enc}_{pk}(v_i)$ of the value matching $q_j=k_i$, or a dummy ciphertext if no match exists. The receiver learns no additional information [2601.20400]. This abstraction captures efficient retrieval on encrypted data in settings requiring minimal leakage—enabling, for example, Fuzzy Private Set Union protocols where elements are matched approximately rather than exactly [2601.20400], as well as secure access in multi-user or multi-key environments [1706.01756]. ## 2. Cryptographic Frameworks and Implementations OKHER’s realizations build on different homomorphic encryption paradigms: - **Fully Homomorphic Encryption (FHE):** Enables evaluation of arbitrary functions over encrypted records without decryption. Protocols such as BF-COIE and PS-COIE use leveled FHE (BFV in Microsoft SEAL), permitting parallel retrieval of multiple results, with encrypted databases and queries matched and encoded into compressed, sublinear-size objects using only homomorphic additions and scalar multiplications [2109.07708]. - **Linearly Homomorphic Encryption (LHE):** Required for settings where only addition and plaintext–ciphertext multiplication are supported (e.g., Paillier, custom LHE variants). OKHER exploits IND-CPA security and batch PIR to realize functionality with efficient encodings and low communication overhead [2601.20400]. - **Homomorphic Proxy Re-Encryption (HPRE):** Extends retrievability to scenarios involving key switching without trusted third parties. The cloud, acting as proxy, never learns plaintexts or private keys and simply enables the transfer of encrypted content from one user’s key to another via a noise-blinding approach and homomorphic algebra [1706.01756]. ## 3. Protocol Structure The OKHER protocol typically comprises four phases: 1. **Setup:** Receiver generates a homomorphic key pair and encodes the database using a Sparse Oblivious Key–Value Store (SOKVS). Batch PIR infrastructure is also established for efficient retrieval [2601.20400]. 2. **Query:** Sender forms queries by mapping keys to indices (via sparse selector maps), combining queries into a batched index set for PIR [2601.20400]. 3. **Response:** Receiver homomorphically encrypts matching values and PIR-serves the batched results, returning masked ciphertext vectors for decoding [2601.20400]. In the HPRE scenario, proxy computes blinded differences and re-encrypts under the delegate’s key [1706.01756]. 4. **Decode:** Sender locally assembles the results, decrypting matching ciphertexts to obtain the values for the queried keys, and dummy values otherwise [2601.20400]. For secure FHE-based search, a bit-vector $b = (b_1, ..., b_n)$ encodes query matches. Compression into Bloom filter hierarchies or polynomial-encoded vectors drastically reduces overhead and enables retrieval of all matches in a single protocol execution [2109.07708]. ## 4. Efficiency Considerations OKHER protocols are engineered for asymptotic and empirical efficiency: - **Computational Complexity:** BF-COIE encodes match indices with $O(n \log(n/s))$ homomorphic additions and *zero* homomorphic multiplications; PS-COIE achieves retrieval with only scalar multiplications and additions [2109.07708]. HPRE-based OKHER requires $O(N)$ Paillier exponentiations per re-encryption round [1706.01756]. SOKVS-based approaches scale as $\widetilde O(N)$ for receiver work and $O(m \log N)$ for sender work [2601.20400]. - **Communication Volume:** Compression yields $O(s^{1+1/\eta} \log(n/s))$ ciphertexts for $s$ matches in $n$ records, contrasting with prior approaches requiring $O(n)$ ciphertexts. Multi-round protocols are collapsed into a single round with substantial bandwidth reduction. For PIR-based variants, communication is bounded by $O(m \log N)$, amortizing response vectors over batch queries [2601.20400]. - **Empirical Benchmarks:** BF-COIE achieves a 1800× speed-up for retrieval and 26× end-to-end acceleration for fetching multiple items compared to previous methods; communication can be packed to 1–2 ciphertexts plus PIR [2109.07708]. ## 5. Security and Privacy Guarantees Security analyses are rooted in the Random Oracle Model for FHE instantiations and the standard IND-CPA and PIR security models for LHE/SOKVS-based protocols: - **Correctness:** The client recovers a set $S'$ of size $\leq s + f_p$ containing all true matches, aborting if false positives or undercounts exceed bounds [2109.07708]. - **Confidentiality:** The server (or proxy) only observes encrypted objects and compressed encodings, leaking at most the number of matches $s$ and false positives $f_p$ [2109.07708]. In HPRE, neither user’s private key nor plaintexts are revealed [1706.01756]. - **Indistinguishability:** A semi-honest adversary cannot distinguish between equal-size query results across different databases or queries [2109.07708]. - **Obliviousness:** Only the requisite ciphertexts are revealed to the sender, with dummy values served for non-matching queries; retrieval and encoding operations leak no key–value pair information aside from that dictated by the output [2601.20400]. ## 6. Applications and Comparative Analysis OKHER instantiations find utility in privacy-preserving database querying, Private Set Union/Intersection, and key-rotatable encrypted sharing: - **Fuzzy Private Set Union (FPSU):** OKHER underpins union protocols where matches are defined by approximate ball membership for high-dimensional data, scaling communication as $O(dm\log(\delta n))$ to $O(d^2 m \log(\delta^2 n))$ depending on data structure [2601.20400]. - **Proxy Re-Encryption:** Enables secure multi-user data sharing over cloud platforms, with key migration unattainable for previous methods without trusted third parties or re-encryption key disclosure [1706.01756]. - **Comparison with OKVR:** OKHER leverages IND-CPA LHE for value-blindness without requiring Oblivious PRF rounds, streamlining instantiation and retaining retrieval efficiency [2601.20400]. ## 7. Practical Instantiations and Implementation Results The BF-COIE protocol on Microsoft SEAL (BFV), instantiated with $N=16\,384$ and $t=65\,537$, yields 128-bit quantum-safe security and ciphertexts $\approx 103$ KB [2109.07708]. SealPIR-based retrievals can reduce fetch communication per match to $\approx 369$ KB (or $80$ KB in optimized variants). For $n=10\,000$ and $s=16$, BF-COIE showed a $1800\times$ speed-up in retrieval time and major compression in bandwidth compared to LEAF+ [2109.07708]. Paillier-based HPRE instantiations require $O(3N)$ exponentiations for full key migration, with delegator and delegate performing only $O(1)$ cost offline for key generation and agreement, and the cloud never learning secret material or plaintexts [1706.01756]. SOKVS-based OKHER achieves $O(m\log N)$ communication and sublinear PIR work, demonstrated on toy examples and scalable to large, structured databases [2601.20400]. --- **Summary Table: Protocol Parameters and Performance** | Protocol | Setup/Encoding Cost | Communication | Retrieval Complexity | |----------------|----------------------------|------------------------|-----------------------| | BF-COIE [2109.07708] | $O(n \log(n/s))$ additions, 0 multiplications | $O(s^{1+1/\eta}\log(n/s))$ ciphertexts | $O(s\log(n/s))$ checks | | HPRE-based [1706.01756] | $O(N)$ exponentiations, 2 offline encryptions | $O(N)$ ciphertexts (per round) | $O(N)$ exponentiations | | SOKVS/PIR [2601.20400] | $\widetilde O(N)$ (receiver), $O(m\log N)$ (sender) | $O(m\log N)$ | $O(m)$ additions | All protocols support oblivious retrieval, IND-CPA security of output values, and operate robustly in the semi-honest adversarial model. --- Oblivious Key Homomorphic Encryption Retrieval establishes a flexible and rigorously secure foundation for modern encrypted search, multi-party computation, and key-migratable encrypted data systems, as evidenced by empirical results and formal analyses in the referenced works. Source: https://www.emergentmind.com/topics/oblivious-key-homomorphic-encryption-retrieval-okher