Metraipolis › archive › dc_df17329afd02
Batched Paillier-Based Hamming-Distance Computation over Binary Embeddings — arXiv:2609.21364
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.21364
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T01:43:46.030Z
- SHA-256 of the archived text
cdb75b1b602519decf258ac70915101af54bc0b49d2037d2b1f115fd9bff9186- Stable URL of this page
https://metraipolis.com/documento/dc_df17329afd02
How to cite
Batched Paillier-Based Hamming-Distance Computation over Binary Embeddings — arXiv:2609.21364 — arXiv (en), https://arxiv.org/abs/2609.21364 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_df17329afd02 (Metraipolis archive dc_df17329afd02, sha256 cdb75b1b602519decf258ac70915101af54bc0b49d2037d2b1f115fd9bff9186)
BibTeX
@misc{dcdf17329afd02,
title = {Batched Paillier-Based Hamming-Distance Computation over Binary Embeddings — arXiv:2609.21364},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.21364},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_df17329afd02; sha256 cdb75b1b602519decf258ac70915101af54bc0b49d2037d2b1f115fd9bff9186},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21364. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Additively homomorphic encryption supports outsourced computation on encrypted binary embeddings, but large-integer arithmetic and data movement can limit throughput. We describe a Paillier-based client that combines a carry-separated binary encoding, table-based encryption, reduced-exponent decryption, CUDA/CGBN arithmetic, persistent device state, and batched retrieval integration. We establish the encoding's correctness and characterize four CPU and GPU client configurations. The lookup configuration uses a 280-bit exponent-size parameter. Across 3 warm-state trials on batches of 10,000 random 512-bit embeddings, the lookup GPU configuration achieved median-batch throughputs of 43,091 encryptions/s and 28,983 Hamming- distance decodes/s. Its amortized costs were 0.0232 ms and 0.0345 ms per vector, corresponding to factors of 453.8 and 200.9 relative to the measured CPU baseline. These implementation- specific results demonstrate the throughput benefits of combining cryptographic precomputation, batched accelerator execution, and persistent runtime state. The study distinguishes warm-batch performance from isolated-request latency and identifies the remaining costs of initialization, transport, and retrieval integration. Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-21 in cs.CR). Categorie arXiv: Cryptography and Security (cs.CR). Pagina del lavoro: https://arxiv.org/abs/2609.21364 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-10T01:13:42.021Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).