{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T07:54:43Z","timestamp":1762761283282,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319159423"},{"type":"electronic","value":"9783319159430"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15943-0_13","type":"book-chapter","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T10:27:17Z","timestamp":1426501637000},"page":"205-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Securely Solving Classical Network Flow Problems"],"prefix":"10.1007","author":[{"given":"Abdelrahaman","family":"Aly","sequence":"first","affiliation":[]},{"given":"Mathieu","family":"Van Vyve","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,17]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Protocols for secure computations (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, pp. 160\u2013164. IEEE (1982)","DOI":"10.1109\/SFCS.1982.38"},{"issue":"11","key":"13_CR2","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-Key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 223. Springer, Heidelberg (1999)"},{"key":"13_CR4","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall Inc., Upper Saddle River (1993)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-39884-1_21","volume-title":"Financial Cryptography and Data Security","author":"A Aly","year":"2013","unstructured":"Aly, A., Cuvelier, E., Mawet, S., Pereira, O., Van Vyve, M.: Securely solving simple combinatorial graph problems. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 239\u2013257. Springer, Heidelberg (2013)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Launchbury, J., Diatchki, I.S., DuBuisson, T., Adams-Moran, A.:Efficient lookup-table protocol in secure multiparty computation. In: Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming, ICFP 2012, pp. 189\u2013200. ACM, New York (2012)","DOI":"10.1145\/2364527.2364556"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/11593447_13","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"J Brickell","year":"2005","unstructured":"Brickell, J., Shmatikov, V.: Privacy-preserving graph algorithms in the semi-honest model. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 236\u2013252. Springer, Heidelberg (2005)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Blanton, M., Steele, A., Alisagari, M.: Data-oblivious graph algorithms for secure computation and outsourcing. In: Proceedings of the 8th ACM SIGSAC Symposium on Information, Computer and Communications Security, ASIA CCS 2013, pp. 207\u2013218. ACM, New York (2013)","DOI":"10.1145\/2484313.2484341"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Wang, X., Nayak, K., Liu, C., Shi, E., Stefanov, E., Huang, Y.: Oblivious data structures. Cryptology ePrint Archive, Report 2014\/185 (2014). http:\/\/eprint.iacr.org\/","DOI":"10.1145\/2660267.2660314"},{"key":"13_CR10","unstructured":"Lu, S., Ostrovsky, R.: Distributed oblivious ram for secure two-party computation. Cryptology ePrint Archive, Report 2011\/384 (2011). http:\/\/eprint.iacr.org\/"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Katz, J., Kolesnikov, V., Krell, F., Malkin, T., Raykova, M., Vahlis, Y.: Secure two-party computation in sublinear (amortized) time. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, CCS 2012, pp. 513\u2013524. ACM, New York (2012)","DOI":"10.1145\/2382196.2382251"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Liu, C., Huang, Y., Shi, E., Katz, J., Hicks, M.: Automating efficient ram-model secure computation. In: 35th IEEE Symposium on Security and Privacy (2014)","DOI":"10.1109\/SP.2014.46"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Keller, M., Scholl, P.: Efficient, oblivious data structures for mpc. IACR Cryptology ePrint Archive, 137 (2014)","DOI":"10.1007\/978-3-662-45608-8_27"},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.dam.2005.03.020","volume":"154","author":"U Maurer","year":"2006","unstructured":"Maurer, U.: Secure multi-party computation made simple. Discrete Appl. Math. 154(2), 370\u2013381 (2006). Coding and Cryptography","journal-title":"Discrete Appl. Math."},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-45146-4_15","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"IB Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I.B., Nielsen, J.B.: Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 247\u2013264. Springer, Heidelberg (2003)"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/76359.76368","volume":"4","author":"AV Goldberg","year":"1989","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. J. ACM 4, 873\u2013886 (1989)","journal-title":"J. ACM"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0012-365X(78)90078-X","volume":"3","author":"RM Karp","year":"1978","unstructured":"Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Math. 3, 309\u2013311 (1978)","journal-title":"Discrete Math."},{"issue":"3","key":"13_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1287\/mnsc.14.3.205","volume":"14","author":"M Klein","year":"1967","unstructured":"Klein, M.: A primal method for minimal cost flows with applications to the assignment and transportation problems. Manag. Sci. 14(3), 205\u2013220 (1967)","journal-title":"Manag. Sci."},{"key":"13_CR19","series-title":"International Series in Pure and Applied Mathematics","volume-title":"Finite Graphs and Networks: An Introduction with Applications","author":"R Busacker","year":"1965","unstructured":"Busacker, R., Saaty, T.: Finite Graphs and Networks: An Introduction with Applications. International Series in Pure and Applied Mathematics. McGraw-Hill, New York (1965)"},{"key":"13_CR20","unstructured":"Geisler, M.: Cryptographic protocols: theory and implementation. Ph.D. thesis, Aarhus University Denmark, Department of Computer Science (2010)"},{"key":"13_CR21","unstructured":"Toft, T.: Primitives and applications for multi-party computation. Ph.D. thesis, Department of Computer Science, Aarhus University (2007)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15943-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T22:47:07Z","timestamp":1676933227000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15943-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319159423","9783319159430"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15943-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}