Secure Function Extensions to Additively Homomorphic Cryptosystems

Authors

Mounika Pratapa, Western UniversityFollow
Aleksander Essex, Western UniversityFollow

Document Type

Conference Proceeding

Publication Date

2023

Volume

14201

Journal

International Conference on Selected Areas in Cryptography – SAC 2023

First Page

346

URL with Digital Object Identifier

https://doi.org/10.1007/978-3-031-53368-6_17

Last Page

366

Abstract

The number-theoretic literature has long studied the question of distributions of sequences of quadratic residue symbols modulo a prime number. In this paper, we present an efficient algorithm for generating primes containing chosen sequences of quadratic residue symbols and use it as the basis of a method extending the functionality of additively homomorphic cryptosystems.

We present an algorithm for encoding a chosen Boolean function into the public key and an efficient two-party protocol for evaluating this function on an encrypted sum. We demonstrate concrete parameters for secure function evaluation on encrypted sums up to eight bits at standard key sizes in the integer factorization setting. Although the approach is limited to applications involving small sums, it is a practical way to extend the functionality of existing secure protocols built on partially homomorphic encryption schemes.

Notes

• DOI: https://doi.org/10.1007/978-3-031-53368-6_17

• Conference date: August 14-18, 2023

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 License.

Citation of this paper:

Pratapa, M., Essex, A. (2024). Secure Function Extensions to Additively Homomorphic Cryptosystems. In: Carlet, C., Mandal, K., Rijmen, V. (eds) Selected Areas in Cryptography – SAC 2023. SAC 2023. Lecture Notes in Computer Science, vol 14201. Springer, Cham. https://doi.org/10.1007/978-3-031-53368-6_17