Improved efficiency for private stable matching

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

Volumn 4377 LNCS, Issue , 2007, Pages 163-177

  Franklin, Matthew ^a   Gondree, Mark ^a   Mohassel, Payman ^a  

^a University of California   (United States)

Author keywords

Gale Shapley; Passive adversaries; Privacy preserving protocols; Secure multiparty computation; Stable marriage; Stable matching

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY;

PASSIVE ADVERSARY; PRIVACY-PRESERVING PROTOCOLS; SECURE MULTI-PARTY COMPUTATION; SHAPLEY; STABLE MARRIAGES; STABLE MATCHING;

DATA PRIVACY;

EID: 79251576583     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11967668_11     Document Type: Conference Paper

References (25)

1. Joy Algesheimer, Jan Camenisch, and Victor Shoup. Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In CRYPTO ’02, pages 417–432, 2002.
2. Donald Beaver, Silvio Micali, and Phillip Rogaway. The round complexity of secure protocols. In ACM Symposium on Theory of Computing, pages 503–513, 1990.
3. Ran Canetti. Security and composition of multiparty cryptographic protocols. In Journal of Cryptology, volume 13, pages 143–202, 2000.
4. Ronald Cramer and Ivan Damgård. Secure distributed linear algebra in a constant number of rounds. In CRYPTO ’01, pages 119–136, 2001.
5. Ivan Damgård, Matthias Fitzi, Jesper Buus Nielsen, and Tomas Toft. How to split a shared secret into shared bits in constant-round. Cryptology ePrint Archive, Report 2005/140, 2005.
6. Ivan Damgård and Mads Jurik. A generalisation, a simplification and some applications of Paillier’s probabilistic public-key system. In Public Key Cryptography, pages 119–136, 2001.
7. Pierre-Alain Fouque, G Poupard, and Jacques Stern. Sharing decryption in the context of voting or lotteries. In Financial Crypto, 2000.
8. Matthew Franklin, Mark Gondree, and Payman Mohassel. Improved efficiency for private stable matching. Cryptology ePrint Archive, Report 2006/332, 2006.
9. David Gale and Lloyd Stowell Shapley. College admissions and the stability of marriage. American Mathematical Monthly, 69:9–15, 1962.
10. Oded Goldreich. Foundations of Cryptography. Cambridge University Press, 2001.
11. Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game. In ACM Symposium on Theory of Computing, pages 218–229, 1987.
12. Philippe Golle. A private stable matching algorithm. In Financial Crypto, 2006.
13. Philippe Golle and Ari Juels. Parallel mixing. In ACM Computer and Communications Security, pages 220–226, 2004.
14. Dan Gusfield and Robert Irving. The Stable Marriage Problem: Structure and Algorithms. MIT Press, 1989.
15. Markus Jakobsson, Ari Juels, and Ron Rivest. Making mix nets robust for electronic voting by randomized partial checking. In Proc. of USENIX’02, pages 339–353, 2002.
16. Markus Jakobsson and Claus Peter Schnorr. Efficient oblivious proofs of correct exponentiation. In Communications and Multimedia Security, pages 71–86, 1999.
17. Eike Kiltz. Unconditionally secure constant round multi-party computation for equality, comparison, bits and exponentiation. Cryptology ePrint Archive, Report 2005/066, 2005.
18. Eyal Kushilevitz and Rafail Ostrovsky. Replication is not needed: single database, computationally-private information retrieval. In Foundations of Computer Science, pages 364–373, 1997.
19. Yehuda Lindell and Benny Pinkas. A proof of Yao’s protocol for secure two-party computation. Cryptology ePrint Archive, Report 2004/175, 2004.
20. Helger Lipmaa. Verifiable homomorphic oblivious transfer and private equality test. In ASIACRYPT 2003, pages 416–433, 2003.
21. Moni Naor and Kobbi Nissim. Communication preserving protocols for secure function evaluation. In ACM Symposium on Theory of Computing, pages 590–599, 2001.
22. C. Andrew Neff. A verifiable secret shuffe and its application to e-voting. In ACM Computer and Communications Security, pages 116–125, 2001.
23. Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. In EUROCRYPT’99, pages 223–238, 1999.
24. Julien P. Stern. A new and efficient all-or-nothing disclosure of secrets protocol. In ASI-ACRYPT’98, pages 357–371, 1998.
25. Andrew C. Yao. How to generate and exchange secrets. In Foundations of Computer Science, pages 162–167, 1986.