{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T19:16:16Z","timestamp":1762542976850,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T00:00:00Z","timestamp":1546387200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","award":["PD\/BD\/128149\/2016","SFRH\/BPD\/115408\/2016"],"award-info":[{"award-number":["PD\/BD\/128149\/2016","SFRH\/BPD\/115408\/2016"]}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"crossref","award":["NORTE-01-0145-FEDER-000016"],"award-info":[{"award-number":["NORTE-01-0145-FEDER-000016"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["NORTE-01-0145-FEDER-000016"],"award-info":[{"award-number":["NORTE-01-0145-FEDER-000016"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10207-018-0424-2","type":"journal-article","created":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T06:09:58Z","timestamp":1546409398000},"page":"505-518","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Breaking MPC implementations through compression"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0125-4240","authenticated-orcid":false,"given":"Jo\u00e3o S.","family":"Resende","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0268-9134","authenticated-orcid":false,"given":"Patr\u00edcia R.","family":"Sousa","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1838-1417","authenticated-orcid":false,"given":"Rolando","family":"Martins","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9988-594X","authenticated-orcid":false,"given":"Lu\u00eds","family":"Antunes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,2]]},"reference":[{"key":"424_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, R.: Why cryptosystems fail. In: Proceedings of the 1st ACM Conference on Computer and Communications Security. ACM (1993)","DOI":"10.1145\/168588.168615"},{"key":"424_CR2","doi-asserted-by":"crossref","unstructured":"Acar, Y., et al.: Comparing the usability of cryptographic APIs. In: Proceedings of the 38th IEEE Symposium on Security and Privacy (2017)","DOI":"10.1109\/SP.2017.52"},{"key":"424_CR3","doi-asserted-by":"crossref","unstructured":"Georgiev, M., et al.: The most dangerous code in the world: validating SSL certificates in non-browser software. In: Proceedings of the 2012 ACM conference on Computer and communications security. ACM (2012)","DOI":"10.1145\/2382196.2382204"},{"key":"424_CR4","unstructured":"Reaves, B., et al.: Mo (bile) money, Mo (bile) problems: analysis of branchless banking applications in the developing world. In: USENIX Security Symposium (2015)"},{"key":"424_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-57639-8_4","volume-title":"Fog Computing in the Internet of Things","author":"PR Sousa","year":"2018","unstructured":"Sousa, P.R., Antunes, L., Martins, R.: The present and future of privacy-preserving computation in fog computing. In: Rahmani, A., Liljeberg, P., Preden, J.-S., Jantsch, A. (eds.) Fog Computing in the Internet of Things, pp. 51\u201369. Springer, Berlin (2018)"},{"key":"424_CR6","doi-asserted-by":"crossref","unstructured":"Back, A., Moller, U., Stiglic, A.: Traffic analysis attacks and trade-offs in anonymity providing systems. In: Information Hiding, vol. 2137 (2001)","DOI":"10.1007\/3-540-45496-9_18"},{"issue":"4","key":"424_CR7","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R Cilibrasi","year":"2005","unstructured":"Cilibrasi, R., Paul, M.B.V.: Clustering by compression. IEEE Trans. Inf. Theory 51(4), 1523\u20131545 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"424_CR8","doi-asserted-by":"publisher","first-page":"303","DOI":"10.3233\/JCS-2007-15301","volume":"15","author":"S Wehner","year":"2007","unstructured":"Wehner, S.: Analyzing worms and network traffic using compression. J. Comput. Secur. 15(3), 303\u2013320 (2007)","journal-title":"J. Comput. Secur."},{"key":"424_CR9","unstructured":"Santos, C.C., et al.: Clustering fetal heart rate tracings by compression. In: 19th IEEE International Symposium on Computer-Based Medical Systems. CBMS 2006. IEEE (2006)"},{"key":"424_CR10","doi-asserted-by":"crossref","unstructured":"Damgrd, I., et al.: Practical covertly secure MPC for dishonest majority or: breaking the SPDZ limits. In: European Symposium on Research in Computer Security. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"424_CR11","doi-asserted-by":"crossref","unstructured":"Demmler, D., Schneider, T., Zohner, M.: ABY-a framework for efficient mixed-protocol secure two-party computation. In: NDSS (2015)","DOI":"10.14722\/ndss.2015.23113"},{"key":"424_CR12","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., et al.: Efficient batched oblivious PRF with applications to private set intersection. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. ACM (2016)","DOI":"10.1145\/2976749.2978381"},{"key":"424_CR13","unstructured":"Frederiksen, T.K., et al.: TinyLEGO: an interactive garbling scheme for maliciously secure two-party computation. IACR Cryptology ePrint Archive 2015\/309 (2015)"},{"key":"424_CR14","unstructured":"Kolesnikov, V., et al.: DUPLO: unifying cut-and-choose for garbled circuits. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security. ACM, 2017"},{"key":"424_CR15","unstructured":"Multiparty Computation with SPDZ Online Phase and MASCOT Offline Phase. \n                    https:\/\/github.com\/bristolcrypto\/SPDZ-2\n                    \n                  . Accessed 11 Sept 2017"},{"key":"424_CR16","doi-asserted-by":"crossref","unstructured":"Orlandi, C.: Is multiparty computation any good in practice? In: 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE (2011)","DOI":"10.1109\/ICASSP.2011.5947691"},{"key":"424_CR17","unstructured":"Cilibrasi, R., Cruz, A.L., de Rooij, S., Keijzer, M.: Complearn. \n                    http:\/\/www.complearn.org\n                    \n                  . Accessed 09 Jan 2017"},{"issue":"4","key":"424_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s11416-015-0260-0","volume":"12","author":"RS Borbely","year":"2016","unstructured":"Borbely, R.S.: On normalized compression distance and large malware. J. Comput. Virol. Hacking Tech. 12(4), 235\u2013242 (2016)","journal-title":"J. Comput. Virol. Hacking Tech."},{"issue":"12","key":"424_CR19","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/TIT.2004.838101","volume":"50","author":"M Li","year":"2004","unstructured":"Li, M., et al.: The similarity metric. IEEE Trans. Inf. Theory 50(12), 3250\u20133264 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"424_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: 23rd Annual Symposium on Foundations of Computer Science, SFCS\u201908. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"424_CR21","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"424_CR22","doi-asserted-by":"crossref","unstructured":"Yao, A.C. Theory and application of trapdoor functions. In: 23rd Annual Symposium on Foundations of Computer Science, SFCS\u201908. IEEE (1982)","DOI":"10.1109\/SFCS.1982.45"},{"key":"424_CR23","doi-asserted-by":"crossref","unstructured":"Araki, T., et al.: High-throughput semi-honest secure three-party computation with an honest majority. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. ACM (2016)","DOI":"10.1145\/2976749.2978331"},{"key":"424_CR24","unstructured":"Theory and Practice of Multi-party Computation Workshops. \n                    http:\/\/www.multipartycomputation.com\/mpc-software\n                    \n                  . Accessed 11 Sept 2017"},{"key":"424_CR25","unstructured":"The Richest People in Tech. \n                    https:\/\/www.forbes.com\/richest-in-tech\/list\/\n                    \n                  . Accessed 11 Sept 2017"},{"key":"424_CR26","unstructured":"ABY: A Framework for Efficient Mixed-protocol Secure Two-party Computation. \n                    https:\/\/github.com\/encryptogroup\/ABY\n                    \n                   (2015)"},{"key":"424_CR27","unstructured":"A C++ Implementation of the TinyLEGO Cryptographic Protocol [NST17] for General Secure Two-party Computation. \n                    https:\/\/github.com\/AarhusCrypto\/TinyLEGO\n                    \n                   (2016)"},{"key":"424_CR28","unstructured":"Circuits of Basic Functions Suitable for MPC and FHE. \n                    https:\/\/www.cs.bris.ac.uk\/Research\/CryptographySecurity\/MPC\/\n                    \n                  . Accessed 11 Sept 2017"},{"key":"424_CR29","unstructured":"A C++ implementation of the DUPLO cryptographic protocol. \n                    https:\/\/github.com\/AarhusCrypto\/DUPLO\n                    \n                  . Accessed 11 Sept 2017"},{"key":"424_CR30","unstructured":"Souto, A.: Traffic analysis based on compression. In: Proc Confer\n                    \n                      \n                    \n                    $$\\hat{e}$$\n                    \n                      \n                        \n                          e\n                          ^\n                        \n                      \n                    \n                  ncia sobre Redes de Computadores CRC\u201915, \u00c9vora, Portugal, Vol. 1, pp. 1\u20137, November 2015"},{"key":"424_CR31","unstructured":"Entropy (Information Theory). \n                    http:\/\/www.basicknowledge101.com\/pdf\/km\/Entropy%20(information%20theory).pdf\n                    \n                  . Accessed 11 Sept 2017"},{"issue":"4","key":"424_CR32","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF01619355","volume":"7","author":"SM Pincus","year":"1991","unstructured":"Pincus, S.M., Gladstone, I.M., Ehrenkranz, R.A.: A regularity statistic for medical data analysis. J. Clin. Monit. Comput. 7(4), 335\u2013345 (1991)","journal-title":"J. Clin. Monit. Comput."}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-018-0424-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-018-0424-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-018-0424-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T17:08:19Z","timestamp":1589994499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-018-0424-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,2]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["424"],"URL":"https:\/\/doi.org\/10.1007\/s10207-018-0424-2","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2019,1,2]]},"assertion":[{"value":"2 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}