{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:12:50Z","timestamp":1760202770569,"version":"3.40.3"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319968773"},{"type":"electronic","value":"9783319968780"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-96878-0_20","type":"book-chapter","created":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T12:53:57Z","timestamp":1532350437000},"page":"577-607","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Non-Malleable Codes for Partial Functions with Manipulation Detection"],"prefix":"10.1007","author":[{"given":"Aggelos","family":"Kiayias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng-Hao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiannis","family":"Tselekounis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-662-49099-0_15","volume-title":"Theory of Cryptography","author":"D Aggarwal","year":"2016","unstructured":"Aggarwal, D., Agrawal, S., Gupta, D., Maji, H.K., Pandey, O., Prabhakaran, M.: Optimal computational split-state non-malleable codes. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 393\u2013417. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_15"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dodis, Y., Kazana, T., Obremski, M.: Non-malleable reductions and applications. In: STOC, pp. 459\u2013468 (2015)","DOI":"10.1145\/2746539.2746544"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. In: STOC, pp. 774\u2013783 (2014)","DOI":"10.1145\/2591796.2591804"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/978-3-662-47989-6_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"S Agrawal","year":"2015","unstructured":"Agrawal, S., Gupta, D., Maji, H.K., Pandey, O., Prabhakaran, M.: Explicit non-malleable codes against bit-wise tampering and permutations. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 538\u2013557. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_26"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-662-46494-6_16","volume-title":"Theory of Cryptography","author":"S Agrawal","year":"2015","unstructured":"Agrawal, S., Gupta, D., Maji, H.K., Pandey, O., Prabhakaran, M.: A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 375\u2013397. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_16"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/978-3-662-49896-5_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"M Ball","year":"2016","unstructured":"Ball, M., Dachman-Soled, D., Kulkarni, M., Malkin, T.: Non-malleable codes for bounded depth, bounded fan-in circuits. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 881\u2013908. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_31"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Ball, M., Dachman-Soled, D., Kulkarni, M., Malkin, T.: Non-malleable codes from average-case hardness: $${\\sf A\\sf {\\sf C}}^0$$, decision trees, and streaming space-bounded tampering. Cryptology ePrint Archive, Report 2017\/1061 (2017)","DOI":"10.1007\/978-3-319-78372-7_20"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BFb0028164","volume-title":"Security Protocols","author":"F Bao","year":"1998","unstructured":"Bao, F., Deng, R.H., Han, Y., Jeng, A., Narasimhalu, A.D., Ngair, T.: Breaking public key cryptosystems on tamper resistant devices in the presence of transient faults. In: Christianson, B., Crispo, B., Lomas, M., Roe, M. (eds.) Security Protocols 1997. LNCS, vol. 1361, pp. 115\u2013124. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028164"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-32009-5_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"M Bellare","year":"2012","unstructured":"Bellare, M., Tessaro, S., Vardy, A.: Semantic security for the wiretap channel. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 294\u2013311. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_18"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BFb0052259","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"E Biham","year":"1997","unstructured":"Biham, E., Shamir, A.: Differential fault analysis of secret key cryptosystems. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 513\u2013525. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052259"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-69053-0_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"D Boneh","year":"1997","unstructured":"Boneh, D., DeMillo, R.A., Lipton, R.J.: On the importance of checking cryptographic protocols for faults. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 37\u201351. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_4"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s001450010016","volume":"14","author":"D Boneh","year":"2001","unstructured":"Boneh, D., DeMillo, R.A., Lipton, R.J.: On the importance of eliminating errors in cryptographic computations. J. Cryptol. 14(2), 101\u2013119 (2001)","journal-title":"J. Cryptol."},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/3-540-48405-1_32","volume-title":"Advances in Cryptology \u2014 CRYPTO 99","author":"V Boyko","year":"1999","unstructured":"Boyko, V.: On the security properties of OAEP as an all-or-nothing transform. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 503\u2013518. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_32"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-45539-6_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"R Canetti","year":"2000","unstructured":"Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-resilient functions and all-or-nothing transforms. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 453\u2013469. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_33"},{"key":"20_CR15","unstructured":"Chandran, N., Goyal, V., Mukherjee, P., Pandey, O., Upadhyay, J.: Block-wise non-malleable codes. IACR Cryptology ePrint Archive, p. 129 (2015)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-662-49099-0_14","volume-title":"Theory of Cryptography","author":"N Chandran","year":"2016","unstructured":"Chandran, N., Kanukurthi, B., Raghuraman, S.: Information-theoretic local non-malleable codes and their applications. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016-A. LNCS, vol. 9563, pp. 367\u2013392. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_14"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, E., Zuckerman, D.: Non-malleable codes against constant split-state tampering. In: FOCS, pp. 306\u2013315 (2014)","DOI":"10.1109\/FOCS.2014.40"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M., Guruswami, V.: Capacity of non-malleable codes. In: ITCS 2014 (2014)","DOI":"10.1145\/2554797.2554814"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1007\/978-3-642-25385-0_40","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"SG Choi","year":"2011","unstructured":"Choi, S.G., Kiayias, A., Malkin, T.: BiTR: built-in tamper resilience. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 740\u2013758. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_40"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/978-3-662-46494-6_22","volume-title":"Theory of Cryptography","author":"S Coretti","year":"2015","unstructured":"Coretti, S., Maurer, U., Tackmann, B., Venturi, D.: From single-bit to multi-bit public-key encryption via non-malleable codes. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 532\u2013560. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_22"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-78967-3_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R Cramer","year":"2008","unstructured":"Cramer, R., Dodis, Y., Fehr, S., Padr\u00f3, C., Wichs, D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 471\u2013488. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_27"},{"key":"20_CR22","unstructured":"Dachman-Soled, D., Kulkarni, M., Shahverdi, A.: Locally decodable and updatable non-malleable codes in the bounded retrieval model. Cryptology ePrint Archive, Report 2017\/303 (2017). http:\/\/eprint.iacr.org\/2017\/303"},{"key":"20_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-662-54365-8_13","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"D Dachman-Soled","year":"2017","unstructured":"Dachman-Soled, D., Kulkarni, M., Shahverdi, A.: Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10174, pp. 310\u2013332. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54365-8_13"},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-662-46494-6_18","volume-title":"Theory of Cryptography","author":"D Dachman-Soled","year":"2015","unstructured":"Dachman-Soled, D., Liu, F.-H., Shi, E., Zhou, H.-S.: Locally decodable and updatable non-malleable codes and their applications. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 427\u2013450. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_18"},{"key":"20_CR25","unstructured":"D\u00f6ttling, N., Nielsen, J.B., Obremski, M.: Information theoretic continuously non-malleable codes in the constant split-state model. Cryptology ePrint Archive, Report 2017\/357 (2017). http:\/\/eprint.iacr.org\/2017\/357"},{"key":"20_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-40084-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Dziembowski","year":"2013","unstructured":"Dziembowski, S., Kazana, T., Obremski, M.: Non-malleable codes from two-source extractors. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 239\u2013257. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_14"},{"key":"20_CR27","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. In: ICS (2010)"},{"key":"20_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-662-54365-8_12","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"A Faonio","year":"2017","unstructured":"Faonio, A., Nielsen, J.B.: Non-malleable codes with split-state refresh. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10174, pp. 279\u2013309. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54365-8_12"},{"key":"20_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-63715-0_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"S Faust","year":"2017","unstructured":"Faust, S., Host\u00e1kov\u00e1, K., Mukherjee, P., Venturi, D.: Non-malleable codes for space-bounded tampering. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 95\u2013126. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_4"},{"key":"20_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-54242-8_20","volume-title":"Theory of Cryptography","author":"S Faust","year":"2014","unstructured":"Faust, S., Mukherjee, P., Nielsen, J.B., Venturi, D.: Continuous non-malleable codes. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 465\u2013488. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_20"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-662-46447-2_26","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"S Faust","year":"2015","unstructured":"Faust, S., Mukherjee, P., Nielsen, J.B., Venturi, D.: A tamper and leakage resilient von neumann architecture. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 579\u2013603. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_26"},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-55220-5_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Faust","year":"2014","unstructured":"Faust, S., Mukherjee, P., Venturi, D., Wichs, D.: Efficient non-malleable codes and key-derivation for poly-size tampering circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 111\u2013128. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_7"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Genkin, D., Ishai, Y., Prabhakaran, M.M., Sahai, A., Tromer, E.: Circuits resilient to additive attacks with applications to secure computation. In: STOC 2014, pp. 495\u2013504 (2014)","DOI":"10.1145\/2591796.2591861"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-662-46494-6_19","volume-title":"Theory of Cryptography","author":"Z Jafargholi","year":"2015","unstructured":"Jafargholi, Z., Wichs, D.: Tamper detection and continuous non-malleable codes. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 451\u2013480. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46494-6_19"},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography (2007)","DOI":"10.1201\/9781420010756"},{"key":"20_CR36","doi-asserted-by":"crossref","unstructured":"Kiayias, A., Liu, F.-H., Tselekounis, Y.: Practical non-malleable codes from l-more extractable hash functions. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, CCS 2016, pp. 1317\u20131328. ACM, New York (2016)","DOI":"10.1145\/2976749.2978352"},{"key":"20_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-642-32009-5_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"F-H Liu","year":"2012","unstructured":"Liu, F.-H., Lysyanskaya, A.: Tamper and leakage resilience in the split-state model. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 517\u2013532. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_30"},{"key":"20_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/978-3-540-24638-1_16","volume-title":"Theory of Cryptography","author":"S Micali","year":"2004","unstructured":"Micali, S., Reyzin, L.: Physically observable cryptography. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 278\u2013296. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_16"},{"issue":"10","key":"20_CR39","doi-asserted-by":"publisher","first-page":"2135","DOI":"10.1002\/j.1538-7305.1984.tb00072.x","volume":"63","author":"LH Ozarow","year":"1984","unstructured":"Ozarow, L.H., Wyner, A.D.: Wire-tap channel II. AT&T Bell Lab. Tech. J. 63(10), 2135\u20132157 (1984)","journal-title":"AT&T Bell Lab. Tech. J."},{"key":"20_CR40","unstructured":"Resch, J.K., Plank, J.S.: AONT-RS: blending security and performance in dispersed storage systems. In: FAST 2011 (2011)"},{"key":"20_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0052348","volume-title":"Fast Software Encryption","author":"RL Rivest","year":"1997","unstructured":"Rivest, R.L.: All-or-nothing encryption and the package transform. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 210\u2013218. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052348"},{"key":"20_CR42","unstructured":"Shaltiel, R., Silbak, J.: Explicit list-decodable codes with optimal rate for computationally bounded channels. In: APPROX\/RANDOM 2016 (2016)"},{"issue":"2","key":"20_CR43","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1008304703074","volume":"22","author":"DR Stinson","year":"2001","unstructured":"Stinson, D.R.: Something about all or nothing (transforms). Des. Codes Crypt. 22(2), 133\u2013138 (2001)","journal-title":"Des. Codes Crypt."},{"key":"20_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-21040-2_15","volume-title":"Information Security Theory and Practice. Security and Privacy of Mobile Devices in Wireless Communication","author":"M Tunstall","year":"2011","unstructured":"Tunstall, M., Mukhopadhyay, D., Ali, S.: Differential fault analysis of the advanced encryption standard using a single fault. In: Ardagna, C.A., Zhou, J. (eds.) WISTP 2011. LNCS, vol. 6633, pp. 224\u2013233. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21040-2_15"},{"issue":"8","key":"20_CR45","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","volume":"54","author":"AD Wyner","year":"1975","unstructured":"Wyner, A.D.: The wire-tap channel. Bell Syst. Tech. J. 54(8), 1355\u20131387 (1975)","journal-title":"Bell Syst. Tech. J."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96878-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T02:08:14Z","timestamp":1661652494000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-96878-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319968773","9783319968780"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96878-0_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"24 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, 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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"38","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}