{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:22:14Z","timestamp":1744755734737,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926403"},{"type":"electronic","value":"9783030926410"}],"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-92641-0_14","type":"book-chapter","created":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T08:03:33Z","timestamp":1639469013000},"page":"289-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Secure Multiparty Computation in the Bounded Storage Model"],"prefix":"10.1007","author":[{"given":"Jiahui","family":"Liu","sequence":"first","affiliation":[]},{"given":"Satyanarayana","family":"Vusirikala","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,15]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1109\/TIT.2002.1003845","volume":"48","author":"Y Aumann","year":"2002","unstructured":"Aumann, Y., Ding, Y.Z., Rabin, M.O.: Everlasting security in the bounded storage model. IEEE Trans, Inf. Theory 48, 668\u20131680 (2002)","journal-title":"IEEE Trans, Inf. Theory"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-48405-1_5","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"Y Aumann","year":"1999","unstructured":"Aumann, Y., Rabin, M.O.: Information theoretically secure communication in the limited storage space model. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 65\u201379. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_5"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0052243","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"C Cachin","year":"1997","unstructured":"Cachin, C., Maurer, U.: Unconditional security against memory-bounded adversaries. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 292\u2013306. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052243"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45841-7_1","volume-title":"STACS 2002","author":"YZ Ding","year":"2002","unstructured":"Ding, Y.Z., Rabin, M.O.: Hyper-encryption and everlasting security. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 1\u201326. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45841-7_1"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Dowsley, R., Lacerda, F., Nascimento, A.C.A.: Oblivious transfer in the bounded storage model with errors. In: IEEE International Symposium on Information Theory (2014)","DOI":"10.1109\/ISIT.2014.6875108"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Maurer, U.: Tight security proofs for the bounded-storage model. In: STOC, pp. 341\u2013350 (2002)","DOI":"10.1145\/509907.509960"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-24676-3_8","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"S Dziembowski","year":"2004","unstructured":"Dziembowski, S., Maurer, U.: On generating the initial key in the bounded-storage model. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 126\u2013137. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_8"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, STOC 1989, pp. 25\u201332. Association for Computing Machinery, New York (1989). https:\/\/doi.org\/10.1145\/73007.73010","DOI":"10.1145\/73007.73010"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC 1987 (1987)","DOI":"10.1145\/28395.28420"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC (1996)","DOI":"10.1145\/237814.237866"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-030-17659-4_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"J Guan","year":"2019","unstructured":"Guan, J., Zhandary, M.: Simple schemes in the bounded storage model. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part III. LNCS, vol. 11478, pp. 500\u2013524. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_17"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/11787006_17","volume-title":"Automata, Languages and Programming","author":"D Harnik","year":"2006","unstructured":"Harnik, D., Naor, M.: On everlasting security in the Hybrid bounded storage model. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, Part II. LNCS, vol. 4052, pp. 192\u2013203. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_17"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer\u00a0\u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC (1988)","DOI":"10.1145\/62212.62215"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Kol, G., Raz, R., Tal, A.: Time-space hardness of learning sparse parities. In: STOC (2017)","DOI":"10.1145\/3055399.3055430"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-45708-9_17","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"C-J Lu","year":"2002","unstructured":"Lu, C.-J.: Hyper-encryption against space-bounded adversaries from on-line strong extractors. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 257\u2013271. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_17"},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"UM Maurer","year":"1992","unstructured":"Maurer, U.M.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Cryptol. 5(1), 53\u201366 (1992). https:\/\/doi.org\/10.1007\/BF00191321","journal-title":"J. Cryptol."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s00145-008-9035-9","volume":"22","author":"T Moran","year":"2009","unstructured":"Moran, T., Shaltiel, R., Ta-Shma, A.: Non-interactive timestamping in the bounded-storage model. J. Cryptol. 22, 189\u2013226 (2009)","journal-title":"J. Cryptol."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Raz, R.: Fast learning requires good memory: a time-space lower bound for parity learning. In: FOCS (2016)","DOI":"10.1109\/FOCS.2016.36"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Raz, R.: A time-space lower bound for a large class of learning problems. In: FOCS (2017)","DOI":"10.1109\/FOCS.2017.73"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-540-31957-3_80","volume-title":"Networking - ICN 2005","author":"E Sava\u015f","year":"2005","unstructured":"Sava\u015f, E., Sunar, B.: A practical and secure communication protocol in the bounded storage model. In: Lorenz, P., Dini, P. (eds.) ICN 2005, Part II. LNCS, vol. 3421, pp. 707\u2013717. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31957-3_80"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-25516-8_8","volume-title":"Cryptography and Coding","author":"J Shikata","year":"2011","unstructured":"Shikata, J., Yamanaka, D.: Bit commitment in the bounded storage model: tight bound and simple optimal construction. In: Chen, L. (ed.) IMACC 2011. LNCS, vol. 7089, pp. 112\u2013131. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25516-8_8"},{"key":"14_CR23","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: FOCS (1994)"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Yao, A.: How to generate and exchange secrets. In: FOCS (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92641-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,14]],"date-time":"2021-12-14T08:07:37Z","timestamp":1639469257000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92641-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926403","9783030926410"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92641-0_14","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":"15 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IMACC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IMA International Conference on Cryptography and Coding","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ima2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ima.org.uk\/11167\/17th-ima-international-conference-on-cryptography-and-coding\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","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":"14","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":"47% - 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","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":"5","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)"}}]}}