{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:42Z","timestamp":1750307262564,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,2,21]],"date-time":"2011-02-21T00:00:00Z","timestamp":1298246400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,2,21]]},"DOI":"10.1145\/1943513.1943529","type":"proceedings-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T18:31:03Z","timestamp":1297794663000},"page":"109-120","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Implementation and performance evaluation of privacy-preserving fair reconciliation protocols on ordered sets"],"prefix":"10.1145","author":[{"given":"Daniel A.","family":"Mayer","sequence":"first","affiliation":[{"name":"Stevens Institute of Technology, Hoboken, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominik","family":"Teubert","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susanne","family":"Wetzel","sequence":"additional","affiliation":[{"name":"Stevens Institute of Technology, Hoboken, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrike","family":"Meyer","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,2,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"An Open-Source iPhone Calendar. http:\/\/github.com\/klazuka\/Kal\/.  An Open-Source iPhone Calendar. http:\/\/github.com\/klazuka\/Kal\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Android API: java.security reference. http:\/\/developer.android.com\/reference\/java\/security\/package-summary.html.  Android API: java.security reference. http:\/\/developer.android.com\/reference\/java\/security\/package-summary.html."},{"key":"e_1_3_2_1_3_1","unstructured":"FLINT\n  : Fast Library for Number Theory. http:\/\/flintlib.org\/.  FLINT: Fast Library for Number Theory. http:\/\/flintlib.org\/."},{"key":"e_1_3_2_1_4_1","unstructured":"GNU Multiple Precision Arithmetic Library. http:\/\/gmplib.org\/.  GNU Multiple Precision Arithmetic Library. http:\/\/gmplib.org\/."},{"key":"e_1_3_2_1_5_1","unstructured":"iPhone API: Certificate Key and Trust Services API. http:\/\/developer.apple.com\/library\/ios\/#documentation\/Security\/Reference\/certifkeytrustservices\/Reference\/.  iPhone API: Certificate Key and Trust Services API. http:\/\/developer.apple.com\/library\/ios\/#documentation\/Security\/Reference\/certifkeytrustservices\/Reference\/."},{"key":"e_1_3_2_1_6_1","unstructured":"iPhone Human Interface Guidelines. http:\/\/developer.apple.com\/library\/ios\/#documentation\/UserExperience\/Conceptual\/MobileHIG\/Introduction\/Introduction.html.  iPhone Human Interface Guidelines. http:\/\/developer.apple.com\/library\/ios\/#documentation\/UserExperience\/Conceptual\/MobileHIG\/Introduction\/Introduction.html."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03549-4_20"},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/11889663_10","volume-title":"Financial Crypto. and Data Security","author":"Bogetoft P.","year":"2006","unstructured":"P. Bogetoft , I. Damg\u00e5rd , T. Jakobsen , K. Nielsen , J. Pagter , and T. Toft . A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation . In Financial Crypto. and Data Security , volume 4107 of LNCS , pages 142 -- 147 . Springer , 2006 . 10.1007\/11889663_10 P. Bogetoft, I. Damg\u00e5rd, T. Jakobsen, K. Nielsen, J. Pagter, and T. Toft. A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. In Financial Crypto. and Data Security, volume 4107 of LNCS, pages 142--147. Springer, 2006. 10.1007\/11889663_10"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1700527.1700744"},{"key":"e_1_3_2_1_11_1","volume-title":"to Algorithms","author":"Cormen T. H.","year":"2010","unstructured":"T. H. Cormen , C. E. Leiserson , R. R. L. , and C. Stein . Intro . to Algorithms . MIT Press , third edition, 2010 . T. H. Cormen, C. E. Leiserson, R. R. L., and C. Stein. Intro. to Algorithms. MIT Press, third edition, 2010."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03168-7_10"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01957-9_8"},{"key":"e_1_3_2_1_14_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/978-3-642-14577-3_13","volume-title":"Financial Cryptography'10","author":"De Cristofaro E.","year":"2010","unstructured":"E. De Cristofaro and G. Tsudik . Practical Private Set Intersection Protocols with Linear Complexity . In Financial Cryptography'10 , volume 6052 of LNCS , pages 143 -- 159 , 2010 . 10.1007\/978-3-642-14577-3_13 E. De Cristofaro and G. Tsudik. Practical Private Set Intersection Protocols with Linear Complexity. In Financial Cryptography'10, volume 6052 of LNCS, pages 143--159, 2010. 10.1007\/978-3-642-14577-3_13"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2010.13"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"O. Goldreich. Foundations of Cryptography volume 2. Cambridge University Press 2004.   O. Goldreich. Foundations of Cryptography volume 2. Cambridge University Press 2004.","DOI":"10.1017\/CBO9780511721656"},{"key":"e_1_3_2_1_18_1","volume-title":"Probabilistic Encryption. JCSS, 28(2):270--299","author":"Goldwasser S.","year":"1984","unstructured":"S. Goldwasser and S. Micali . Probabilistic Encryption. JCSS, 28(2):270--299 , 1984 . S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS, 28(2):270--299, 1984."},{"key":"e_1_3_2_1_19_1","volume-title":"Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. Journal of Cryptology, 23(3):1--35","author":"Hazay C.","year":"2008","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):1--35 , 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):1--35, 2008."},{"key":"e_1_3_2_1_20_1","series-title":"LNCS","first-page":"312","volume-title":"PKC'10","author":"Hazay C.","year":"2010","unstructured":"C. Hazay and K. Nissim . Efficient Set Operations in the Presence of Malicious Adversaries . In PKC'10 , volume 6056 of LNCS , pages 312 -- 331 . Springer , 2010 . 10.1007\/978-3-642-13013-7_19 C. Hazay and K. Nissim. Efficient Set Operations in the Presence of Malicious Adversaries. In PKC'10, volume 6056 of LNCS, pages 312--331. Springer, 2010. 10.1007\/978-3-642-13013-7_19"},{"key":"e_1_3_2_1_21_1","volume-title":"The TCP\/IP Guide","author":"Kozierok C. M.","year":"2005","unstructured":"C. M. Kozierok . The TCP\/IP Guide . No Starch Press, 2005 . C. M. Kozierok. The TCP\/IP Guide. No Starch Press, 2005."},{"key":"e_1_3_2_1_22_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/978-3-540-85855-3_2","volume-title":"Security and Cryptography for Networks","author":"Lindell Y.","year":"2008","unstructured":"Y. Lindell , B. Pinkas , and N. Smart . Implementing Two-Party Computation Efficiently With Security Against Malicious Adversaries . In Security and Cryptography for Networks , volume 5229 of LNCS , pages 2 -- 20 . Springer , 2008 . 10.1007\/978-3-540-85855-3_2 Y. Lindell, B. Pinkas, and N. Smart. Implementing Two-Party Computation Efficiently With Security Against Malicious Adversaries. In Security and Cryptography for Networks, volume 5229 of LNCS, pages 2--20. Springer, 2008. 10.1007\/978-3-540-85855-3_2"},{"key":"e_1_3_2_1_23_1","first-page":"20","volume-title":"Fairplay - A Secure Two-Party Computation System. In USENIX Security Symposium-Volume 13","author":"Malkhi D.","unstructured":"D. Malkhi , N. Nisan , B. Pinkas , and Y. Sella . Fairplay - A Secure Two-Party Computation System. In USENIX Security Symposium-Volume 13 , page 20 . USENIX Association, 2004. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - A Secure Two-Party Computation System. In USENIX Security Symposium-Volume 13, page 20. USENIX Association, 2004."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.226"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1125451.1125786"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84996-113-4_11"},{"key":"e_1_3_2_1_28_1","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT'99","author":"Paillier P.","year":"1999","unstructured":"P. Paillier . Public-key Cryptosystems Based on Composite Degree Residuosity Classes . In Advances in Cryptology - EUROCRYPT'99 , volume 1592 of LNCS , pages 223 -- 238 . Springer , 1999 . P. Paillier. Public-key Cryptosystems Based on Composite Degree Residuosity Classes. In Advances in Cryptology - EUROCRYPT'99, volume 1592 of LNCS, pages 223--238. Springer, 1999."},{"key":"e_1_3_2_1_29_1","volume-title":"Addressing, Routing and Security Issues in the Next Generation Internet","author":"Pan J.","year":"2009","unstructured":"J. Pan , R. Jain , M. Bowman , X. Xu , S. Chen , and C. BUPT. Enhanced MILSA Architecture for Naming , Addressing, Routing and Security Issues in the Next Generation Internet . In IEEE ICC , 2009 . J. Pan, R. Jain, M. Bowman, X. Xu, S. Chen, and C. BUPT. Enhanced MILSA Architecture for Naming, Addressing, Routing and Security Issues in the Next Generation Internet. In IEEE ICC, 2009."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"e_1_3_2_1_31_1","volume-title":"Schnelle Multiplikation Grosser Zahlen. Computing, 7(3):281--292","author":"Sch\u00f6nhage A.","year":"1971","unstructured":"A. Sch\u00f6nhage and V. Strassen . Schnelle Multiplikation Grosser Zahlen. Computing, 7(3):281--292 , 1971 . A. Sch\u00f6nhage and V. Strassen. Schnelle Multiplikation Grosser Zahlen. Computing, 7(3):281--292, 1971."},{"key":"e_1_3_2_1_32_1","volume-title":"HotNets-VIII. ACM","author":"Seehra A.","year":"2009","unstructured":"A. Seehra , J. Naous , M. Walfish , D. Mazieres , A. Nicolosi , and S. Shenker . A Policy Framework for the Future Internet . In HotNets-VIII. ACM , 2009 . A. Seehra, J. Naous, M. Walfish, D. Mazieres, A. Nicolosi, and S. Shenker. A Policy Framework for the Future Internet. In HotNets-VIII. ACM, 2009."},{"key":"e_1_3_2_1_33_1","volume-title":"Modern Computer Algebra","author":"Von Zur Gathen J.","year":"2003","unstructured":"J. Von Zur Gathen and J. Gerhard . Modern Computer Algebra . Cambridge University Press , 2 edition, 2003 . J. Von Zur Gathen and J. Gerhard. Modern Computer Algebra. Cambridge University Press, 2 edition, 2003."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/POLICY.2007.32"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"}],"event":{"name":"CODASPY '11: First ACM Conference on Data and Application Security and Privacy","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"San Antonio TX USA","acronym":"CODASPY '11"},"container-title":["Proceedings of the first ACM conference on Data and application security and privacy"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1943513.1943529","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1943513.1943529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:39Z","timestamp":1750243959000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1943513.1943529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,21]]},"references-count":34,"alternative-id":["10.1145\/1943513.1943529","10.1145\/1943513"],"URL":"https:\/\/doi.org\/10.1145\/1943513.1943529","relation":{},"subject":[],"published":{"date-parts":[[2011,2,21]]},"assertion":[{"value":"2011-02-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}