{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T12:57:54Z","timestamp":1725627474334},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,2]]},"DOI":"10.1145\/2414456.2414482","type":"proceedings-article","created":{"date-parts":[[2012,12,17]],"date-time":"2012-12-17T15:12:21Z","timestamp":1355757141000},"page":"46-47","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Verifiable private equality test"],"prefix":"10.1145","author":[{"given":"Daniel A.","family":"Mayer","sequence":"first","affiliation":[{"name":"Stevens Institute of Technology, Hoboken, New Jersey"}]},{"given":"Susanne","family":"Wetzel","sequence":"additional","affiliation":[{"name":"Stevens Institute of Technology, Hoboken, New Jersey"}]}],"member":"320","published-online":{"date-parts":[[2012,5,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1391239"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872771"},{"volume-title":"A Fair and Efficient Solution to the Socialist Millionaires Problem. Discrete Applied Mathematics, 111(1--2): 23--36","year":"2001","author":"Boudot F.","key":"e_1_3_2_1_3_1","unstructured":"F. Boudot , B. Schoenmakers , and J. Traore . A Fair and Efficient Solution to the Socialist Millionaires Problem. Discrete Applied Mathematics, 111(1--2): 23--36 , 2001 . F. Boudot, B. Schoenmakers, and J. Traore. A Fair and Efficient Solution to the Socialist Millionaires Problem. Discrete Applied Mathematics, 111(1--2): 23--36, 2001."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01957-9_8"},{"key":"e_1_3_2_1_5_1","series-title":"LNCS","first-page":"213","volume-title":"Advances in Cryptology (ASIACRYPT)","author":"De Cristofaro E.","year":"2010","unstructured":"E. De Cristofaro , J. Kim , and G. Tsudik . Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model . In Advances in Cryptology (ASIACRYPT) , volume 6477 of LNCS , pages 213 -- 231 . Springer Berlin\/Heidelberg , 2010 . E. De Cristofaro, J. Kim, and G. Tsudik. Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model. In Advances in Cryptology (ASIACRYPT), volume 6477 of LNCS, pages 213--231. Springer Berlin\/Heidelberg, 2010."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/229459.229469"},{"key":"e_1_3_2_1_8_1","series-title":"LNCS","first-page":"1","volume-title":"Advances in Cryptology (EUROCRYPT)","author":"Freedman M.","year":"2004","unstructured":"M. Freedman , K. Nissim , and B. Pinkas . Efficient Private Matching and Set Intersection . In Advances in Cryptology (EUROCRYPT) , volume 3027 of LNCS , pages 1 -- 19 . Springer , 2004 . M. Freedman, K. Nissim, and B. Pinkas. Efficient Private Matching and Set Intersection. In Advances in Cryptology (EUROCRYPT), volume 3027 of LNCS, pages 1--19. Springer, 2004."},{"volume-title":"Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. Journal of Cryptology, 23(3): 422--456","year":"2008","author":"Hazay C.","key":"e_1_3_2_1_9_1","unstructured":"C. Hazay and Y. Lindell . Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. Journal of Cryptology, 23(3): 422--456 , 2008 . C. Hazay and Y. Lindell. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. Journal of Cryptology, 23(3): 422--456, 2008."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_19"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJICS.2008.022488"},{"volume-title":"Enabling Fair and Privacy-Preserving Applications Using Reconciliation Protocols on Ordered Sets. In Sarnoff Symposium. IEEE","year":"2011","author":"Mayer D. A.","key":"e_1_3_2_1_13_1","unstructured":"D. A. Mayer , G. Neugebauer , U. Meyer , and S. Wetzel . Enabling Fair and Privacy-Preserving Applications Using Reconciliation Protocols on Ordered Sets. In Sarnoff Symposium. IEEE , 2011 . D. A. Mayer, G. Neugebauer, U. Meyer, and S. Wetzel. Enabling Fair and Privacy-Preserving Applications Using Reconciliation Protocols on Ordered Sets. In Sarnoff Symposium. IEEE, 2011."},{"key":"e_1_3_2_1_14_1","first-page":"1342","volume-title":"Distributed Privacy-Preserving Policy Reconciliation. In IEEE International Conference on Communications (ICC)","author":"Meyer U.","year":"2007","unstructured":"U. Meyer , S. Wetzel , and S. Ioannidis . Distributed Privacy-Preserving Policy Reconciliation. In IEEE International Conference on Communications (ICC) , pages 1342 -- 1349 . IEEE, 2007 . U. Meyer, S. Wetzel, and S. Ioannidis. Distributed Privacy-Preserving Policy Reconciliation. In IEEE International Conference on Communications (ICC), pages 1342--1349. IEEE, 2007."},{"key":"e_1_3_2_1_16_1","unstructured":"M. Milian. Two Lawsuits Target Apple App Makers Over Privacy Concerns. http:\/\/cnn.com\/2010\/TECH\/mobile\/12\/28\/apple.app.lawsuits\/index.html December 2010. M. Milian. Two Lawsuits Target Apple App Makers Over Privacy Concerns. http:\/\/cnn.com\/2010\/TECH\/mobile\/12\/28\/apple.app.lawsuits\/index.html December 2010."},{"key":"e_1_3_2_1_17_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/978-3-642-17316-5_41","volume-title":"Advanced Data Mining and Applications (ADMA)","author":"Miyaji A.","year":"2010","unstructured":"A. Miyaji and M. Rahman . Privacy-Preserving Data Mining in Presence of Covert Adversaries . In Advanced Data Mining and Applications (ADMA) , volume 6440 of LNCS , pages 429 -- 440 . Springer Berlin\/Heidelberg , 2010 . A. Miyaji and M. Rahman. Privacy-Preserving Data Mining in Presence of Covert Adversaries. In Advanced Data Mining and Applications (ADMA), volume 6440 of LNCS, pages 429--440. Springer Berlin\/Heidelberg, 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301312"},{"key":"e_1_3_2_1_19_1","series-title":"LNCS","first-page":"343","volume-title":"Public Key Cryptography (PKC)","author":"Nishide T.","year":"2007","unstructured":"T. Nishide and K. Ohta . Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol . In Public Key Cryptography (PKC) , volume 4450 of LNCS , pages 343 -- 360 . Springer Berlin\/Heidelberg , 2007 . T. Nishide and K. Ohta. Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol. In Public Key Cryptography (PKC), volume 4450 of LNCS, pages 343--360. Springer Berlin\/Heidelberg, 2007."},{"volume-title":"Facebook Settles FTC Charges Over 2009 Privacy Breaches","year":"2011","author":"Pepitone J.","key":"e_1_3_2_1_20_1","unstructured":"J. Pepitone . Facebook Settles FTC Charges Over 2009 Privacy Breaches , 2011 . J. Pepitone. Facebook Settles FTC Charges Over 2009 Privacy Breaches, 2011."}],"event":{"name":"ASIA CCS '12: 7th ACM Symposium on Information, Compuer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Seoul Korea","acronym":"ASIA CCS '12"},"container-title":["Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2414456.2414482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T16:03:42Z","timestamp":1673107422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2414456.2414482"}},"subtitle":["enabling unbiased 2-party reconciliation on ordered sets in the malicious model"],"short-title":[],"issued":{"date-parts":[[2012,5,2]]},"references-count":19,"alternative-id":["10.1145\/2414456.2414482","10.1145\/2414456"],"URL":"https:\/\/doi.org\/10.1145\/2414456.2414482","relation":{},"subject":[],"published":{"date-parts":[[2012,5,2]]},"assertion":[{"value":"2012-05-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}
