Skip to main content
SpringerLink
Log in

A Feasibility Evaluation of Fair and Privacy-Enhanced Matchmaking with Identity Linked Wishes

  • Conference paper
  • First Online:
Information Security and Privacy (ACISP 2017)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10343))

Included in the following conference series:

Abstract

The Prom Problem (TPP) represents a special class of matchmaking challenges that amplify the conflicting requirements of anonymity and authentication necessitating fair and privacy-enhanced matchmaking with identity-linked wishes (ILW). ILW are wishes that involve particular identities and are valid only if all associated parties have those same wishes. In this paper, we provide a feasibility evaluation of an implementation of a previously proposed algorithm for TPP along with a detailed characterization of its fairness, and present results from computation and communication specific performance testing. To quantify fairness, we propose the use of a fairness index that combines the concepts underlying Jain’s index with previously established definitions of fair matchmaking and details of the protocol. We also delineate upper and lower bounds for the fairness index values in this context and discuss its relationship to the participants’ confidence in the result. Finally, we present performance results that answer key questions thereby demonstrating the practicality of the solution both in terms of computational costs and communication overhead. The results quantify relative impacts of higher degrees of confidence and anonymity to guide identification of appropriate tradeoffs as the solution is applied to varying problem domains with security and privacy requirements comparable to TPP with ILW.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Baldwin, R., Gramlich, W.C.: Cryptographic protocol for trustable match making. In: 1985 IEEE Symposium on Security and Privacy, p. 92. IEEE (1985). doi:10.1109/SP.1985.10011

  2. Meadows, C.: A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In: 1986 IEEE Symposium on Security and Privacy, p. 134. IEEE (1986). doi:10.1109/SP.1986.10022

  3. Lee, B., Kim, K.: Secure matchmaking protocol. In: Won, D. (ed.) ICISC 2000. LNCS, vol. 2015, pp. 123–134. Springer, Heidelberg (2001). doi:10.1007/3-540-45247-8_10

    Chapter  Google Scholar 

  4. Zhang, K., Needham, R.: A private matchmaking protocol (2001). http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.835

  5. Atallah, M.J., Cho, Y.: Private discovery of shared interests. In: Proceedings 9th International Conference on Information and Communications Security, ICICS 2007, Zhengzhou, China, December 2007

    Google Scholar 

  6. Patrick, K.N.: Comparison of documents possessed by two parties. U.S. Patent 8 032 747 (2011)

    Google Scholar 

  7. Veugen, P.J.M., Van Deventer, M.O., Klos, V.B.: Shared secret verification method and system. U.S. Patent 8 527 765 (2013)

    Google Scholar 

  8. Shin, J.S., Gligor, V.D.: A new privacy-enhanced matchmaking protocol. IEICE Trans. Commun. 96-B(8), 2049–2059 (2013)

    Google Scholar 

  9. Horne, D., Nair, S.: The prom problem: fair and privacy-enhanced matchmaking with identity linked wishes. In: IEEE International Carnahan Conference on Security Technology (ICCST), pp. 115–122. IEEE (2016)

    Google Scholar 

  10. Bellare, M., Pointcheval, D., Rogaway, P.: Authenticated key exchange secure against dictionary attacks. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 139–155. Springer, Heidelberg (2000). doi:10.1007/3-540-45539-6_11

    Chapter  Google Scholar 

  11. Canetti, R., Halevi, S., Katz, J., Lindell, Y., MacKenzie, P.: Universally composable password-based key exchange. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 404–421. Springer, Heidelberg (2005). doi:10.1007/11426639_24

    Chapter  Google Scholar 

  12. Syverson, P.F., Goldschlag, D.M., Reed, M.G.: Anonymous connections and onion routing. In: 1997 IEEE Symposium on Security and Privacy, pp. 44–54. IEEE (1997)

    Google Scholar 

  13. Office of the Australian Information Commissioner and Office of the Privacy Commissioner of Canada: Joint investigation of Ashley Madison by the Privacy Commissioner and Acting Australian Information Commissioner (2016). https://www.oaic.gov.au/resources/privacy-law/commissioner-initiated-investigation-reports/ashley-madison.pdf

  14. Bellare, M., Boldyreva, A., Desai, A., Pointcheval, D.: Key-privacy in public-key encryption. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 566–582. Springer, Heidelberg (2001). doi:10.1007/3-540-45682-1_33

    Chapter  Google Scholar 

  15. Jain, R., Chiu, D.M., Hawe, W.R.: A quantitative measure of fairness and discrimination for resource allocation in shared computer system, vol. 38. Eastern Research Laboratory, Digital Equipment Corporation, Hudson (1984)

    Google Scholar 

  16. Joe-Wong, C., Sen, S., Lan, T., Chiang, M.: Multiresource allocation: fairness-efficiency tradeoffs in a unifying framework. IEEE/ACM Trans. Netw. 21(6), 1785–1798 (2013). doi:10.1109/TNET.2012.2233213

    Article  Google Scholar 

  17. Lan, T., Kao, D., Chiang, M., Sabharwal, A.: An axiomatic theory of fairness in network resource allocation. In: Proceedings of the 29th Conference on Information Communication, pp. 1–9. IEEE (2010). doi:10.1109/INFCOM.2010.5461911

  18. Buyya, R., Ranjan, R., Calheiros, R.N.: Modeling and simulation of scalable cloud computing environments and the CloudSim toolkit: challenges and opportunities. In: International Conference on High Performance Computing & Simulation, pp. 1–11. IEEE (2009). doi:10.1109/HPCSIM.2009.5192685

  19. Vogels, W.: Eventually consistent. Commun. ACM 52(1), 40–44 (2009). doi:10.1145/1435417.1435432

    Article  Google Scholar 

  20. Cardellini, V., Colajanni, M., Yu, P.S.: Geographic load balancing for scalable distributed web systems. In: Proceedings 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 20–27. IEEE (2000). doi:10.1109/MASCOT.2000.876425

  21. Pries, R., Yu, W., Graham, S., Fu, X.: On performance bottleneck of anonymous communication networks. In: 2008 International Symposium on Parallel and Distributed Processing, pp. 1–11. IEEE (2008). doi:10.1109/IPDPS.2008.4536239

  22. Zantout, B., Haraty, R.: I2P data communication system. In: Proceedings of ICN, pp. 401–409 (2011)

    Google Scholar 

  23. Nipane, N., Dacosta, I., Traynor, P.: Mix-in-place anonymous networking using secure function evaluation. In: Proceedings of the 27th Annual Computer Security Applications Conference, pp. 63–72. ACM (2011). doi:10.1145/2076732.2076742

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Southern Methodist University, Dallas, TX, USA

    Dwight Horne & Suku Nair

Authors
  1. Dwight Horne
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Suku Nair
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dwight Horne .

Editor information

Editors and Affiliations

  1. Queensland University of Technology, Brisbane, Queensland, Australia

    Josef Pieprzyk

  2. Queensland University of Technology, Brisbane, Queensland, Australia

    Suriadi Suriadi

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Horne, D., Nair, S. (2017). A Feasibility Evaluation of Fair and Privacy-Enhanced Matchmaking with Identity Linked Wishes. In: Pieprzyk, J., Suriadi, S. (eds) Information Security and Privacy. ACISP 2017. Lecture Notes in Computer Science(), vol 10343. Springer, Cham. https://doi.org/10.1007/978-3-319-59870-3_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59870-3_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59869-7

  • Online ISBN: 978-3-319-59870-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation