Conditional encrypted mapping and comparing encrypted numbers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4107 LNCS, Issue , 2006, Pages 206-220

  Blake, Ian F ^a   Kolesnikov, Vladimir ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Auctions; Conditional encrypted mapping; Private selective payments; Two Millionaires with encrypted inputs

Indexed keywords

COMPUTATIONAL METHODS; CONFORMAL MAPPING; DATA PRIVACY; ELECTRONIC COMMERCE; NETWORK PROTOCOLS; PROBLEM SOLVING;

AUCTIONS; CONDITIONAL ENCRYPTED MAPPING; ENCRYPTED NUMBERS; PRIVATE SELECTIVE PAYMENTS;

CRYPTOGRAPHY;

EID: 33750037945     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889663_18     Document Type: Conference Paper

References (16)

1. William Aiello, Yuval Ishai, and Omer Reingold. Priced oblivious transfer: How to sell digital goods. In Proc. EUROCRYPT 2001, pages 119-135, 2001.
2. Ian F. Blake and Vladimir Kolesnikov. Strong conditional oblivious transfer and computing on intervals. In Advances in Cryptology - ASIACRYPT 2004, volume 3329 of Lecture Notes in Computer Science, pages 515-529. Springer, 2004.
3. Christian Cachin. Efficient private bidding and auctions with an oblivious third party. In Proceedings of the 6th ACM Conference on Computer and Communications Security, pages 120-127. ACM Press, 1999.
4. G. Di Crescenzo, R. Ostrovsky, and S. Rajagopalan. Conditional oblivious transfer and time-released encryption. In Proc. CRYPTO 99, pages 74-89. Springer-Verlag, 1999. Lecture Notes in Computer Science, vol. 1592.
5. Giovanni Di Crescenzo. Private selective payment protocols. In Financial Cryptography, pages 72-89, 2000.
6. Marc Fischlin. A cost-effective pay-per-multiplication comparison method for millionaires. In RSA Security 2001 Cryptographer's Track, pages 457-471. Springer-Verlag, 2001. Lecture Notes in Computer Science, vol. 2020.
7. Michael J. Freedman, Kobbi Nissim, and Benny Pinkas. Efficient private matching and set intersection. In Proc. EUROCRYPT 2004, pages 1-19. Springer-Verlag, 2004. Lecture Notes in Computer Science, vol. 3027.
8. Yael Gertner, Yuval Ishai, Eyal Kushilevitz, and Tal Malkin. Protecting data privacy in private information retrieval schemes. In STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 151-160, New York, NY, USA, 1998. ACM Press.
9. Bart Goethals, Sven Laur, Helger Lipmaa, and Taneli Mielikäinen. On Private Scalar Product Computation for Privacy-Preserving Data Mining. In Choonsik Park and Seongtaek Chee, editors, The 7th Annual International Conference in Information Security and Cryptology (ICISC 2004), volume 3506, pages 104-120, December 2-3, 2004.
10. M. Kantarcioglu and C. Clifton. Privacy-preserving distributed mining of association rules on horizontally partitioned data. In ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery (DMKD'02), 2002.
11. Vladimir Kolesnikov. Gate evaluation secret sharing and secure one-round two-party computation. In Advances in Cryptology - ASIACRYPT 2005, volume 3788 of Lecture Notes in Computer Science, pages 136-155. Springer, 2005.
12. Sven Laur and Helger Lipmaa. Additive conditional disclosure of secrets and applications. Cryptology ePrint Archive, Report 2005/378, 2005. http://eprint.iacr.org/.
13. Yehuda Lindell and Benny Pinkas. Privacy preserving data mining. In Proc. CRYPTO 00, pages 20-24. Springer-Verlag, 2000. Lecture Notes in Computer Science, vol. 1880.
14. Moni Naor, Benny Pinkas, and Reuben Sumner. Privacy preserving auctions and mechanism design. In 1st ACM Conf. on Electronic Commerce, pages 129-139, 1999.
15. Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Proc. EUROCRYPT 99, pages 223-238. Springer-Verlag, 1999. Lecture Notes in Computer Science, vol. 1592.
16. M. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory, 1981.