{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T15:40:02Z","timestamp":1748706002480,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662487969"},{"type":"electronic","value":"9783662487976"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48797-6_30","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T05:09:27Z","timestamp":1448514567000},"page":"736-757","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Secure Computation from Millionaire"],"prefix":"10.1007","author":[{"given":"Abhi","family":"Shelat","sequence":"first","affiliation":[]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,8]]},"reference":[{"issue":"3","key":"30_CR1","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00145-010-9059-9","volume":"23","author":"G Aggarwal","year":"2010","unstructured":"Aggarwal, G., Mishra, N., Pinkas, B.: Secure computation of the median (and other elements of specified ranks). J. Cryptology 23(3), 373\u2013401 (2010)","journal-title":"J. Cryptology"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y Aumann","year":"2010","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptology 23, 281\u2013343 (2010)","journal-title":"J. Cryptology"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. In: IEEE Conference on Computational Complexity, pp. 194\u2013203 (2002)","DOI":"10.1109\/CCC.2002.1004355"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: a system for secure multi-party computation. In: ACM Conference on Computer and Communications Security (2008)","DOI":"10.1145\/1455770.1455804"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Chiesa, A., Tromer, E.: From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, 8\u201310 January 2012, pp. 326\u2013349 (2012)","DOI":"10.1145\/2090236.2090263"},{"key":"30_CR6","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":"30_CR7","unstructured":"Chung, K.-M., Liu, Z., Pass, R.: Statistically-secure oram with $$\\tilde{O}(\\log ^2 n) $$ overhead (2013). arXiv preprint arXiv:1307.3699"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-69407-6_21","volume-title":"Logic and Theory of Algorithms","author":"G Crescenzo Di","year":"2008","unstructured":"Di Crescenzo, G., Lipmaa, H.: Succinct NP proofs from an extractability assumption. In: Beckmann, A., Dimitracopoulos, C., L\u00f6we, B. (eds.) CiE 2008. LNCS, vol. 5028, pp. 175\u2013185. Springer, Heidelberg (2008)"},{"key":"30_CR9","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: CCS, pp. 513\u2013524 (2012)","DOI":"10.1145\/2382196.2382251"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Shen, C.H., Shelat, A.: Fast two-party secure computation with minimal assumptions. In: ACM CCS 2013 (2012)","DOI":"10.1145\/2508859.2516698"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: USENIX Security Symposium (2011)","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"30_CR12","unstructured":"Keller, M. Scholl, P.: Efficient, oblivious data structures for MPC. Cryptology ePrint Archive, Report 2014\/137 (2014). http:\/\/eprint.iacr.org\/"},{"key":"30_CR13","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4400-4","volume-title":"Design and Analysis of Algorithms","author":"DC Kozen","year":"1992","unstructured":"Kozen, D.C.: Design and Analysis of Algorithms. Texts and Monographs in Computer Science. Springer, New York (1992)"},{"key":"30_CR14","unstructured":"Kreuter, B., Mood, B., Shelat, A., Butler, K.: PCF: a portable circuit format for scalable two-party secure computation. In: USENIX Security Symposium (2013)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Kreuter, B., Shelat, A., Shen, C.H.: Billion-gate secure computation with malicious adversaries. In: USENIX Security Symposium (2012)","DOI":"10.1007\/978-3-642-20465-4_22"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Liu, C., Huang, Y., Shi, E., Katz, J., Hicks, M.: Automating efficient ram-model secure computation. In: IEEE S & P (2014)","DOI":"10.1109\/SP.2014.46"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"MacKenzie, P., Oprea, A., Reiter, M.: Automatic generation of two-party computations. In: ACM Conference on Computer and Communications Security (2003)","DOI":"10.1145\/948138.948139"},{"key":"30_CR18","unstructured":"Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay: a secure two-party computation system. In: USENIX Security (2004)"},{"issue":"4","key":"30_CR19","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S Micali","year":"2000","unstructured":"Micali, S.: Computationally sound proofs. SIAM J. Comput. 30(4), 1253\u20131298 (2000)","journal-title":"SIAM J. Comput."},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Shoup, V.: Private information storage. In: STOC 1997, pp. 294\u2013303 (1997)","DOI":"10.1145\/258533.258606"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Rastogi, A., Hammer, M.A., Hicks, M.: Wysteria: a programming language for generic, mixed-mode multiparty computations. In: IEEE S & P (2014)","DOI":"10.1109\/SP.2014.48"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-642-25385-0_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"E Shi","year":"2011","unstructured":"Shi, E., Chan, T.-H.H., Stefanov, E., Li, M.: Oblivious RAM with O((logN) $$^{3})$$ worst-case cost. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 197\u2013214. Springer, Heidelberg (2011)"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Stefanov, E., van Dijk, M., Shi, E., Fletcher, C., Ren, L., Yu, X., Devadas, S.: Path ORAM: an extremely simple oblivious ram protocol. In: CCS (2013)","DOI":"10.1145\/2508859.2516660"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Wang, X.S., Huang, Y., Hubert Chan, T-H., Shelat, A., Shi, E.: Scoram: Oblivious ram for secure computation. In: CCS 2014 (2014)","DOI":"10.1145\/2660267.2660365"},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets. In: FOCS (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology -- ASIACRYPT 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48797-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T15:12:49Z","timestamp":1748704369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48797-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662487969","9783662487976"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48797-6_30","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":"8 January 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}