{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T23:02:08Z","timestamp":1765062128207,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319706962"},{"type":"electronic","value":"9783319706979"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-70697-9_3","type":"book-chapter","created":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T18:27:49Z","timestamp":1510943269000},"page":"66-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups"],"prefix":"10.1007","author":[{"given":"Essam","family":"Ghadafi","sequence":"first","affiliation":[]},{"given":"Jens","family":"Groth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,18]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-662-47989-6_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"M Abdalla","year":"2015","unstructured":"Abdalla, M., Benhamouda, F., Passel\u00e8gue, A.: An algebraic framework for pseudorandom functions and applications to related-key security. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 388\u2013409. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_19"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/978-3-662-49896-5_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"M Ambrona","year":"2016","unstructured":"Ambrona, M., Barthe, G., Schmidt, B.: Automated unbounded analysis of cryptographic constructions in the generic group model. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 822\u2013851. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_29"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-39927-8_28","volume-title":"Information and Communications Security","author":"F Bao","year":"2003","unstructured":"Bao, F., Deng, R.H., Zhu, H.F.: Variations of Diffie-Hellman problem. In: Qing, S., Gollmann, D., Zhou, J. (eds.) ICICS 2003. LNCS, vol. 2836, pp. 301\u2013312. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39927-8_28"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-662-44371-2_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"G Barthe","year":"2014","unstructured":"Barthe, G., Fagerholm, E., Fiore, D., Mitchell, J., Scedrov, A., Schmidt, B.: Automated analysis of cryptographic assumptions in generic group models. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 95\u2013112. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_6"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-28628-8_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M Bellare","year":"2004","unstructured":"Bellare, M., Palacio, A.: The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 273\u2013289. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_17"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-19571-6_15","volume-title":"Theory of Cryptography","author":"M Bellare","year":"2011","unstructured":"Bellare, M., Waters, B., Yilek, S.: Identity-based encryption secure against selective opening attack. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 235\u2013252. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_15"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/0-387-34799-2_38","volume-title":"Advances in Cryptology \u2014 CRYPTO 1988","author":"B Boer","year":"1990","unstructured":"Boer, B.: Diffie-Hellman is as strong as discrete log for certain primes. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 530\u2013539. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_38"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00145-007-9005-7","volume":"21","author":"D Boneh","year":"2008","unstructured":"Boneh, D., Boyen, X.: Short signatures without random oracles and the SDH assumption in bilinear groups. J. Crypt. 21(2), 149\u2013177 (2008)","journal-title":"J. Crypt."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/11426639_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical identity based encryption with constant size ciphertext. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 440\u2013456. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_26"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 258\u2013275. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_16"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-85538-5_3","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"X Boyen","year":"2008","unstructured":"Boyen, X.: The Uber-assumption family. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 39\u201356. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_3"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-71677-8_1","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"X Boyen","year":"2007","unstructured":"Boyen, X., Waters, B.: Full-domain subgroup hiding and constant-size group signatures. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 1\u201315. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_1"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/3-540-36492-7_21","volume-title":"Selected Areas in Cryptography","author":"E Bresson","year":"2003","unstructured":"Bresson, E., Chevassut, O., Pointcheval, D.: The group Diffie-Hellman problems. In: Nyberg, K., Heys, H. (eds.) SAC 2002. LNCS, vol. 2595, pp. 325\u2013338. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36492-7_21"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-74143-5_27","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"E Bresson","year":"2007","unstructured":"Bresson, E., Lakhnech, Y., Mazar\u00e9, L., Warinschi, B.: A generalization of DDH with applications to protocol analysis and computational soundness. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 482\u2013499. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_27"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/978-3-662-53890-6_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"M Chase","year":"2016","unstructured":"Chase, M., Maller, M., Meiklejohn, S.: D\u00e9j\u00e0 Q all over again: tighter and broader reductions of q-type assumptions. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 655\u2013681. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_22"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/978-3-642-55220-5_34","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"M Chase","year":"2014","unstructured":"Chase, M., Meiklejohn, S.: D\u00e9j\u00e0 Q: using dual systems to revisit q-type assumptions. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 622\u2013639. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_34"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11761679_1","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"JH Cheon","year":"2006","unstructured":"Cheon, J.H.: Security analysis of the strong Diffie-Hellman problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 1\u201311. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_1"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-36178-2_6","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"AW Dent","year":"2002","unstructured":"Dent, A.W.: Adapting the weaknesses of the random oracle model to the generic group model. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 100\u2013109. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_6"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-40084-1_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A Escala","year":"2013","unstructured":"Escala, A., Herold, G., Kiltz, E., R\u00e0fols, C., Villar, J.: An algebraic framework for Diffie-Hellman assumptions. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 129\u2013147. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_8"},{"unstructured":"Fuchsbauer, G., Hanser, C., Slamanig, D.: Structure-preserving signatures on equivalence classes and constant-size anonymous credentials. Cryptology ePrint Archive, Report 2014\/944 (2014)","key":"3_CR20"},{"issue":"16","key":"3_CR21","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"SD Galbraith","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for cryptographers. Discrete Appl. Math. 156(16), 3113\u20133121 (2008)","journal-title":"Discrete Appl. Math."},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/978-3-642-38348-9_37","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"R Gennaro","year":"2013","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 626\u2013645. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_37"},{"doi-asserted-by":"crossref","unstructured":"Ghadafi, E., Groth, J.: Towards a classification of non-interactive computational assumptions in cyclic groups. Cryptology ePrint Archive, Report 2017\/343 (2017). http:\/\/eprint.iacr.org\/2017\/343","key":"3_CR23","DOI":"10.1007\/978-3-319-70697-9_3"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-662-49096-9_21","volume-title":"Theory of Cryptography","author":"S Goldwasser","year":"2016","unstructured":"Goldwasser, S., Tauman Kalai, Y.: Cryptographic assumptions: a position paper. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 505\u2013522. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_21"},{"issue":"2","key":"3_CR25","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s00145-012-9120-y","volume":"26","author":"T Jager","year":"2012","unstructured":"Jager, T., Schwenk, J.: On the analysis of cryptographic assumptions in the generic ring model. J. Crypt. 26(2), 225\u2013245 (2012)","journal-title":"J. Crypt."},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-319-27659-5_28","volume-title":"Information Security","author":"A Joux","year":"2015","unstructured":"Joux, A., Rojat, A.: Security ranking among assumptions within the Uber Assumption framework. In: Desmedt, Y. (ed.) ISC 2013. LNCS, vol. 7807, pp. 391\u2013406. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27659-5_28"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-45311-3_32","volume-title":"Progress in Cryptology \u2014 INDOCRYPT 2001","author":"E Kiltz","year":"2001","unstructured":"Kiltz, E.: A tool box of cryptographic functions related to the Diffie-Hellman function. In: Rangan, C.P., Ding, C. (eds.) INDOCRYPT 2001. LNCS, vol. 2247, pp. 339\u2013349. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45311-3_32"},{"issue":"1","key":"3_CR28","doi-asserted-by":"publisher","first-page":"13","DOI":"10.3934\/amc.2007.1.13","volume":"1","author":"N Koblitz","year":"2007","unstructured":"Koblitz, N., Menezes, A.: Another look at generic groups. Adv. Math. Commun. 1(1), 13\u201328 (2007)","journal-title":"Adv. Math. Commun."},{"issue":"5","key":"3_CR29","first-page":"1083","volume":"E87\u2013A","author":"C Konoma","year":"2004","unstructured":"Konoma, C., Mambo, M., Shizuya, H.: Complexity analysis of the cryptographic primitive problems through square-root exponent. IEICE Trans. E87\u2013A(5), 1083\u20131091 (2004)","journal-title":"IEICE Trans."},{"key":"3_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11586821_1","volume-title":"Cryptography and Coding","author":"U Maurer","year":"2005","unstructured":"Maurer, U.: Abstract models of computation in cryptography. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 1\u201312. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11586821_1"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-48658-5_26","volume-title":"Advances in Cryptology \u2014 CRYPTO 1994","author":"UM Maurer","year":"1994","unstructured":"Maurer, U.M.: Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 271\u2013281. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_26"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-68697-5_21","volume-title":"Advances in Cryptology \u2014 CRYPTO 1996","author":"UM Maurer","year":"1996","unstructured":"Maurer, U.M., Wolf, S.: Diffie-Hellman oracles. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 268\u2013282. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_21"},{"issue":"2","key":"3_CR33","first-page":"481","volume":"E85\u2013A","author":"S Mitsunari","year":"2002","unstructured":"Mitsunari, S., Sakai, R., Kasahara, M.: A new traitor tracing. IEICE Trans. E85\u2013A(2), 481\u2013484 (2002)","journal-title":"IEICE Trans."},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/978-3-662-53887-6_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"P Morillo","year":"2016","unstructured":"Morillo, P., R\u00e0fols, C., Villar, J.L.: The kernel matrix Diffie-Hellman assumption. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 729\u2013758. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_27"},{"key":"3_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-45146-4_6","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"M Naor","year":"2003","unstructured":"Naor, M.: On cryptographic assumptions and challenges. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 96\u2013109. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_6"},{"issue":"2","key":"3_CR36","first-page":"91","volume":"55","author":"VI Nechaev","year":"1994","unstructured":"Nechaev, V.I.: Complexity of a determinate algorithm for the discrete logarithm. Math. Zametki 55(2), 91\u2013101 (1994)","journal-title":"Math. Zametki"},{"issue":"2","key":"3_CR37","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10623-011-9503-3","volume":"62","author":"D Roh","year":"2012","unstructured":"Roh, D., Hahn, S.G.: The square root Diffie-Hellman problem. Des. Codes Crypt. 62(2), 179\u2013187 (2012)","journal-title":"Des. Codes Crypt."},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-44987-6_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"A-R Sadeghi","year":"2001","unstructured":"Sadeghi, A.-R., Steiner, M.: Assumptions related to discrete logarithms: why subtleties make a real difference. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 244\u2013261. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_16"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-70697-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:27:35Z","timestamp":1710343655000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-70697-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319706962","9783319706979"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-70697-9_3","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":"18 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"3 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/asiacrypt.iacr.org\/2017\/","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"}]}}