{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:21:37Z","timestamp":1743157297129,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030755386"},{"type":"electronic","value":"9783030755393"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-75539-3_1","type":"book-chapter","created":{"date-parts":[[2021,5,10]],"date-time":"2021-05-10T23:36:24Z","timestamp":1620689784000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Secure Fast Evaluation of Iterative Methods: With an Application to Secure PageRank"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5289-3769","authenticated-orcid":false,"given":"Daniele","family":"Cozzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3567-3304","authenticated-orcid":false,"given":"Nigel P.","family":"Smart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7947-9450","authenticated-orcid":false,"given":"Younes Talibi","family":"Alaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,11]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Milman, V.: Lambda1, isoperimetric inequalities for graphs, and superconcentrators. J. Comb. Theory Series B 38(1), 73\u201388 (1985). http:\/\/www.sciencedirect.com\/science\/article\/pii\/0095895685900929","DOI":"10.1016\/0095-8956(85)90092-9"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF02579166","volume":"6","author":"N Alon","year":"1986","unstructured":"Alon, N.: Eigenvalues and expanders. Combinatorica 6(2), 83\u201396 (1986)","journal-title":"Combinatorica"},{"key":"1_CR3","unstructured":"Aly, A., et al.: SCALE and MAMBA v1.9: Documentation (2020). https:\/\/homes.esat.kuleuven.be\/~nsmart\/SCALE\/Documentation.pdf"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: a framework for fast privacy-preserving computations. Cryptology ePrint Archive, Report 2008\/289 (2008). http:\/\/eprint.iacr.org\/2008\/289","DOI":"10.1007\/978-3-540-88313-5_13"},{"key":"1_CR5","unstructured":"Broder, A., et al.: Graph structure in the web (2000)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-14577-3_6","volume-title":"Financial Cryptography and Data Security","author":"O Catrina","year":"2010","unstructured":"Catrina, O., Saxena, A.: Secure computation with fixed-point numbers. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 35\u201350. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14577-3_6"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-30216-2_10","volume-title":"Algorithms and Models for the Web-Graph","author":"GM Del Corso","year":"2004","unstructured":"Del Corso, G.M., Gull\u00ed, A., Romani, F.: Fast PageRank computation via a sparse linear system (extended abstract). In: Leonardi, S. (ed.) WAW 2004. LNCS, vol. 3243, pp. 118\u2013130. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30216-2_10"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"1_CR9","unstructured":"Daskalakis, C., Tzamos, C., Zampetakis, M.: A converse to Banach\u2019s Fixed Point Theorem and its CLS completeness. CoRR abs\/1702.07339 (2017). http:\/\/arxiv.org\/abs\/1702.07339"},{"key":"1_CR10","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. The Internet Society, February 2015","DOI":"10.14722\/ndss.2015.23113"},{"key":"1_CR11","unstructured":"Dikland, T.: Added value of combining transaction graphs on fraud detection using the PageRank algorithm. Internship Report, TNO and TU Delft (2018)"},{"key":"1_CR12","unstructured":"Elden, L.: A note on the eigenvalues of the Google matrix (2004). http:\/\/arxiv.org\/abs\/math\/0401177"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-319-56614-6_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"J Furukawa","year":"2017","unstructured":"Furukawa, J., Lindell, Y., Nof, A., Weinstein, O.: High-throughput secure three-party computation for malicious adversaries and an honest majority. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 225\u2013255. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_8"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-02774-1_38","volume-title":"Online Communities and Social Computing","author":"Y-S Han","year":"2009","unstructured":"Han, Y.-S., Kim, L., Cha, J.-W.: Evaluation of user reputation on YouTube. In: Ozok, A.A., Zaphiris, P. (eds.) OCSC 2009. LNCS, vol. 5621, pp. 346\u2013353. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02774-1_38"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Hastings, M., Falk, B.H., Tsoukalas, G.: Privacing preserving network analytics (2020). https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3680000","DOI":"10.2139\/ssrn.3680000"},{"key":"1_CR16","unstructured":"Haveliwala, T., Kamvar, S.: The second eigenvalue of the Google matrix. Technical Report 2003-20, Stanford InfoLab (2003). http:\/\/ilpubs.stanford.edu:8090\/582\/"},{"key":"1_CR17","unstructured":"Huynh, T.D.: Extension of PageRank and application to social networks. (Extension de PageRank et application aux r\u00e9seaux sociaux). Ph.D. thesis, Pierre and Marie Curie University, Paris, France (2015). https:\/\/tel.archives-ouvertes.fr\/tel-01187929"},{"key":"1_CR18","unstructured":"Kamm, L., Willemson, J.: Secure floating-point arithmetic and private satellite collision analysis. Cryptology ePrint Archive, Report 2013\/850 (2013). http:\/\/eprint.iacr.org\/2013\/850"},{"key":"1_CR19","unstructured":"Kamvar, S., Haveliwala, T.: The condition number of the PageRank problem. Technical report 2003-36, Stanford InfoLab, June 2003. http:\/\/ilpubs.stanford.edu:8090\/597\/"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-319-98113-0_10","volume-title":"Security and Cryptography for Networks","author":"M Keller","year":"2018","unstructured":"Keller, M., Rotaru, D., Smart, N.P., Wood, T.: Reducing communication channels in MPC. In: Catalano, D., De Prisco, R. (eds.) SCN 2018. LNCS, vol. 11035, pp. 181\u2013199. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98113-0_10"},{"key":"1_CR21","unstructured":"Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Technical report, Department of Mathematics, N. Carolina State University (2003)"},{"key":"1_CR22","unstructured":"Langville, A.N., Meyer, C.D.: Fiddling with PageRank. Technical report, Department of Mathematics, N. Carolina State University (2003)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Langville, A.N., Meyer, C.D.: Survey: Deeper inside PageRank. Internet Math. 1(3), 335\u2013380 (2003). https:\/\/doi.org\/10.1080\/15427951.2004.10129091","DOI":"10.1080\/15427951.2004.10129091"},{"key":"1_CR24","unstructured":"Maxwell, N.: Innovation and discussion paper: case studies of the use of privacy preserving analysis to tackle financial crime. Technical report, Royal United Services Institute (2020). https:\/\/www.future-fis.com\/uploads\/3\/7\/9\/4\/3794525\/ffis_innovation_and_discussion_paper_-_case_studies_of_the_use_of_privacy_preserving_analysis.pdf"},{"key":"1_CR25","unstructured":"Mohassel, P., Rindal, P.: ABY$$^3$$: a mixed protocol framework for machine learning. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 35\u201352. ACM Press, October 2018"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-662-54970-4_2","volume-title":"Financial Cryptography and Data Security","author":"I Molloy","year":"2017","unstructured":"Molloy, I., et al.: Graph analytics for real-time scoring of cross-channel transactional fraud. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 22\u201340. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_2"},{"key":"1_CR27","unstructured":"Moreau, A.: How to perform fraud detection with personalized PageRank, 9 January 2019. Blog: https:\/\/www.sicara.ai\/blog\/2019-01-09-fraud-detection-personalized-page-rank"},{"key":"1_CR28","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. In: Proceedings of the 7th International World Wide Web Conference, pp. 161\u2013172 (1998)"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Riazi, M.S., Weinert, C., Tkachenko, O., Songhori, E.M., Schneider, T., Koushanfar, F.: Chameleon: a hybrid secure computation framework for machine learning applications. In: Kim, J., Ahn, G.J., Kim, S., Kim, Y., L\u00f3pez, J., Kim, T. (eds.) ASIACCS 2018, pp. 707\u2013721. ACM Press, April 2018","DOI":"10.1145\/3196494.3196522"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-030-32101-7_35","volume-title":"Financial Cryptography and Data Security","author":"A Sangers","year":"2019","unstructured":"Sangers, A., et al.: Secure multiparty PageRank algorithm for collaborative fraud detection. In: Goldberg, I., Moore, T. (eds.) FC 2019. LNCS, vol. 11598, pp. 605\u2013623. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32101-7_35"},{"issue":"11","key":"1_CR31","first-page":"612","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979)","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Simi\u0107, S.K., Andeli\u0107, M., da Fonseca, C.M., \u017divkovi\u0107, D.: Notes on the second largest eigenvalue of a graph. Linear Algebra Appl. 465, 262\u2013274 (2015). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S002437951400617X","DOI":"10.1016\/j.laa.2014.09.032"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Soramaki, K., Bech, M.L., Arnold, J., Glass, R.J., Beyeler, W.E.: The topology of interbank payment flows. Physica A: Stat. Mech. Appl. 379(1), 317\u2013333 (2007). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0378437106013124","DOI":"10.1016\/j.physa.2006.11.093"},{"key":"1_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5018\/economics-ejournal.ja.2013-28","volume":"7","author":"K Soramaki","year":"2013","unstructured":"Soramaki, K., Cook, S.: Sinkrank: an algorithm for identifying systemically important banks in payment systems. Economics Open-Access Open-Assess. E-Journal 7, 1\u201327 (2013)","journal-title":"Economics Open-Access Open-Assess. E-Journal"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Vlasselaer, V.V., Eliassi-Rad, T., Akoglu, L., Snoeck, M., Baesens, B.: GOTCHA! network-based fraud detection for social security fraud. Manag. Sci. 63(9), 3090\u20133110 (2017). https:\/\/doi.org\/10.1287\/mnsc.2016.2489","DOI":"10.1287\/mnsc.2016.2489"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-75539-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:05:16Z","timestamp":1710263116000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-75539-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030755386","9783030755393"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-75539-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CT-RSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cryptographers\u2019 Track at the RSA Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ctrsa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/site\/ctrsa2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.25","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}