Homomorphic encryption and secure comparison

International Journal of Applied Cryptography

Volumn 1, Issue 1, 2008, Pages 22-31

  Damgård, Ivan ^a   Geisler, Martin ^a   Krøigård, Mikkel ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Benchmark; Homomorphic encryption; MPC; Online auctions; Protocols; Secret sharing; Secure integer comparison; Secure multiparty computation; Security

Indexed keywords

EID: 70449575839     PISSN: 17530563     EISSN: 17530571     Source Type: Journal    
DOI: 10.1504/IJACT.2008.017048     Document Type: Article

References (17)

1. Blake, I.F. and Kolesnikov, V. (2004) 'Strong conditional oblivious transfer and computing on intervals', in P.J. Lee, (Ed). ASIACRYPT'04, Volume 3329 of Lecture Notes in Computer Science, Springer, pp. 515-529. (Pubitemid 39747776)
2. Blake, I.F. and Kolesnikov, V. (2006) 'Conditional encrypted mapping and comparing encrypted numbers', in G. Di Crescenzo and A. Rubin, (Eds). FC 06, Volume 4107 of Lecture Notes in Computer Science, Springer.
3. Brand, S. (1997) 'Rapid demonstration of linear relations connected by boolean operators', in J. Stern (Ed). EUROCRYPT'97, Volume 1233 of Lecture Notes in Computer Science, Springer, pp. 318-333.
4. Canetti, R. (2000) 'Security and composition of multiparty cryptographic protocols', Journal of Cryptology, Vol. 13, No. 1, pp. 143-202.
5. Cramer, R., Damgård, I. and Nielsen, J.B. (2001) 'Multiparty computation from threshold homomorphic encryption', in B. Pfitzmann (Ed).EUROCRYPT'01,Volume 2045 of Lecture Notes in Computer Science, Springer, pp. 280-299.
6. eBay Inc. (2006) 'Bid increments', Available at: http: //pages.ebay.com/help/buy/bid-increments.html
7. Fischlin, M. (2001) 'A cost-effective pay-per-multiplication comparison method for millionaires', in D. Naccache (Ed). CT-RSA'01, Volume 2020 of Lecture Notes in Computer Science, Springer, pp. 457-472.
8. Fujisaki, E. and Okamoto, T. (1997) 'Statistical zero knowledge protocols to prove modular polynomial relations', in B.S.K. Jr. (Ed). CRYPTO'97,volume 1294 of Lecture Notes in Computer Science,Springer, pp. 16-30. (Pubitemid 127112542)
9. Garay, J., Schoenmakers, B. and Villegas, J. (2007) 'Practical and secure solutions for integer comparison', in T. Okamoto and X. Wang (Ed). PKC'03, Volume 4450 of Lecture Notes in Computer Science, Springer, pp. 330-342.
10. Groth, J.(2003) 'A verifiable secret shuffle of homomorphic encryptions', inY. Desmedt (Ed). PKC'03,Volume 2567 of Lecture Notes in Computer Science, Springer, pp. 145-160. (Pubitemid 137638348)
11. Groth (2005) 'Cryptography in subgroups of Zn', in J. Kilian (Ed). TCC'05, Volume 3378 of Lecture Notes in Computer Science, Springer, pp. 50-65.
12. Naor, M., Pinkas, B. and Sumner, R. (1999) 'Privacy preserving auctions and mechanism design', EC'99, New York: ACM Press, pp. 129-139.
13. Paillier, P. (1999) 'Public-key cryptosystems based on composite degree residuosity classes', in J. Stern (Ed). EUROCRYPT'99, volume 1592 of Lecture Notes in Computer Science, Springer, pp. 223-238.
14. Pohlig, S.C. and Hellman, M.E. (1978) 'An improved algorithm for computing logarithms over GF(p) and its cryptographic significance', IEEE Transactions on Information Theory, Vol. 24, pp. 106-110.
15. Rode, M. (2004) 'Debat: reglerne er strammet op', Morgenavisen Jyllands-Posten, Available at: http://www.jp.dk/morgenavisen/ mmeninger:aid=2690052/.
16. Schnorr, C-P. (1991) 'Efficient signature generation by smart cards', Journal of Cryptology, Vol. 4, No. 3, pp. 161-174.
17. Toft, T. (2007) 'Primitives and applications for multi-party computation', PhD thesis, University of Aarhus, Aarhus, Denmark.