A Private Stable Matching Algorithm-Reference-Cited by-同舟云学术

A Private Stable Matching Algorithm

Published:2006 Issue: Volume: Page:65-80
ISSN:0302-9743
Container-title:Financial Cryptography and Data Security
language:
Short-container-title:

Author:

Golle Philippe

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11889663_5

Reference26 articles.

1. Association of Psychology Postdoctoral and Internship Centers, http://www.appic.org/match/

2. Bandela, C., Chen, Y., Kahng, A., Mandoiu, I., Zelikovsky, A.: Multiple-object XOR auctions with buyer preferences and seller priorities. In: Lai, K.K., Wang, S. (eds.) Competitive Bidding and Auctions, Kluwer Academic Publishers, Dordrecht

3. Canadian Resident Matching Service (CaRMS), http://www.carms.ca/jsp/main.jsp

4. Lecture Notes in Computer Science;R. Cramer,1999

5. Damgård, I., Jurik, M.: A generalisation, a simplification and some applications of Paillier’s probabilistic public-key system. In: Proc. of Public Key Cryptography 2001, pp. 119–136 (2001)

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. BAZAAR: Anonymous Resource Sharing;Proceedings of the 22nd Workshop on Privacy in the Electronic Society;2023-11-26

2. Privacy-Preserving Fully Online Matching with Deadlines;Proceedings of the Thirteenth ACM Conference on Data and Application Security and Privacy;2023-04-24

3. A Verifiable Multiparty Computation Solver for the Linear Assignment Problem;Proceedings of the 2022 on Cloud Computing Security Workshop;2022-11-07

4. Secure Maximum Weight Matching Approximation on General Graphs;Proceedings of the 21st Workshop on Privacy in the Electronic Society;2022-11-07

5. Privacy-Preserving Maximum Matching on General Graphs and its Application to Enable Privacy-Preserving Kidney Exchange;Proceedings of the Twelfth ACM Conference on Data and Application Security and Privacy;2022-04-14