{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:27:28Z","timestamp":1743046048329,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642384899"},{"type":"electronic","value":"9783642384905"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38490-5_42","type":"book-chapter","created":{"date-parts":[[2013,6,20]],"date-time":"2013-06-20T12:50:35Z","timestamp":1371732635000},"page":"466-477","source":"Crossref","is-referenced-by-count":1,"title":["A Scalable Multi-Party Protocol for Privacy-Preserving Equality Test"],"prefix":"10.1007","author":[{"given":"Maryam","family":"Sepehri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stelvio","family":"Cimato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernesto","family":"Damiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","first-page":"93","volume-title":"Proceedings of the 10th ACM conference on Computer and communications security, CCS 2003","author":"E. Damiani","year":"2003","unstructured":"Damiani, E., Vimercati, S.D.C., Jajodia, S., Paraboschi, S., Samarati, P.: Balancing confidentiality and efficiency in untrusted relational dbmss. In: Proceedings of the 10th ACM conference on Computer and communications security, CCS 2003, pp. 93\u2013102. ACM, New York (2003)"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/564691.564717","volume-title":"Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, SIGMOD 2002","author":"H. Hacig\u00fcm\u00fc\u015f","year":"2002","unstructured":"Hacig\u00fcm\u00fc\u015f, H., Iyer, B., Li, C., Mehrotra, S.: Executing sql over encrypted data in the database-service-provider model. In: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, SIGMOD 2002, pp. 216\u2013227. ACM, New York (2002)"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-70936-7_29","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2007","unstructured":"Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 535\u2013554. Springer, Heidelberg (2007)"},{"key":"42_CR4","first-page":"162","volume-title":"Proceedings of the 27th Annual Symposium on Foundations of Computer Science, SFCS 1986","author":"A.C.C. Yao","year":"1986","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science, SFCS 1986, pp. 162\u2013167. IEEE Computer Society, Washington, DC (1986)"},{"key":"42_CR5","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/28395.28420","volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 218\u2013229. ACM, New York (1987)"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Asonov, D., Li, M.K.: Sovereign joins. In: Proceedings of the 22nd International Conference on Data Engineering (2006)","DOI":"10.1109\/ICDE.2006.144"},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/872757.872771","volume-title":"Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, SIGMOD 2003","author":"R. Agrawal","year":"2003","unstructured":"Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, SIGMOD 2003, pp. 86\u201397. ACM, New York (2003)"},{"key":"42_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L. Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection, pp. 1\u201319. Springer (2004)","DOI":"10.1007\/978-3-540-24676-3_1"},{"issue":"3","key":"42_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y. Lindell","year":"2002","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. J. Cryptology\u00a015(3), 177\u2013206 (2002)","journal-title":"J. Cryptology"},{"issue":"5","key":"42_CR11","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1137\/S0097539704383633","volume":"35","author":"M. Naor","year":"2006","unstructured":"Naor, M., Pinkas, B.: Oblivious polynomial evaluation. SIAM J. Comput.\u00a035(5), 1254\u20131281 (2006)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"42_CR12","first-page":"149","volume":"1","author":"R. Li","year":"2005","unstructured":"Li, R., Wu, C.: Co-operative private equality test. I. J. Network Security\u00a01(3), 149\u2013153 (2005)","journal-title":"I. J. Network Security"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Sang, Y., Shen, H., Tan, Y., Xiong, N.: Efficient protocols for privacy preserving matching against distributed datasets. In: Ning, P., Qing, S., Li, N. (eds.) ICICS 2006. LNCS, vol.\u00a04307, pp. 210\u2013227. Springer, Heidelberg (2006)","DOI":"10.1007\/11935308_15"},{"issue":"4","key":"42_CR14","doi-asserted-by":"crossref","first-page":"593","DOI":"10.3233\/JCS-2005-13401","volume":"13","author":"J. Vaidya","year":"2005","unstructured":"Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. Journal of Computer Security\u00a013(4), 593\u2013622 (2005)","journal-title":"Journal of Computer Security"},{"key":"42_CR15","unstructured":"Damiani, E., De, S., Vimercati, C., Paraboschi, S., Samarati, P.: Computing range queries on obfuscated data. In: Proc. of the Information Processing and Management of Uncertainty in Knowledge-Based Systems (2004)"}],"container-title":["Lecture Notes in Business Information Processing","Advanced Information Systems Engineering Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38490-5_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T13:37:53Z","timestamp":1688305073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38490-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642384899","9783642384905"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38490-5_42","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2013]]}}}