A private stable matching algorithm

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

Volumn 4107 LNCS, Issue , 2006, Pages 65-80

  Golle, Philippe ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER CRIME; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY; SECURITY SYSTEMS; SEMANTICS;

MATCHING ALGORITHMS; MATCHING AUTHORITIES; PRIVATE ALGORITHMS;

DATA PRIVACY;

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

References (26)

1. Association of Psychology Postdoctoral and Internship Centers, http://www.appic.org/match/
2. C. Bandela, Y. Chen, A. Kahng, I. Mandoiu and A. Zelikovsky. Multiple-object XOR auctions with buyer preferences and seller priorities. In Competitive Bidding and Auctions, K.K. Lai and S. Wang, ed. Kluwer Academic Publishers.
3. Canadian Resident Matching Service (CaRMS). http://www.carms.ca/jsp/main. jsp
4. R. Cramer, I. Damgård, S. Dziembowski, M. Hirt and T. Rabin. Efficient multiparty computations secure against an adaptive adversary. In Proc. of Eurocrypt'99, pp. 311-326.
5. I. Damgård and M. Jurik. A generalisation, a simplification and some applications of Paillier's probabilistic public-key system. In Proc. of Public Key Cryptography 2001, pp. 119-136.
6. D. Gale and H. S. Shapley. College Admissions and the Stability of Marriage. American Mathematical Monthly, 1962.
7. P.-A. Fouque, G. Poupard, and J. Stern. Sharing decryption in the context of voting or lotteries. In Proceedings of Financial Cryptography 2000, pp. 90-104, 2000.
8. D. Gale and M. Sotomayor. Ms Machiavelli and the Stable Matching Problem. In American Mathematical Monthly, 92, pp. 261-268, 1985.
9. O. Goldreich, S. Micali and A. Widgerson. How to play any mental game. In STOC'87, pp. 218-229. ACM, 1987.
10. D. Gusfield and R. Irving. The Stable Marriage Problem: Structure and Algorithms. MIT Press.
11. M. Jakobsson, A. Juels, and R. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In Proc. of USENIX'02, pp. 339-353.
12. M. Jakobsson and C. Schnorr. Efficient Oblivious Proofs of Correct Exponentiation. In Proc. of CMS 99.
13. H. Lipmaa. Verifiable homomorphic oblivious transfer and private equality test. In Proc. of Asiacrypt 2003, pp. 416-433. LNCS 2894.
14. National Matching Services Inc. http://www.natmatch.com/
15. National Resident Matching Program (NRMP). http://www.nrmp.org/
16. A. Neff. A verifiable secret shuffle and its application to e-voting. In Proc. of ACM CCS '01, pp. 116-125.
17. M. Ostrovsky. Stability in supply chain networks. Available on the web at economics.uchicago.edu/download/Supply%20Chains%20-%20December% 2012.pdf
18. P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Proc. of Eurocrypt 1999, pp. 223-238. LNCS 1592, Springer Verlag.
19. A. Roth. The Economics of Matching: Stability and Incentives. In Mathematics of Operations Research, 7, pp. 617-628, 1982.
20. A. Roth and M. Sotomayor. Two-sided matching: a study in game-theoretic modeling and analysis. Econometric Society Monograph Series (1990). New York: Cambridge University Press.
21. Al Roth's game theory, experimental economics, and market design page. Bibliography of two-sided matching. On the web at http://kuznets.fas.harvard. edu/~aroth/bib.html#matchbib
22. A. D. Santis, G. D. Crescenzo, G. Persiano, and M. Yung. On monotone formula closure of szk. In Proc. of the IEEE FOCS 1994, pages 454-465, 1994.
23. Scottish PRHO Allocation (SPA) scheme, http://www.nes.scot.nhs.uk/spa/
24. M. Soerensen. How smart is smart money? An empirical two-sided matching model of venture capital. Available on the web at http://finance.wharton.upenn. edu/department/Seminar/2004SpringRecruiting/Micro/SorensenPaper-micro-012204.pdf
25. C.-P. Teo, J. Sethuraman and W.-P. Tan. Gale-Shapley stable marriage problem revisited: strategic issues and applications. In Proc. of IPCO '99: the 7th Conference on Integer Programming and Combinatorial Optimisation, pp. 429-438. LNCS 1610.
26. A. C. Yao. Protocols for secure computations. In FOCS'82, pp. 160-164. IEEE Computer Society, 1982.