CryptoComputing with Rationals - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

CryptoComputing with Rationals


In this paper we describe a method to compute with encrypted rational numbers. It is well-known that homomorphic schemes allow calculations with hidden integers, i.e. given integers $x$ and $y$ encrypted in $E(x)$ and $E(y)$, one can compute the encrypted sum $E(x + y)$ or the encrypted product $E(kx)$ of the encrypted integer $x$ and a known integer $k$ without having to decrypt the terms $E(x)$ or $E(y)$. Such cryptosystems have a lot of applications in electronic voting schemes, lottery or in multiparty computation since they allow to keep the privacy of the terms and return the result in encrypted form. However, from a practical point of view, it might be interesting to compute with rationals. For instance, a lot of financial applications require algorithms to compute with rational values instead of integers such as bank accounts, electronic purses in order to make payments or micropayments, or secure spreadsheets. We present here a way to solve this problem using the Paillier cryptosystem which offers the largest bandwidth among all homomorphic schemes. The method uses two-dimensional lattices to recover the numerator and denominator of the rationals. Finally we implement this technique and our results in order to build an encrypted spreadsheet showing the practical possibilities of the homomorphic properties applied on rationals.
Fichier principal
Vignette du fichier
fc02.pdf (254.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00565270 , version 1 (11-02-2011)



Pierre-Alain Fouque, Jacques Stern, Jan-Geert Wackers. CryptoComputing with Rationals. Financial Cryptography, 6th International Conference, FC 2002, 2002, Southampton, United Kingdom. pp.136-146, ⟨10.1007/3-540-36504-4_10⟩. ⟨inria-00565270⟩
84 View
279 Download



Gmail Facebook Twitter LinkedIn More