{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:01:07Z","timestamp":1786978867347,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030643805","type":"print"},{"value":"9783030643812","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-64381-2_23","type":"book-chapter","created":{"date-parts":[[2020,12,12]],"date-time":"2020-12-12T13:04:25Z","timestamp":1607778265000},"page":"639-669","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On Pseudorandom Encodings"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Agrikola","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Geoffroy","family":"Couteau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stanis\u0142aw","family":"Jarecki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,12,9]]},"reference":[{"key":"23_CR1","unstructured":"Agrikola, T., Couteau, G., Ishai, Y., Jarecki, S., Sahai, A.: On pseudorandom encodings. Cryptology ePrint Archive, report 2020\/445 (2020). https:\/\/eprint.iacr.org\/2020\/445"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., Yang, K.: On the (Im)possibility of Obfuscating Programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-47555-9_26","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 92","author":"D Beaver","year":"1993","unstructured":"Beaver, D., Haber, S.: Cryptographic Protocols Provably Secure Against Dynamic Adversaries. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 307\u2013323. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-47555-9_26"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Bellovin, S.M., Merritt, M.: Encrypted key exchange: password-based protocols secure against dictionary attacks. In: 1992 IEEE Symposium on Security and Privacy, pp. 72\u201384. IEEE Computer Society Press, (1992). doi: 10.1109\/RISP.1992.213269","DOI":"10.1109\/RISP.1992.213269"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Paneth, O., Rosen, A.: On the existence of extractable one-way functions. In: Shmoys, D.B., ed., 46th ACM STOC, pp. 505\u2013514. ACM Press, May\/June 2014. doi: 10.1145\/2591796.2591859","DOI":"10.1145\/2591796.2591859"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/3-540-47719-5_38","volume-title":"Information Security and Privacy","author":"C Boyd","year":"2001","unstructured":"Boyd, C., Montague, P., Nguyen, K.: Elliptic Curve Based Password Authenticated Key Exchange Protocols. In: Varadharajan, V., Mu, Y. (eds.) ACISP 2001. LNCS, vol. 2119, pp. 487\u2013501. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-47719-5_38"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-030-45721-1_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Candidate iO from Homomorphic Encryption Schemes. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 79\u2013109. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_4"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/BFb0052229","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"R Canetti","year":"1997","unstructured":"Canetti, R., Dwork, C., Naor, M., Ostrovsky, R.: Deniable Encryption. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 90\u2013104. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052229"},{"key":"23_CR9","doi-asserted-by":"publisher","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: 28th ACM STOC, pp. 639\u2013648. ACM Press, May 1996. doi: https:\/\/doi.org\/10.1145\/237814.238015","DOI":"10.1145\/237814.238015"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th ACM STOC, pp. 494\u2013503. ACM Press, May 2002. doi: 10.1145\/509907.509980","DOI":"10.1145\/509907.509980"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-319-70700-6_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"R Canetti","year":"2017","unstructured":"Canetti, R., Poburinnaya, O., Raykova, M.: Optimal-Rate Non-Committing Encryption. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 212\u2013241. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_8"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-662-54388-7_14","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"R Canetti","year":"2017","unstructured":"Canetti, R., Poburinnaya, O., Venkitasubramaniam, M.: Better Two-Round Adaptive Multi-party Computation. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10175, pp. 396\u2013427. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54388-7_14"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Chandran, N., Goyal, V., Ostrovsky, R., Sahai, A.: Covert multi-party computation. In: 48th FOCS, pp. 238\u2013248. IEEE Computer Society Press, October 2007. doi: 10.1109\/FOCS.2007.21","DOI":"10.1109\/FOCS.2007.61"},{"key":"23_CR14","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). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_17"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-030-26951-7_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"R Cohen","year":"2019","unstructured":"Cohen, R., Shelat, A., Wichs, D.: Adaptively Secure MPC with Sublinear Communication Complexity. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 30\u201360. Springer, Cham (2019). https:\/\/eprint.iacr.org\/2020\/4450"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/978-3-662-46497-7_23","volume-title":"Theory of Cryptography","author":"D Dachman-Soled","year":"2015","unstructured":"Dachman-Soled, D., Katz, J., Rao, V.: Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 586\u2013613. Springer, Heidelberg (2015). https:\/\/eprint.iacr.org\/2020\/4451"},{"key":"23_CR17","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). https:\/\/eprint.iacr.org\/2020\/4452"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/978-3-642-28914-9_35","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2012","unstructured":"Dodis, Y., Ristenpart, T., Vadhan, S.: Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 618\u2013635. Springer, Heidelberg (2012). https:\/\/eprint.iacr.org\/2020\/4453"},{"issue":"6","key":"23_CR19","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985). https:\/\/eprint.iacr.org\/2020\/4454","journal-title":"Commun. ACM"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-32009-5_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"S Garg","year":"2012","unstructured":"Garg, S., Sahai, A.: Adaptively Secure Multi-Party Computation with Dishonest Majority. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 105\u2013123. Springer, Heidelberg (2012). https:\/\/eprint.iacr.org\/2020\/4455"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th FOCS, pp. 40\u201349. IEEE Computer Society Press, October 2013. doi: 10.1109\/FOCS.2013.13","DOI":"10.1109\/FOCS.2013.13"},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/SFCS.2000.892121","volume":"2000","author":"Y Gertner","year":"2000","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. FOCS 2000, 325\u2013335 (2000). https:\/\/eprint.iacr.org\/2020\/4456","journal-title":"FOCS"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Goldberg, A.V., Sipser, M.: Compression and ranking. In: 17th ACM STOC, pp. 440\u2013448. ACM Press, May 1985. doi: 10.1145\/22145.22194","DOI":"10.1145\/22145.22194"},{"issue":"4","key":"23_CR24","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999). https:\/\/eprint.iacr.org\/2020\/4457","journal-title":"SIAM J. Comput."},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/978-3-662-53890-6_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Hofheinz","year":"2016","unstructured":"Hofheinz, D., Jager, T., Khurana, D., Sahai, A., Waters, B., Zhandry, M.: How to Generate and Use Universal Samplers. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 715\u2013744. Springer, Heidelberg (2016). https:\/\/eprint.iacr.org\/2020\/4458"},{"key":"23_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-319-60876-1_12","volume-title":"Detection of Intrusions and Malware, and Vulnerability Assessment","author":"F Wei","year":"2017","unstructured":"Wei, F., Li, Y., Roy, S., Ou, X., Zhou, W.: Deep Ground Truth Analysis of Current Android Malware. In: Polychronakis, M., Meier, M. (eds.) DIMVA 2017. LNCS, vol. 10327, pp. 252\u2013276. Springer, Cham (2017). https:\/\/eprint.iacr.org\/2020\/4459"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-72540-4_10","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"C-Y Hsiao","year":"2007","unstructured":"Hsiao, C.-Y., Lu, C.-J., Reyzin, L.: Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 169\u2013186. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/3-540-44647-8_10"},{"key":"23_CR28","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R.: A personal view of average-case complexity. In: Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, 19\u201322 June 1995, pp. 134\u2013147 (1995). https:\/\/doi.org\/10.1109\/SCT.1995.514853","DOI":"10.1109\/SCT.1995.514853"},{"key":"23_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-17373-8_27","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"Y Ishai","year":"2010","unstructured":"Ishai, Y., Kumarasubramanian, A., Orlandi, C., Sahai, A.: On Invertible Sampling and Adaptive Security. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 466\u2013482. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/3-540-44647-8_11"},{"key":"23_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-55220-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Juels","year":"2014","unstructured":"Juels, A., Ristenpart, T.: Honey Encryption: Security Beyond the Brute-Force Bound. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 293\u2013310. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/3-540-44647-8_12"},{"key":"23_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-30576-7_14","volume-title":"Theory of Cryptography","author":"M Lepinski","year":"2005","unstructured":"Lepinski, M., Micali, S., Shelat, A.: Fair-Zero Knowledge. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 245\u2013263. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: Handbook of theoretical computer science, vol. a, chapter Kolmogorov Complexity and Its Applications, pp. 187\u2013254. MIT Press, Cambridge, MA, USA (1990). ISBN 0-444-88071-2. http:\/\/dl.acm.org\/citation.cfm?id=114872.114876","DOI":"10.1016\/B978-0-444-88071-0.50009-6"},{"key":"23_CR33","doi-asserted-by":"publisher","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications. Texts in Computer Science, 4th edn. Springer, New York (2019). https:\/\/doi.org\/10.1007\/978-3-030-11298-1. ISBN 978-3-030-11297-4","DOI":"10.1007\/978-3-030-11298-1"},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"Raz, R., Reingold, O.: On recycling the randomness of states in space bounded computation. In: 31st ACM STOC, pp. 159\u2013168. ACM Press, May 1999. doi: 10.1145\/301250.301294","DOI":"10.1145\/301250.301294"},{"key":"23_CR35","doi-asserted-by":"publisher","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 475\u2013484. ACM Press, May\/June 2014. https:\/\/doi.org\/10.1145\/2591796.2591825","DOI":"10.1145\/2591796.2591825"},{"issue":"3","key":"23_CR36","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"23_CR37","doi-asserted-by":"publisher","unstructured":"Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, report 2004\/332 (2004). https:\/\/doi.org\/10.1007\/3-540-44647-8_15","DOI":"10.1007\/3-540-44647-8_1"},{"key":"23_CR38","doi-asserted-by":"crossref","unstructured":"Ta-Shma, A., Umans, C., Zuckerman, D.: Loss-less condensers, unbalanced expanders, and extractors. In: 33rd ACM STOC, pp. 143\u2013152. ACM Press, July 2001. doi: 10.1145\/380752.380790","DOI":"10.1145\/380752.380790"},{"key":"23_CR39","doi-asserted-by":"crossref","unstructured":"Trevisan, L., Vadhan, S.P.: Extracting randomness from samplable distributions. In: 41st FOCS, pp. 32\u201342. IEEE Computer Society Press, November 2000. doi: 10.1109\/SFCS.2000.892063","DOI":"10.1109\/SFCS.2000.892063"},{"issue":"3","key":"23_CR40","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/s00037-005-0198-6","volume":"14","author":"L Trevisan","year":"2005","unstructured":"Trevisan, L., Vadhan, S.P., Zuckerman, D.: Compression of samplable sources. Comput. Compl. 14(3), 186\u2013227 (2005). https:\/\/doi.org\/10.1007\/3-540-44647-8_16","journal-title":"Compression of samplable sources. Comput. Compl."},{"key":"23_CR41","doi-asserted-by":"publisher","unstructured":"von Ahn, L., Hopper, N.J., Langford, J.: Covert two-party computation. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 513\u2013522. ACM Press, May 2005. https:\/\/doi.org\/10.1145\/1060590.1060668","DOI":"10.1145\/1060590.1060668"},{"key":"23_CR42","doi-asserted-by":"crossref","unstructured":"Wee, H.: On pseudoentropy versus compressibility. In: 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 21\u201324 June 2004, Amherst, MA, USA, pp. 29\u201341. IEEE Computer Society (2004). ISBN 0-7695-2120-7. doi: 10.1109\/CCC.2004.1313782","DOI":"10.1109\/CCC.2004.1313782"},{"key":"23_CR43","doi-asserted-by":"publisher","unstructured":"Wee, H., Wichs, D.: Candidate obfuscation via oblivious LWE sampling. Cryptology ePrint Archive, report 2020\/1042 (2020). https:\/\/doi.org\/10.1007\/3-540-44647-8_17","DOI":"10.1007\/3-540-44647-8_1"},{"key":"23_CR44","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Theory and applications of trapdoor functions (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3\u20135 November 1982, pp. 80\u201391. IEEE Computer Society (1982). doi: 10.1109\/SFCS.1982.45","DOI":"10.1109\/SFCS.1982.45"},{"key":"23_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-662-53018-4_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Zhandry","year":"2016","unstructured":"Zhandry, M.: The Magic of ELFs. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 479\u2013508. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/3-540-44647-8_18"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64381-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,11]],"date-time":"2023-12-11T20:09:42Z","timestamp":1702325382000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64381-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030643805","9783030643812"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64381-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2020","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":"tcc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2020\/","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":"websubrev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"167","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":"71","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":"43% - 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":"4","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":"17","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)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}