{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:10:04Z","timestamp":1742926204158,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319573380"},{"type":"electronic","value":"9783319573397"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-57339-7_10","type":"book-chapter","created":{"date-parts":[[2017,4,19]],"date-time":"2017-04-19T05:08:50Z","timestamp":1492578530000},"page":"165-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Isheeta","family":"Nargis","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,20]]},"reference":[{"issue":"2","key":"10_CR1","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. Cryptol. 23(2), 281\u2013343 (2010)","journal-title":"J. Cryptol."},{"key":"10_CR2","volume-title":"Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms","author":"E Bach","year":"1985","unstructured":"Bach, E.: Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms. Massachusetts Institute of Technology, Cambridge (1985)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-01001-9_1","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"M Bellare","year":"2009","unstructured":"Bellare, M., Hofheinz, D., Yilek, S.: Possibility and impossibility results for encryption and commitment secure under selective opening. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 1\u201335. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-01001-9_1"},{"key":"10_CR4","unstructured":"Bellare, M., Yilek, S.: Encryption schemes secure under selective opening attack. Cryptology ePrint Archive, Report 2009\/101 (2009). http:\/\/eprint.iacr.org\/"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/3-540-48405-1_7","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"R Canetti","year":"1999","unstructured":"Canetti, R., Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Adaptive security for threshold cryptosystems. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 98\u2013116. Springer, Heidelberg (1999). doi:10.1007\/3-540-48405-1_7"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-642-10366-7_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"SG Choi","year":"2009","unstructured":"Choi, S.G., Dachman-Soled, D., Malkin, T., Wee, H.: Improved non-committing encryption with applications to adaptively secure protocols. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 287\u2013302. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-10366-7_17"},{"key":"10_CR8","unstructured":"Damg\u00e5rd, I.: On $$\\Sigma $$-protocols. www.cs.au.dk\/~ivan\/Sigma.pdf"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-45539-6_30","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"I Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I.: Efficient concurrent zero-knowledge in the auxiliary string model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 418\u2013430. Springer, Heidelberg (2000). doi:10.1007\/3-540-45539-6_30"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-44598-6_27","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"I Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Improved non-committing encryption schemes based on a general complexity assumption. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 432\u2013450. Springer, Heidelberg (2000). doi:10.1007\/3-540-44598-6_27"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-45472-1_7","volume-title":"Financial Cryptography","author":"P-A Fouque","year":"2001","unstructured":"Fouque, P.-A., Poupard, G., Stern, J.: Sharing decryption in the context of voting or lotteries. In: Frankel, Y. (ed.) FC 2000. LNCS, vol. 1962, pp. 90\u2013104. Springer, Heidelberg (2001). doi:10.1007\/3-540-45472-1_7"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-03356-8_30","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"JA Garay","year":"2009","unstructured":"Garay, J.A., Wichs, D., Zhou, H.-S.: Somewhat non-committing encryption and efficient adaptively secure oblivious transfer. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 505\u2013523. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-03356-8_30"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-54242-8_16","volume-title":"Theory of Cryptography","author":"C Hazay","year":"2014","unstructured":"Hazay, C., Patra, A.: One-sided adaptively secure two-party computation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 368\u2013393. Springer, Heidelberg (2014). doi:10.1007\/978-3-642-54242-8_16"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-45539-6_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"S Jarecki","year":"2000","unstructured":"Jarecki, S., Lysyanskaya, A.: Adaptively secure threshold cryptography: introducing concurrency, removing erasures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 221\u2013242. Springer, Heidelberg (2000). doi:10.1007\/3-540-45539-6_16"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M Naor","year":"1998","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zero-knowledge arguments for NP using any one-way permutation. J. Cryptol. 11, 87\u2013108 (1998)","journal-title":"J. Cryptol."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Nargis, I.: Efficient oblivious transfer from lossy threshold homomorphic encryption. Cryptology ePrint Archive, Report 2017\/235 (2017). http:\/\/eprint.iacr.org\/2017\/235","DOI":"10.1007\/978-3-319-57339-7_10"},{"key":"10_CR17","unstructured":"Nielsen, J.B.: On protocol security in the cryptographic model. Ph.D. thesis, University of Aarhus (2004)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO\u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). doi:10.1007\/3-540-46766-1_9"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-85174-5_31"},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"CP Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161\u2013174 (1991)","journal-title":"J. Cryptol."},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-14081-5_9","volume-title":"Information Security and Privacy","author":"H Zhu","year":"2010","unstructured":"Zhu, H., Araragi, T., Nishide, T., Sakurai, K.: Adaptive and composable non-committing encryptions. In: Steinfeld, R., Hawkes, P. (eds.) ACISP 2010. LNCS, vol. 6168, pp. 135\u2013144. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-14081-5_9"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57339-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T14:15:57Z","timestamp":1710166557000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57339-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319573380","9783319573397"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57339-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"20 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dakar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Senegal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/site\/africacrypt2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}