Abstract
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 ɛ(x) and ɛ(y), one can compute the encrypted sum ɛ(x + y) or the encrypted product ɛ(kx) of the encrypted integer x and a known integer k without having to decrypt the terms ɛ(x) or ɛ(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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi and J. Feigenbaum. Secure circuit evaluation: a protocol based on hiding information from an oracle. Journal of Cryptology, 2(1):1–12, 1990.
O. Baudron, P.A. Fouque, D. Pointcheval, G. Poupard, and J. Stern. Practical Multi-Candidate Election System. In PODC’ 01. ACM, 2001.
O. Baudron and J. Stern. Non-interactive Private Auctions. In Financial Crypto’ 01, LNCS. Springer-Verlag, Berlin, 2001.
J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, 1987.
D. Boneh and R. Lipton. Searching for Elements in Black-Box Fields and Applications. In Crypto’ 96, LNCS 1109, pages 283–297. Springer-Verlag, 1996.
H. Cohen. A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics 138. Springer-Verlag, 1993.
J. Cohen and M. Fisher. A robust and verifiable cryptographically secure election scheme. In Symposium on Foundations of Computer Science. IEEE, 1985.
R. Cramer, I. Damgård, and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. In Eurocrypt’ 01, LNCS 2045, pages 280–300. Springer-Verlag, 2001.
I. Damgård and M. Jurik. Efficient Protocols based on Probabilistic Encryption using Composite Degree Residue Classes. In PKC’ 01, LNCS 1992, pages 119–136. Springer-Verlag, 2001.
H. Daudé, P; Flajolet, and B. Vallée. An average-case analysis of the gaussian algorithm for lattice reduction. Combin. Probab. Comput, 6(4):397–433, 1997.
J. Feigenbaum and M. Merritt. Open Questions, Talks Abstracts, and Summary of Discussions. DIM ACS Series in Discrete Mathematics and Theoretical Computer Science, 2:1–45, 1991.
P. A. Fouque, G. Poupard, and J. Stern. Sharing Decryption in the Context of Voting or Lotteries. In Financial Crypto’ 00, LNCS. Springer-Verlag, 2000.
S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28, 1984.
A. Joux. La Réduction des Réseaux en Cryptographie. PhD thesis, École polytechnique, 1993.
D. Naccache and J. Stern. A New Public Key Cryptosystem Based on Higher Residues. In Proc. of the 5th CCCS, pages 59–66. ACM press, 1998.
T. Okamoto and S. Uchiyama. A New Public-Key Cryptosystem as Secure as Factoring. In Eurocrypt’ 98, LNCS 1403, pages 308–318. Springer-Verlag, 1998.
P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Eurocrypt’ 99, LNCS 1592, pages 223–238. Springer-Verlag, 1999.
G. Poupard and J. Stern. Fair Encryption of RSA Keys. In Proceedings of Eurocrypt 2000, Lecture Notes in Computer Science, pages 172–189. Springer-Verlag, 2000.
R. Rivest, L. Adleman, and M. L. Dertouzos. On Data Banks and Privacy Homomorphisms. In Foundations of Secure Computation, pages 169–179. Academic Press, 1978.
T. Sander, A. Young, and M. Yung. Non-Interactive CryptoComputing for NC 1. In Proc. of the 31st STOC. ACM, 1999.
V. Shoup. Number Theory Library (NTL). Can be obtained at http://www.shoup.net.
B. Vallée. Gauss’ algorithm revisited. J. Algorithms, 12:556–572, 1991.
S. Vanstone and R. Zuccherato. Elliptic Curve Cryptosystem Using Curves of Smooth Order Over the Ring Z n. IEEE Transaction on Information Theory, IT-43, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFCA/Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fouque, PA., Stern, J., Wackers, GJ. (2003). CryptoComputing with Rationals. In: Blaze, M. (eds) Financial Cryptography. FC 2002. Lecture Notes in Computer Science, vol 2357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36504-4_10
Download citation
DOI: https://doi.org/10.1007/3-540-36504-4_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00646-6
Online ISBN: 978-3-540-36504-4
eBook Packages: Springer Book Archive