Abstract
Matchmaking protocol is a procedure to find matched pairs in registered groups of participants depending on their choices, while preserving their privacy. In this study we define the concept of matchmaking and construct a simple and efficient matchmaking protocol under the simple rule that two members become a matched pair only when they have chosen each other. In matchmaking protocol, participant’s privacy is of prime concern, specially losers’ choices should not be opened. Our basic approach to achieve privacy is finding collisions among multiple secure commitments without decryption. For this purpose we build a protocol to find collisions in ElGamal ciphertexts without decryption using Michels and Stadler’s protocol [MS97] of proving the equality or inequality of two discrete logarithms. Correctness is guaranteed because all procedures are universally verifiable.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Ben-Or, S. Goldwasser and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerent distributed computation”, 20th STOC, pages 1–10, 1988.
R. Canetti, “Studies in Secure Multiparty Computation and Applications”, PhD Thesis, The Weizmann Institute of Science, 1996.
D. Chaum, C. Crepeau and I. Damgard, “Multiparty unconditionally secure protocols”, 20th STOC, pages 11–19, 1988.
R. Cramer, R. Gennaro, and B. Schoenmakers, “A secure an optimally efficient multi-authority election schemes”, In Advances in Cryptology-Eurocrypt’ 97, LNCS Vol. 1233, pages 103–118, Springer-Verlag, 1997.
D. Chaum and T. Pedersen, “Wallet databases with observers”, In Advances in Cryptology-Crypto’92, LNCS Vol. 740, pages 89–105, Springer-Verlag, 1993.
R. Cramer, “Introduction to Secure Computation”, In Lectures on Data Security-Modern Cryptology in Theory and Practice, Ivan Damgaard (Ed.), Springer LNCS Tutorial, vol.1561, pages 16–62, 1999.
A. Fiat and A. Shamir, “How to prove yourself: Practical solutions to identication and signature problems”, In Advances in Cryptology-Crypto’86, pages 186–194, Springer-Verlag, 1987.
O. Goldreich, “Secure Multi-Party Computation”, Manuscript version 1.1, 1998.
O. Goldreich, S. Micali and A. Wigderson, “How to play any mental game”, 19th STOC, pages 218–229, 1987.
M. M ichels and M. S tadler, “Efficient convertible undeniable signature”, Proc. of 4th annual workshop on selected areas in cryptography, 1997.
C.P. Schnorr and M. Jakobsson, “Security of signed ElGamal encryption”, In Advances in Cryptology-Asiacrypt’2000, LNCS V. 1976, pages 73–89, Springer-Verlag, 2000.
Y. T siounis and M. Yung, “On the Security of ElGamal Based Encryption”, PKC’98, LNCS 1431, pages 117–134, Springer-Verlag, 1998.
A. Yao, “Protocols for Secure Computation”, 23th FOCS, pages 160–164, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, B., Kim, K. (2001). Secure Matchmaking Protocol. In: Won, D. (eds) Information Security and Cryptology — ICISC 2000. ICISC 2000. Lecture Notes in Computer Science, vol 2015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45247-8_10
Download citation
DOI: https://doi.org/10.1007/3-540-45247-8_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41782-8
Online ISBN: 978-3-540-45247-8
eBook Packages: Springer Book Archive