{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:30:08Z","timestamp":1725888608781},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319598697"},{"type":"electronic","value":"9783319598703"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59870-3_27","type":"book-chapter","created":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T22:14:17Z","timestamp":1496096057000},"page":"422-434","source":"Crossref","is-referenced-by-count":1,"title":["A Feasibility Evaluation of Fair and Privacy-Enhanced Matchmaking with Identity Linked Wishes"],"prefix":"10.1007","author":[{"given":"Dwight","family":"Horne","sequence":"first","affiliation":[]},{"given":"Suku","family":"Nair","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","unstructured":"Baldwin, R., Gramlich, W.C.: Cryptographic protocol for trustable match making. In: 1985 IEEE Symposium on Security and Privacy, p. 92. IEEE (1985). doi:\n10.1109\/SP.1985.10011","DOI":"10.1109\/SP.1985.10011"},{"key":"27_CR2","doi-asserted-by":"publisher","unstructured":"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:\n10.1109\/SP.1986.10022","DOI":"10.1109\/SP.1986.10022"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45247-8_10","volume-title":"Information Security and Cryptology \u2014 ICISC 2000","author":"B Lee","year":"2001","unstructured":"Lee, B., Kim, K.: Secure matchmaking protocol. In: Won, D. (ed.) ICISC 2000. LNCS, vol. 2015, pp. 123\u2013134. Springer, Heidelberg (2001). doi:\n10.1007\/3-540-45247-8_10"},{"key":"27_CR4","unstructured":"Zhang, K., Needham, R.: A private matchmaking protocol (2001). \nhttp:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.54.835"},{"key":"27_CR5","unstructured":"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"},{"key":"27_CR6","unstructured":"Patrick, K.N.: Comparison of documents possessed by two parties. U.S. Patent 8 032 747 (2011)"},{"key":"27_CR7","unstructured":"Veugen, P.J.M., Van Deventer, M.O., Klos, V.B.: Shared secret verification method and system. U.S. Patent 8 527 765 (2013)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Shin, J.S., Gligor, V.D.: A new privacy-enhanced matchmaking protocol. IEICE Trans. Commun. 96-B(8), 2049\u20132059 (2013)","DOI":"10.1587\/transcom.E96.B.2049"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013122. IEEE (2016)","DOI":"10.1109\/CCST.2016.7815691"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-45539-6_11","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Pointcheval, D., Rogaway, P.: Authenticated key exchange secure against dictionary attacks. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 139\u2013155. Springer, Heidelberg (2000). doi:\n10.1007\/3-540-45539-6_11"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/11426639_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"R Canetti","year":"2005","unstructured":"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\u2013421. Springer, Heidelberg (2005). doi:\n10.1007\/11426639_24"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Syverson, P.F., Goldschlag, D.M., Reed, M.G.: Anonymous connections and onion routing. In: 1997 IEEE Symposium on Security and Privacy, pp. 44\u201354. IEEE (1997)","DOI":"10.1109\/SECPRI.1997.601314"},{"key":"27_CR13","unstructured":"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). \nhttps:\/\/www.oaic.gov.au\/resources\/privacy-law\/commissioner-initiated-investigation-reports\/ashley-madison.pdf"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-45682-1_33","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"M Bellare","year":"2001","unstructured":"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\u2013582. Springer, Heidelberg (2001). doi:\n10.1007\/3-540-45682-1_33"},{"key":"27_CR15","unstructured":"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)"},{"issue":"6","key":"27_CR16","doi-asserted-by":"publisher","first-page":"1785","DOI":"10.1109\/TNET.2012.2233213","volume":"21","author":"C Joe-Wong","year":"2013","unstructured":"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\u20131798 (2013). doi:\n10.1109\/TNET.2012.2233213","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"27_CR17","doi-asserted-by":"publisher","unstructured":"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\u20139. IEEE (2010). doi:\n10.1109\/INFCOM.2010.5461911","DOI":"10.1109\/INFCOM.2010.5461911"},{"key":"27_CR18","doi-asserted-by":"publisher","unstructured":"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\u201311. IEEE (2009). doi:\n10.1109\/HPCSIM.2009.5192685","DOI":"10.1109\/HPCSIM.2009.5192685"},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1435417.1435432","volume":"52","author":"W Vogels","year":"2009","unstructured":"Vogels, W.: Eventually consistent. Commun. ACM 52(1), 40\u201344 (2009). doi:\n10.1145\/1435417.1435432","journal-title":"Commun. ACM"},{"key":"27_CR20","doi-asserted-by":"publisher","unstructured":"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\u201327. IEEE (2000). doi:\n10.1109\/MASCOT.2000.876425","DOI":"10.1109\/MASCOT.2000.876425"},{"key":"27_CR21","doi-asserted-by":"publisher","unstructured":"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\u201311. IEEE (2008). doi:\n10.1109\/IPDPS.2008.4536239","DOI":"10.1109\/IPDPS.2008.4536239"},{"key":"27_CR22","unstructured":"Zantout, B., Haraty, R.: I2P data communication system. In: Proceedings of ICN, pp. 401\u2013409 (2011)"},{"key":"27_CR23","doi-asserted-by":"publisher","unstructured":"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\u201372. ACM (2011). doi:\n10.1145\/2076732.2076742","DOI":"10.1145\/2076732.2076742"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59870-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T22:22:58Z","timestamp":1496096578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59870-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319598697","9783319598703"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59870-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}