%0 Computer Program
%A Vos, Jelle
%A Vos, Daniël
%D 2025
%T Code underlying: Efficient Circuits for Permuting and Mapping Packed Values Across Leveled Homomorphic Ciphertexts
%U 
%R 10.4121/4b3dfb12-35e5-4d77-82ea-9758ac6dec18.v1
%K permutations
%K homomorphic encryption
%K cryptography
%K graph coloring
%X <p>This is an experimental implementation of a method to map elements accross multiple leveled homomorphic ciphertexts. Currently, only HElib ciphertexts are supported.</p><p><br></p><p><strong>Installing</strong></p><ol><li>Install HElib following their instructions</li><li>Run `git submodule update --init --recursive` for the graph coloring library</li></ol><p><br></p><p><strong>Building</strong></p><p>Building is simple using `cmake .`.</p><p><br></p><p><strong>Executing</strong></p><p>We implemented three different experiments:</p><ol><li>Benchmarking within-ciphertext permutations</li><li>Benchmarking across-ciphertext permutations</li><li>Benchmarking across-ciphertext mappings</li></ol><p>To choose one, pass the corresponding number to the program as an argument.</p>
%I 4TU.ResearchData