{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:57:38Z","timestamp":1743069458652,"version":"3.40.3"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030053772"},{"type":"electronic","value":"9783030053789"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-05378-9_13","type":"book-chapter","created":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T01:03:38Z","timestamp":1543971818000},"page":"228-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Pairing-Friendly Twisted Hessian Curves"],"prefix":"10.1007","author":[{"given":"Chitchanok","family":"Chuengsatiansup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chloe","family":"Martindale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,5]]},"reference":[{"key":"13_CR1","unstructured":"Arene, C., Lange, T., Naehrig, M., Ritzenthaler, C.: Faster computation of the Tate pairing. IACR Cryptology ePrint Archive, 2009:155 (2009). http:\/\/eprint.iacr.org\/2009\/155"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/978-3-662-46800-5_6","volume-title":"Advances in Cryptology -- EUROCRYPT 2015","author":"Razvan Barbulescu","year":"2015","unstructured":"Barbulescu, R., Gaudry, P., Guillevic, A., Morain, F.: Improving NFS for the discrete logarithm problem in non-prime finite fields. In: Eurocrypt 2015 [44], pp. 129\u2013155 (2015)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-48800-3_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"Razvan Barbulescu","year":"2015","unstructured":"Barbulescu, R., Gaudry, P., Kleinjung, T.: The tower number field sieve. In: Asiacrypt 2015 [28], pp. 31\u201355 (2015)"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-24654-1_2","volume-title":"Selected Areas in Cryptography","author":"Paulo S. L. M. Barreto","year":"2004","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: On the selection of pairing-friendly groups. In: SAC 2003 [42], pp. 17\u201325 (2003)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"Paulo S. L. M. Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: SAC 2005 [45], pp. 319\u2013331 (2006). http:\/\/cryptosith.org\/papers\/pfcpo.pdf"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-319-22174-8_15","volume-title":"Progress in Cryptology -- LATINCRYPT 2015","author":"Daniel J. Bernstein","year":"2015","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Kohel, D., Lange, T.: Twisted Hessian curves. In: LATINCRYPT 2015 [39], pp. 269\u2013294 (2015). http:\/\/cr.yp.to\/papers.html#hessian"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Asiacrypt 2007 [37], pp. 29\u201350 (2007). http:\/\/cr.yp.to\/newelliptic\/newelliptic-20070906.pdf","DOI":"10.1007\/978-3-540-76900-2_3"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"Dan Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. In: CRYPTO 2001\u00a0[34], pp. 213\u2013229 (2001). http:\/\/www.iacr.org\/archive\/crypto2001\/21390212.pdf"},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptol. 17(4), 297\u2013319 (2004). http:\/\/crypto.stanford.edu\/~dabo\/pubs\/papers\/weilsigs.ps","journal-title":"J. Cryptol."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Costello, C., Naehrig, M.: Exponentiating in pairing groups. In: SAC 2013\u00a0[38] (2013). https:\/\/eprint.iacr.org\/2013\/458.pdf","DOI":"10.1007\/978-3-662-43414-7_22"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/10722028","volume-title":"Algorithmic Number Theory","year":"2000","unstructured":"Bosma, W. (ed.): ANTS 2000. LNCS, vol. 1838. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722028"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04873-4","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2013","year":"2014","unstructured":"Cao, Z., Zhang, F. (eds.): Pairing 2013. LNCS, vol. 8365. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04873-4"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44709-1","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2001","year":"2001","unstructured":"Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.): CHES 2001. LNCS, vol. 2162. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44709-1"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89754-5","volume-title":"Progress in Cryptology - INDOCRYPT 2008","year":"2008","unstructured":"Chowdhury, D.R., Rijmen, V., Das, A. (eds.): INDOCRYPT 2008. LNCS, vol. 5365. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89754-5"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-03298-1_7","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"Craig Costello","year":"2009","unstructured":"Costello, C., Hisil, H., Boyd, C., Gonz\u00e1lez Nieto, J.M., Wong, K.K.-H.: Faster pairings on special Weierstrass curves. In: Pairing 2009\u00a0[48], pp. 89\u2013101 (2009)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b136415","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","year":"2005","unstructured":"Cramer, R. (ed.): EUROCRYPT 2005. LNCS, vol. 3494. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/b136415"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1090\/S0273-0979-07-01153-6","volume":"44","author":"HM Edwards","year":"2007","unstructured":"Edwards, H.M.: A normal form for elliptic curves. Bulletin Am. Mathe. Soc. 44, 393\u2013422 (2007). http:\/\/www.ams.org\/bull\/2007-44-03\/S0273-0979-07-01153-6\/home.html","journal-title":"Bulletin Am. Mathe. Soc."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Fotiadis, G., Konstantinou, E.: TNFS resistant families of pairing-friendly elliptic curves. J. Theor. Comput. Sci. (2018, to appear)","DOI":"10.1016\/j.tcs.2019.10.017"},{"key":"13_CR19","unstructured":"Fouotsa, E., El Mrabet, N., Pecha, A.: Optimal ate pairing on elliptic curves with embedding degree 9, 15 and 27. IACR Cryptology ePrint Archive, 2016:1187 (2016). http:\/\/eprint.iacr.org\/2016\/1187"},{"issue":"2","key":"13_CR20","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. J. Cryptol. 23(2), 224\u2013280 (2010). http:\/\/eprint.iacr.org\/2006\/372\/","journal-title":"J. Cryptol."},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85538-5","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","year":"2008","unstructured":"Galbraith, S.D., Paterson, K.G. (eds.): Pairing 2008. LNCS, vol. 5209. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5"},{"key":"13_CR22","first-page":"548","volume-title":"Lecture Notes in Computer Science","author":"Craig Gentry","year":"2002","unstructured":"Gentry, C., Silverberg, A.: Hierarchical ID-based cryptography. In: Asiacrypt 2002 [52], pp. 548\u2013566 (2002). http:\/\/www.cs.ucdavis.edu\/~franklin\/ecs228\/pubs\/extra_pubs\/hibe.pdf"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-24209-0_11","volume-title":"Information Security and Cryptology - ICISC 2010","author":"H Gu","year":"2011","unstructured":"Gu, H., Gu, D., Xie, W.L.: Efficient pairing computation on elliptic curves in Hessian form. In: Rhee, K.-H., Nyang, D.H. (eds.) ICISC 2010. LNCS, vol. 6829, pp. 169\u2013176. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24209-0_11"},{"issue":"10","key":"13_CR24","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F Hess","year":"2006","unstructured":"Hess, F., Smart, N.P., Vercauteren, F.: The Eta pairing revisited. IEEE Trans. Inf. Theor. 52(10), 4595\u20134602 (2006). http:\/\/eprint.iacr.org\/2006\/110","journal-title":"IEEE Trans. Inf. Theor."},{"key":"13_CR25","unstructured":"H\u0131\u015f\u0131l, H.: Elliptic curves, group law, and efficient computation. Ph.D. thesis, Queensland University of Technology (2010)"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/3-540-46035-7_31","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"Jeremy Horwitz","year":"2002","unstructured":"Horwitz, J., Lynn, B.: Toward hierarchical identity-based encryption. In: Eurocrypt 2002 [36], pp. 466\u2013481 (2002). http:\/\/theory.stanford.edu\/~horwitz\/pubs\/hibe.pdf"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-540-89754-5_31","volume-title":"Progress in Cryptology - INDOCRYPT 2008","author":"Sorina Ionica","year":"2008","unstructured":"Ionica, S., Joux, A.: Another approach to pairing computation in Edwards coordinates. In: INDOCRYPT 2008 [14], pp. 400\u2013413 (2008)"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48797-6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","year":"2015","unstructured":"Iwata, T., Cheon, J.H. (eds.): ASIACRYPT 2015. LNCS, vol. 9452. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6"},{"key":"13_CR29","first-page":"385","volume-title":"Lecture Notes in Computer Science","author":"Antoine Joux","year":"2000","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. In: ANTS-IV [11], pp. 385\u2013393 (2000). http:\/\/cgi.di.uoa.gr\/~aggelos\/crypto\/page4\/assets\/joux-tripartite.pdf"},{"issue":"4","key":"13_CR30","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A Joux","year":"2004","unstructured":"Joux, A.: A one round protocol for tripartite Diffie-Hellman. J. Cryptol. 17(4), 263\u2013276 (2004)","journal-title":"J. Cryptol."},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Joux, A., Pierrot, C.: The special number field sieve in $$\\mathbb{F}_{p^n}$$, application to pairing-friendly constructions. In: Pairing 2013\u00a0[12], pp. 45\u201361 (2013)","DOI":"10.1007\/978-3-319-04873-4_3"},{"key":"13_CR32","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-44709-1_33","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2001","author":"Marc Joye","year":"2001","unstructured":"Joye, M., Quisquater, J.-J.: Hessian elliptic curves and side-channel attacks. In: CHES 2001 [13], pp. 402\u2013410 (2001). http:\/\/joye.site88.net\/"},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing Brezing-Weng pairing-friendly elliptic curves using elements in the cyclotomic field. In: Pairing 2008\u00a0[21], pp. 126\u2013135 (2008)","DOI":"10.1007\/978-3-540-85538-5_9"},{"key":"13_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","year":"2001","unstructured":"Kilian, J. (ed.): CRYPTO 2001. LNCS, vol. 2139. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8"},{"key":"13_CR35","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-662-53018-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Taechan Kim","year":"2016","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: CRYPTO 2016\u00a0[46], pp. 543\u2013571 (2016)"},{"key":"13_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46035-7","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","year":"2002","unstructured":"Knudsen, L.R. (ed.): EUROCRYPT 2002. LNCS, vol. 2332. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7"},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76900-2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","year":"2007","unstructured":"Kurosawa, K. (ed.): ASIACRYPT 2007. LNCS, vol. 4833. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43414-7","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","year":"2014","unstructured":"Lange, T., Lauter, K., Lison\u011bk, P. (eds.): SAC 2013. LNCS, vol. 8282. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43414-7"},{"key":"13_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22174-8","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2015","year":"2015","unstructured":"Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.): LATINCRYPT 2015. LNCS, vol. 9230. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8"},{"key":"13_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-12087-4_12","volume-title":"Information Security and Cryptology","author":"L Li","year":"2014","unstructured":"Li, L., Wu, H., Zhang, F.: Pairing computation on Edwards curves with high-degree twists. In: Lin, D., Xu, S., Yung, M. (eds.) Inscrypt 2013. LNCS, vol. 8567, pp. 185\u2013200. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12087-4_12"},{"key":"13_CR41","doi-asserted-by":"publisher","first-page":"2387","DOI":"10.1093\/ietfec\/e91-a.9.2387","volume":"91\u2013A(9)","author":"X Lin","year":"2008","unstructured":"Lin, X., Zhao, C., Zhang, F., Wang, Y.: Computing the ate pairing on elliptic curves with embedding degree k = 9. IEICE Trans. 91\u2013A(9), 2387\u20132393 (2008)","journal-title":"IEICE Trans."},{"key":"13_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/b96837","volume-title":"Selected Areas in Cryptography","year":"2004","unstructured":"Matsui, M., Zuccherato, R.J. (eds.): SAC 2003. LNCS, vol. 3006. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/b96837"},{"key":"13_CR43","unstructured":"El Mrabet, N., Guillermin, N., Ionica, S.: A study of pairing computation for elliptic curves with embedding degree 15. IACR Cryptology ePrint Archive, 2009:370 (2009). http:\/\/eprint.iacr.org\/2009\/370"},{"key":"13_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","year":"2015","unstructured":"Oswald, E., Fischlin, M. (eds.): EUROCRYPT 2015. LNCS, vol. 9056. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5"},{"key":"13_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11693383","volume-title":"Selected Areas in Cryptography","year":"2006","unstructured":"Preneel, B., Tavares, S. (eds.): SAC 2005. LNCS, vol. 3897. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693383"},{"key":"13_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53018-4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","year":"2016","unstructured":"Robshaw, M., Katz, J. (eds.): CRYPTO 2016. LNCS, vol. 9814. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4"},{"key":"13_CR47","first-page":"457","volume-title":"Lecture Notes in Computer Science","author":"Amit Sahai","year":"2005","unstructured":"Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Eurocrypt 2005\u00a0[16], pp. 457\u2013473 (2005). http:\/\/eprint.iacr.org\/2004\/086\/"},{"key":"13_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03298-1","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","year":"2009","unstructured":"Shacham, H., Waters, B. (eds.): Pairing 2009. LNCS, vol. 5671. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03298-1"},{"key":"13_CR49","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09494-6","volume-title":"The Arithmetic of Elliptic Curves","author":"JH Silverman","year":"2009","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. GTM, vol. 106. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-0-387-09494-6"},{"key":"13_CR50","doi-asserted-by":"crossref","unstructured":"Smart, N.P.: The Hessian form of an Hessian curve. In: CHES 2001 [13], pp. 118\u2013125 (2001)","DOI":"10.1007\/3-540-44709-1_11"},{"issue":"1","key":"13_CR51","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal pairings. IEEE Trans. Inf. Theor. 56(1), 455\u2013461 (2010)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"13_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36178-2","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","year":"2002","unstructured":"Zheng, Y. (ed.): ASIACRYPT 2002. LNCS, vol. 2501. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05378-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:49:08Z","timestamp":1709822948000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05378-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030053772","9783030053789"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05378-9_13","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":"5 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Delhi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"9 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isical.ac.in\/~indocrypt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}