{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:42:41Z","timestamp":1769298161917,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":53,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662538890","type":"print"},{"value":"9783662538906","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-53890-6_30","type":"book-chapter","created":{"date-parts":[[2016,11,8]],"date-time":"2016-11-08T12:11:32Z","timestamp":1478607092000},"page":"902-933","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Indistinguishable Proofs of Work or Knowledge"],"prefix":"10.1007","author":[{"given":"Foteini","family":"Baldimtsi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aggelos","family":"Kiayias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Zacharias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bingsheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,9]]},"reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-44598-6_16","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"G Ateniese","year":"2000","unstructured":"Ateniese, G., Camenisch, J., Joye, M., Tsudik, G.: A practical and provably secure coalition-resistant group signature scheme. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 255\u2013270. Springer, Heidelberg (2000). doi:10.1007\/3-540-44598-6_16"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-642-42045-0_21","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"S Agrawal","year":"2013","unstructured":"Agrawal, S., Dodis, Y., Vaikuntanathan, V., Wichs, D.: On continual leakage of discrete log representations. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 401\u2013420. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-42045-0_21"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-642-25385-0_37","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Aggarwal","year":"2011","unstructured":"Aggarwal, D., Maurer, U.: The leakage-resilience limit of a computational problem is equal to its unpredictability entropy. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 686\u2013701. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-25385-0_37"},{"key":"30_CR4","unstructured":"Back, A.: Hashcash (1997). http:\/\/www.cypherspace.org\/hashcash"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-48405-1_22","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"D Boneh","year":"1999","unstructured":"Boneh, D., Franklin, M.: An efficient public key traitor tracing scheme. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 338\u2013353. Springer, Heidelberg (1999). doi:10.1007\/3-540-48405-1_22"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Goldwasser, S., Jain, A., Paneth, O., Vaikuntanathan, V., Waters, B.: Time-lock puzzles from randomized encodings. In: ITCS (2016)","DOI":"10.1145\/2840728.2840745"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Hamburg, M., Krasnova, A., Lange, T.: Elligator: elliptic-curve points indistinguishable from uniform random strings. In: CCS (2013)","DOI":"10.1145\/2508859.2516734"},{"key":"30_CR8","unstructured":"Baldimtsi, F., Kiayias, A., Zacharias, T., Zhang, B.: Indistinguishable proofs of work or knowledge. Cryptology ePrint Archive, Report 2015\/1230 (2015). http:\/\/eprint.iacr.org\/2015\/1230"},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/2695533.2695545","volume":"42","author":"I Bentov","year":"2014","unstructured":"Bentov, I., Lee, C., Mizrahi, A., Rosenfeld, M.: Proof of activity: extending bitcoin\u2019s proof of work via proof of stake [extended abstract]. SIGMETRICS Perform. Eval. Rev. 42(3), 34\u201337 (2014)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"30_CR10","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444\u20131451 (1987)"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Bonneau, J., Miller, A., Clark, J., Narayanan, A., Kroll, J.A., Felten, E.W.: Sok: research perspectives and challenges for bitcoin and crypto currencies. In: IEEE Symposium on Security and Privacy (2015)","DOI":"10.1109\/SP.2015.14"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: CCS (1993)","DOI":"10.1145\/168588.168596"},{"key":"30_CR13","unstructured":"Brands, S.: An efficient off-line electronic cash system based on the representation problem. In: CWI Technical Report CS-R9323 (1994)"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-48658-5_19","volume-title":"Advances in Cryptology \u2014 CRYPTO 1994","author":"R Cramer","year":"1994","unstructured":"Cramer, R., Damg\u00e5rd, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174\u2013187. Springer, Heidelberg (1994). doi:10.1007\/3-540-48658-5_19"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19\u201340. Springer, Heidelberg (2001). doi:10.1007\/3-540-44647-8_2"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable zero-knowledge (extended abstract). In: STOC (2000)","DOI":"10.1145\/335305.335334"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Canetti, R., Micciancio, D., Reingold, O.: Perfectly one-way probabilistic hash functions (preliminary version). In: STOC (1998)","DOI":"10.1145\/276698.276721"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-10366-7_30","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"L Chen","year":"2009","unstructured":"Chen, L., Morrissey, P., Smart, N.P., Warinschi, B.: Security notions and generic constructions for client puzzles. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 505\u2013523. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-10366-7_30"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-662-49099-0_5","volume-title":"Theory of Cryptography","author":"M Ciampi","year":"2016","unstructured":"Ciampi, M., Persiano, G., Scafuro, A., Siniscalchi, L., Visconti, I.: Improved OR-composition of sigma-protocols. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 112\u2013141. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-49099-0_5"},{"key":"30_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-45146-4_25","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"C Dwork","year":"2003","unstructured":"Dwork, C., Goldberg, A., Naor, M.: On memory-bound functions for fighting spam. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 426\u2013444. Springer, Heidelberg (2003). doi:10.1007\/978-3-540-45146-4_25"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Danezis, G., Meiklejohn, S.: Centrally banked cryptocurrencies. In: NDSS (2016)","DOI":"10.14722\/ndss.2016.23187"},{"key":"30_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology \u2014 CRYPTO 1992","author":"C Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 139\u2013147. Springer, Heidelberg (1993). doi:10.1007\/3-540-48071-4_10"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. In: STOC (1998)","DOI":"10.1145\/276698.276853"},{"key":"30_CR25","unstructured":"Dodis, Y.: On extractors, error-correction and hiding all partial information. In: ITW (2005)"},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Smith, A.: Correcting errors without leaking partial information. In: STOC (2005)","DOI":"10.1145\/1060590.1060688"},{"key":"30_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO 1986","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How To Prove Yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). doi:10.1007\/3-540-47721-7_12"},{"key":"30_CR28","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: STOC (1990)","DOI":"10.1145\/100216.100272"},{"key":"30_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/3-540-44598-6_29","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"R Gennaro","year":"2000","unstructured":"Gennaro, R.: An improved pseudo-random generator based on discrete log. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 469\u2013481. Springer, Heidelberg (2000). doi:10.1007\/3-540-44598-6_29"},{"key":"30_CR30","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Johnson, D.S., Kiayias, A., Yung, M.: Resource-based corruptions and the combinatorics of hidden diversity. In: ITCS (2013)","DOI":"10.1145\/2422436.2422482"},{"key":"30_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-46803-6_10","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Garay","year":"2015","unstructured":"Garay, J., Kiayias, A., Leonardos, N.: The Bitcoin Backbone Protocol: analysis and applications. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 281\u2013310. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46803-6_10"},{"key":"30_CR32","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: STOC (1985)","DOI":"10.1145\/22145.22178"},{"issue":"1","key":"30_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O Goldreich","year":"1994","unstructured":"Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. J. Cryptology 7(1), 1\u201332 (1994)","journal-title":"J. Cryptology"},{"issue":"282","key":"30_CR34","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1090\/S0025-5718-2012-02641-X","volume":"82","author":"SD Galbraith","year":"2013","unstructured":"Galbraith, S.D., Pollard, J.M., Ruprai, R.S.: Computing discrete logarithms in an interval. Math. Comput. 82(282), 1181\u20131195 (2013)","journal-title":"Math. Comput."},{"key":"30_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-540-77026-8_17","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"K Gopalakrishnan","year":"2007","unstructured":"Gopalakrishnan, K., Th\u00e9riault, N., Yao, C.Z.: Solving discrete logarithms from partial knowledge of the key. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol. 4859, pp. 224\u2013237. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-77026-8_17"},{"key":"30_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-13190-5_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"I Haitner","year":"2010","unstructured":"Haitner, I., Holenstein, T., Reingold, O., Vadhan, S., Wee, H.: Universal one-way hash functions via inaccessible entropy. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 616\u2013637. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-13190-5_31"},{"key":"30_CR37","first-page":"12","volume":"28","author":"J H\u00e5stad","year":"1993","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: Construction of a pseudo-random generator from any one-way function. SIAM J. Comput. 28, 12\u201324 (1993)","journal-title":"SIAM J. Comput."},{"key":"30_CR38","unstructured":"Juels, A., Brainard, J.G.: Client puzzles: A cryptographic countermeasure against connection depletion attacks. In: NDSS (1999)"},{"key":"30_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/3-540-38424-3_26","volume-title":"Advances in Cryptology-CRYPT0 1990","author":"D Lapidot","year":"1991","unstructured":"Lapidot, D., Shamir, A.: Publicly verifiable non-interactive zero-knowledge proofs. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 353\u2013365. Springer, Heidelberg (1991). doi:10.1007\/3-540-38424-3_26"},{"key":"30_CR40","unstructured":"Mazieres, D.: The stellar consensus protocol: A federated model for internet-levelconsensus (2015).https:\/\/www.stellar.org\/papers\/stellar-consensus-protocol.pdf"},{"key":"30_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-22792-9_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"M Mahmoody","year":"2011","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.: Time-lock puzzles in the random oracle model. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 39\u201350. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-22792-9_3"},{"key":"30_CR42","unstructured":"Nakamoto, S.: Report (2008). https:\/\/bitcoin.org\/bitcoin.pdf. Accessed 7 Oct. 2015"},{"key":"30_CR43","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: STOC (1989)","DOI":"10.1145\/73007.73011"},{"key":"30_CR44","doi-asserted-by":"crossref","unstructured":"ODwyer, K.J., Malone, D.: Bitcoin mining and its energy footprint. In: ISSC 2014\/CIICT 2014 (2014)","DOI":"10.1049\/cp.2014.0699"},{"key":"30_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-39200-9_10","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"R Pass","year":"2003","unstructured":"Pass, R.: Simulation in quasi-polynomial time, and its application to protocol composition. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 160\u2013176. Springer, Heidelberg (2003). doi:10.1007\/3-540-39200-9_10"},{"key":"30_CR46","unstructured":"Pass, R.: Alternative variants of zero-knowledge proofs. In: Licentiate (Master\u2019s) Thesis, ISBN 91-7283-933-3 (2004)"},{"key":"30_CR47","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: STOC (1990)","DOI":"10.1145\/100216.100269"},{"key":"30_CR48","unstructured":"Rivest, R., Shamir, A., Wagner, D.: Time-lock puzzles and timed-release crypto. Technical report (1996)"},{"key":"30_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/3-540-46885-4_68","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1989","author":"CP Schnorr","year":"1990","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 688\u2013689. Springer, Heidelberg (1990). doi:10.1007\/3-540-46885-4_68"},{"key":"30_CR50","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). doi:10.1007\/3-540-69053-0_18"},{"key":"30_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1998","author":"DR Simon","year":"1998","unstructured":"Simon, D.R.: Finding collisions on a one-way street: can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 334\u2013345. Springer, Heidelberg (1998). doi:10.1007\/BFb0054137"},{"key":"30_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/3-540-46877-3_37","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1990","author":"A Santis","year":"1991","unstructured":"Santis, A., Yung, M.: On the design of provably-secure cryptographic hash functions. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 412\u2013431. Springer, Heidelberg (1991). doi:10.1007\/3-540-46877-3_37"},{"key":"30_CR53","doi-asserted-by":"crossref","unstructured":"Waters, B., Juels, A., Halderman, J.A., Felten, E.W.: New client puzzle outsourcing techniques for dos resistance. In: CCS (2004)","DOI":"10.1145\/1030083.1030117"}],"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-53890-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:09:48Z","timestamp":1709820588000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-53890-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662538890","9783662538906"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53890-6_30","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"}]}}