{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T21:37:56Z","timestamp":1783460276830,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662538869","type":"print"},{"value":"9783662538876","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53887-6_7","type":"book-chapter","created":{"date-parts":[[2016,11,8]],"date-time":"2016-11-08T12:11:21Z","timestamp":1478607081000},"page":"191-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":192,"title":["MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity"],"prefix":"10.1007","author":[{"given":"Martin","family":"Albrecht","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lorenzo","family":"Grassi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Rechberger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnab","family":"Roy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tyge","family":"Tiessen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,11,9]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-32009-5_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"MA Abdelraheem","year":"2012","unstructured":"Abdelraheem, M.A., \u00c5gren, M., Beelen, P., Leander, G.: On the distribution of linear biases: three instructive examples. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 50\u201367. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-32009-5_4"},{"key":"7_CR2","unstructured":"Arbitman, Y., Dogon, G., Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: Swifftx: a proposal for the SHA-3 standard. Submission to NIST (2008)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Albrecht, M., Grassi, L., Rechberger, C., Roy, A., Tiessen, T.: MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity. Cryptology ePrint Archive, Report 2016\/492 (2016). http:\/\/eprint.iacr.org\/2016\/492","DOI":"10.1007\/978-3-662-53887-6_7"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1504\/IJWMC.2011.044106","volume":"5","author":"M \u00c5gren","year":"2011","unstructured":"\u00c5gren, M., Hell, M., Johansson, T., Meier, W.: Grain-128a: a new version of grain-128 with optional authentication. IJWMC 5(1), 48\u201359 (2011)","journal-title":"IJWMC"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, May 1996, pp. 99\u2013108. ACM Press (1996)","DOI":"10.1145\/237814.237838"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-662-46800-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 430\u2013454. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46800-5_17"},{"key":"7_CR7","unstructured":"Albrecht, M., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. Cryptology ePrint Archive, Report 2016\/687 (2016). http:\/\/eprint.iacr.org\/2016\/687"},{"key":"7_CR8","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. Cryptology ePrint Archive, Report 2016 (2016). http:\/\/eprint.iacr.org\/"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-662-46706-0_3","volume-title":"Fast Software Encryption","author":"A Banerjee","year":"2015","unstructured":"Banerjee, A., Brenner, H., Leurent, G., Peikert, C., Rosen, A.: SPRING: fast pseudorandom functions from rounded ring products. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNCS, vol. 8540, pp. 38\u201357. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46706-0_3"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., Virza, M.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, SP 2014, Berkeley, CA, USA, 18\u201321 May 2014, pp. 459\u2013474. IEEE Computer Society (2014)","DOI":"10.1109\/SP.2014.36"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-78967-3_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"G Bertoni","year":"2008","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Assche, G.: On the indifferentiability of the sponge construction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 181\u2013197. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-78967-3_11"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.jsc.2014.09.025","volume":"70","author":"M Bardet","year":"2014","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B.: On the complexity of the F5 Gr\u00f6bner basis Algorithm. J. Symb. Comput. 70, 49\u201370 (2014)","journal-title":"J. Symb. Comput."},{"key":"7_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0913-3","volume-title":"Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra","author":"T Becker","year":"1993","unstructured":"Becker, T., Kredel, H., Weispfenning, V.: Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra. Springer, New York (1993)"},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-012-9124-7","volume":"26","author":"J Boyar","year":"2013","unstructured":"Boyar, J., Matthews, P., Peralta, R.: Logic minimization techniques with applications to cryptology. J. Cryptology 26(2), 280\u2013312 (2013)","journal-title":"J. Cryptology"},{"key":"7_CR15","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-3-642-30436-1_24","volume-title":"Information Security and Privacy Conference (SEC)","author":"J Boyar","year":"2012","unstructured":"Boyar, J., Peralta, R.: A small depth-16 circuit for the AES S-box. In: Gritzalis, D., Furnell, S., Theoharidou, M. (eds.) Information Security and Privacy Conference (SEC). IFIP Advances in Information and Communication Technology, vol. 376, pp. 287\u2013298. Springer, Heidelberg (2012)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-40084-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"E Ben-Sasson","year":"2013","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: SNARKs for C: verifying program executions succinctly and in zero knowledge. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 90\u2013108. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40084-1_6"},{"key":"7_CR17","unstructured":"Beaulieu, R., Shors, D., Smith, J., Treatman-Clark, S., Weeks, B., Wingers, L.: The SIMON and SPECK families of lightweight block ciphers. Cryptology ePrint Archive, Report 2013\/404 (2013). http:\/\/eprint.iacr.org\/2013\/404"},{"key":"7_CR18","unstructured":"Canteaut, A.: Differential cryptanalysis of feistel ciphers and differentially $$\\delta $$ -uniform mappings. In: Workshop on Selected Areas in Cryptography, SAC 1997, Workshop Record, pp. 172\u2013184 (1997)"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Canteaut, A., Carpov, S., Fontaine, C., Lepoint, T., Naya-Plasencia, M., Paillier, P., Sirdey, R.: Stream ciphers: a practical solution for efficient homomorphic-ciphertext compression. To appear in Proceedings of FSE 2016, available on Cryptology ePrint Archive, Report 2015\/113 (2016). http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-662-52993-5_16"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Costello, C., Fournet, C., Howell, J., Kohlweiss, M., Kreuter, B., Naehrig, M., Parno, B., Zahur, S.: Geppetto: versatile verifiable computation. In: 2015 IEEE Symposium on Security and Privacy, SP 2015, pp. 253\u2013270. IEEE Computer Society (2015)","DOI":"10.1109\/SP.2015.23"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-34047-5_21","volume-title":"Fast Software Encryption","author":"C Carlet","year":"2012","unstructured":"Carlet, C., Goubin, L., Prouff, E., Quisquater, M., Rivain, M.: Higher-order masking schemes for S-boxes. In: Canteaut, A. (ed.) FSE 2012. LNCS, vol. 7549, pp. 366\u2013384. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34047-5_21"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-540-68351-3_18","volume-title":"New Stream Cipher Designs","author":"C Canni\u00e8re","year":"2008","unstructured":"Canni\u00e8re, C., Preneel, B.: Trivium. In: Robshaw, M., Billet, O. (eds.) New Stream Cipher Designs. LNCS, vol. 4986, pp. 244\u2013266. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-68351-3_18"},{"key":"7_CR23","unstructured":"Daemen, J., Peeters, M., Van Assche, G., Rijmen, V.: Nessie proposal: Noekeon. In: First Open NESSIE Workshop (2000)"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BFb0034836","volume-title":"Advances in Cryptology \u2013 ASIACRYPT \u201996","author":"E De Win","year":"1996","unstructured":"De Win, E., Bosselaers, A., Vandenberghe, S., De Gersem, P., Vandewalle, J.: A fast software implementation for arithmetic operations in GF(2n). In: Kim, K., Matsumoto, T. (eds.) Advances in Cryptology \u2013 ASIACRYPT \u201996. Lecture Notes in Computer Science, vol. 1163, pp. 65\u201376. Springer, Berlin Heidelberg (1996)"},{"key":"7_CR25","unstructured":"ENISA. Algorithms, key sizes and parameters report \u2013 2013 recommendations. Technical report, European Union Agency for Network and Information Security, October 2013"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-662-46706-0_2","volume-title":"Fast Software Encryption","author":"V Grosso","year":"2015","unstructured":"Grosso, V., Leurent, G., Standaert, F.-X., Var\u0131c\u0131, K.: LS-designs: bitslice encryption for efficient masked software implementations. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNCS, vol. 8540, pp. 18\u201337. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46706-0_2"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/BFb0052247","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"J Guajardo","year":"1997","unstructured":"Guajardo, J., Paar, C.: Efficient algorithms for elliptic curve cryptosystems. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 342\u2013356. Springer, Heidelberg (1997). doi:10.1007\/BFb0052247"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Grassi, L., Rechberger, C., Rotaru, D., Scholl, P., Smart, N.: MPC-friendly symmetric key primitives. Cryptology ePrint Archive, Report 2016 (2016). http:\/\/eprint.iacr.org\/","DOI":"10.1145\/2976749.2978332"},{"issue":"7","key":"7_CR29","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1109\/12.863045","volume":"49","author":"MA Hasan","year":"2000","unstructured":"Hasan, M.A.: Look-up table-based large finite field multiplication in memory constrained cryptosystems. IEEE Trans. Comput. 49(7), 749\u2013758 (2000)","journal-title":"IEEE Trans. Comput."},{"key":"7_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/3-540-47555-9_14","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 92","author":"G Harper","year":"1993","unstructured":"Harper, G., Menezes, A., Vanstone, S.: Public-key cryptosystems with very small key lengths. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 163\u2013173. Springer, Heidelberg (1993). doi:10.1007\/3-540-47555-9_14"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BFb0052332","volume-title":"Fast Software Encryption","author":"T Jakobsen","year":"1997","unstructured":"Jakobsen, T., Knudsen, L.R.: The interpolation attack on block ciphers. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 28\u201340. Springer, Heidelberg (1997). doi:10.1007\/BFb0052332"},{"issue":"1","key":"7_CR32","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1008208521515","volume":"14","author":"CK Koc","year":"1998","unstructured":"Koc, C.K., Acar, T.: Montgomery multiplication in GF(2k). Des. Codes Crypt. 14(1), 57\u201369 (1998)","journal-title":"Des. Codes Crypt."},{"issue":"1","key":"7_CR33","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF00204800","volume":"8","author":"LR Knudsen","year":"1995","unstructured":"Knudsen, L.R., Nyberg, K.: Provable security against a differential attack. J. Crypt. 8(1), 27\u201337 (1995)","journal-title":"J. Crypt."},{"key":"7_CR34","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17342-4","volume-title":"The Block Cipher Companion","author":"LR Knudsen","year":"2011","unstructured":"Knudsen, L.R., Robshaw, M.: The Block Cipher Companion. Information Security and Cryptography. Springer, Heidelberg (2011)"},{"key":"7_CR35","unstructured":"SCIPR lab. libsnark. https:\/\/github.com\/scipr-lab\/libsnark"},{"key":"7_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-540-71039-4_4","volume-title":"Fast Software Encryption","author":"V Lyubashevsky","year":"2008","unstructured":"Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: SWIFFT: a modest proposal for FFT hashing. In: Nyberg, K. (ed.) FSE 2008. LNCS, vol. 5086, pp. 54\u201372. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-71039-4_4"},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Lebreton, R., Mehrabi, E., Schost, \u00c9.: On the complexity of solving bivariate systems: the case of non-singular solutions. In: Kauers, M. (ed.) International Symposium on Symbolic and Algebraic Computation, ISSAC\u201913, Boston, MA, USA, 26\u201329 June 2013, pp. 251\u2013258. ACM (2013)","DOI":"10.1145\/2465506.2465950"},{"key":"7_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-49890-3_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"P M\u00e9aux","year":"2016","unstructured":"M\u00e9aux, P., Journault, A., Standaert, F.-X., Carlet, C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 311\u2013343. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-49890-3_13"},{"key":"7_CR39","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"1996","unstructured":"Menezes, A.J., Vanstone, S.A., Van Oorschot, P.C.: Handbook of Applied Cryptography, 1st edn. CRC Press Inc., Boca Raton (1996)","edition":"1"},{"key":"7_CR40","unstructured":"NIST. DRAFT FIPS PUB 202, SHA-3 standard: permutation-based hash and extendable-output functions (2014)"},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. In: 38th Annual Symposium on Foundations of Computer Science, FOCS 1997, pp. 458\u2013467. IEEE Computer Society (1997)","DOI":"10.1109\/SFCS.1997.646134"},{"key":"7_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/3-540-48285-7_6","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201993","author":"K Nyberg","year":"1994","unstructured":"Nyberg, K.: Differentially uniform mappings for cryptography. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 55\u201364. Springer, Heidelberg (1994). doi:10.1007\/3-540-48285-7_6"},{"issue":"1","key":"7_CR43","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"SC Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (corresp.). IEEE Trans. Inf. Theory 24(1), 106\u2013110 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"7_CR44","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/2856449","volume":"59","author":"B Parno","year":"2016","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. Commun. ACM 59(2), 103\u2013112 (2016)","journal-title":"Commun. ACM"},{"key":"7_CR45","unstructured":"Shoup, V.: Number theory library 5.5.2 (NTL) for C++. http:\/\/www.shoup.net\/ntl\/"},{"key":"7_CR46","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0304-3975(85)90078-7","volume":"41","author":"H-J Stoss","year":"1985","unstructured":"Stoss, H.-J.: The complexity of evaluating interpolation polynomials. Theor. Comput. Sci. 41, 319\u2013323 (1985)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2016"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53887-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T04:48:06Z","timestamp":1749703686000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-53887-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662538869","9783662538876"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53887-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 November 2016","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":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.asiacrypt2016.org\/","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"}]}}