The DOI displayed above is for this specific version of this dataset, which is currently the latest. Newer versions may be published in the future. For a link that will always point to the latest version, please use
DOI: 10.4121/4b3dfb12-35e5-4d77-82ea-9758ac6dec18

Vos, Jelle; Vos, Daniël (2025): Code underlying: Efficient Circuits for Permuting and Mapping Packed Values Across Leveled Homomorphic Ciphertexts. Version 1. 4TU.ResearchData. software. https://doi.org/10.4121/4b3dfb12-35e5-4d77-82ea-9758ac6dec18.v1

Categories

• Computation Theory and Mathematics
• Information and Computing Sciences

Keywords

cryptography graph coloring homomorphic encryption permutations

Licence

MIT

Export as...

RefWorks BibTeX Reference Manager Endnote DataCite NLM DC CFF

by Jelle Vos , Daniël Vos

This is an experimental implementation of a method to map elements accross multiple leveled homomorphic ciphertexts. Currently, only HElib ciphertexts are supported.

Installing

1. Install HElib following their instructions
2. Run `git submodule update --init --recursive` for the graph coloring library

Building

Building is simple using `cmake .`.

Executing

We implemented three different experiments:

1. Benchmarking within-ciphertext permutations
2. Benchmarking across-ciphertext permutations
3. Benchmarking across-ciphertext mappings

To choose one, pass the corresponding number to the program as an argument.

History

• 2025-03-06 first online, published, posted

Publisher

4TU.ResearchData

Format

C++/.cpp

Associated peer-reviewed publication

Efficient Circuits for Permuting and Mapping Packed Values Across Leveled Homomorphic Ciphertexts

Code hosting project url

https://github.com/jellevos/perm_map_circuits

Organizations

TU Delft, Faculty of Electrical Engineering, Mathematics and Computer Science, Department of Intelligent Systems