{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T01:57:55Z","timestamp":1783562275469,"version":"3.55.0"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319612034","type":"print"},{"value":"9783319612041","type":"electronic"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-61204-1_27","type":"book-chapter","created":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T06:02:42Z","timestamp":1498370562000},"page":"537-556","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":105,"title":["SCRAPE: Scalable Randomness Attested by\u00a0Public Entities"],"prefix":"10.1007","author":[{"given":"Ignacio","family":"Cascudo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernardo","family":"David","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,6,26]]},"reference":[{"key":"27_CR1","unstructured":"Adida, B.: Helios: web-based open-audit voting. In: van Oorschot, P.C. (ed.) Proceedings of 17th USENIX Security Symposium, 28 July\u20131 August 2008, San Jose, CA, USA, pp. 335\u2013348. USENIX Association (2008)"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-662-53015-3_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"M Abe","year":"2016","unstructured":"Abe, M., Hoshino, F., Ohkubo, M.: Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 387\u2013415. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-53015-3_14"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-20465-4_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"DF Aranha","year":"2011","unstructured":"Aranha, D.F., Karabina, K., Longa, P., Gebotys, C.H., L\u00f3pez, J.: Faster explicit formulas for computing pairings over ordinary curves. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 48\u201368. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-20465-4_5"},{"key":"27_CR4","unstructured":"Buterin, V., et al.: A next-generation smart contract and decentralized application platform. White paper (2014)"},{"key":"27_CR5","unstructured":"Bonneau, J., Clark, J., Goldfeder, S.: On bitcoin as a public randomness source. Cryptology ePrint Archive, Report 2015\/1015 (2015). http:\/\/eprint.iacr.org\/2015\/1015"},{"key":"27_CR6","unstructured":"Baign\u00e8res, T., Delerabl\u00e9e, C., Finiasz, M., Goubin, L., Lepoint, T., Rivain, M.: Trap me if you can - million dollar curve. Cryptology ePrint Archive, Report 2015\/1249 (2015). http:\/\/eprint.iacr.org\/2015\/1249"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-319-10879-7_11","volume-title":"Security and Cryptography for Networks","author":"C Baum","year":"2014","unstructured":"Baum, C., Damg\u00e5rd, I., Orlandi, C.: Publicly auditable secure multi-party computation. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 175\u2013196. Springer, Cham (2014). doi:10.1007\/978-3-319-10879-7_11"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Bentov, I., Gabizon, A., Mizrahi, A.: Cryptocurrencies without proof of work. In: Clark et al. [CMR+16], pp. 142\u2013157 (2016)","DOI":"10.1007\/978-3-662-53357-4_10"},{"issue":"3","key":"27_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]y. SIGMETRICS Perform. Eval. Rev. 42(3), 34\u201337 (2014)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-662-49301-4_17","volume-title":"The New Codebreakers","author":"DJ Bernstein","year":"2016","unstructured":"Bernstein, D.J., Lange, T., Niederhagen, R.: Dual EC: a standardized back door. In: Ryan, P.Y.A., Naccache, D., Quisquater, J.-J. (eds.) The New Codebreakers. LNCS, vol. 9100, pp. 256\u2013281. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-49301-4_17"},{"key":"27_CR11","unstructured":"Blum, M.: Coin flipping by telephone. In: Gersho, A. (ed.) CRYPTO 1981, vol. ECE report 82-04, pp. 11\u201315. U.C. Santa Barbara, Department of Electrical and Computer Engineering (1981)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006). doi:10.1007\/11693383_22"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Ashby, V. (ed.) ACM CCS 1993, pp. 62\u201373. ACM Press, November 1993","DOI":"10.1145\/168588.168596"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-47942-0_8","volume-title":"Information and Communication Security","author":"F Boudot","year":"1999","unstructured":"Boudot, F., Traor\u00e9, J.: Efficient publicly verifiable secret sharing schemes with fast or delayed recovery. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol. 1726, pp. 87\u2013102. Springer, Heidelberg (1999). doi:10.1007\/978-3-540-47942-0_8"},{"key":"27_CR15","unstructured":"Cascudo, I., David, B.: Scrape: scalable randomness attested by public entities. Cryptology ePrint Archive, Report 2017\/216 (2017). http:\/\/eprint.iacr.org\/2017\/216"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Croman, K., Decker, C., Eyal, I., Gencer, A.E., Juels, A., Kosba, A.E., Miller, A., Saxena, P., Shi, E., Sirer, E.G., Song, D., Wattenhofer, R.: On scaling decentralized blockchains - (a position paper). In: Clark et al. [CMR+16], pp. 106\u2013125 (2016)","DOI":"10.1007\/978-3-662-53357-4_8"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: 26th FOCS, pp. 383\u2013395. IEEE Computer Society Press, October 1985","DOI":"10.1109\/SFCS.1985.64"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: Hartmanis, J. (ed.) Proceedings of 18th Annual ACM Symposium on Theory of Computing, 28\u201330 May 1986, Berkeley, California, USA, pp. 364\u2013369. ACM (1986)","DOI":"10.1145\/12130.12168"},{"key":"27_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Financial Cryptography and Data Security","year":"2016","unstructured":"Clark, J., Meiklejohn, S., Ryan, P.Y.A., Wallach, D.S., Brenner, M., Rohloff, K. (eds.): FC 2016 Workshops. LNCS, vol. 9604. Springer, Heidelberg (2016)"},{"key":"27_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-48071-4_7","volume-title":"Advances in Cryptology \u2014 CRYPTO 1992","author":"D Chaum","year":"1993","unstructured":"Chaum, D., Pedersen, T.P.: Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 89\u2013105. Springer, Heidelberg (1993). doi:10.1007\/3-540-48071-4_7"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Tor: the second-generation onion router. In: Proceedings of 13th Conference on USENIX Security Symposium, SSYM 2004, Berkeley, CA, USA, vol. 13, p. 21. USENIX Association (2004)","DOI":"10.21236\/ADA465464"},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-662-53018-4_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"JP Degabriele","year":"2016","unstructured":"Degabriele, J.P., Paterson, K.G., Schuldt, J.C.N., Woodage, J.: Backdoors in pseudorandom number generators: possibility and impossibility results. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 403\u2013432. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-53018-4_15"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: 28th FOCS, pp. 427\u2013437. IEEE Computer Society Press, October 1987","DOI":"10.1109\/SFCS.1987.4"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0054115","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1998","author":"E Fujisaki","year":"1998","unstructured":"Fujisaki, E., Okamoto, T.: A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 32\u201346. Springer, Heidelberg (1998). doi:10.1007\/BFb0054115"},{"key":"27_CR25","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":"27_CR26","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":"27_CR27","unstructured":"Ghosh, M., Richardson, M., Ford, B., Jansen, R.: A torpath to torcoin: proof-of-bandwidth altcoins for compensating relays. Technical report, DTIC Document (2014)"},{"key":"27_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-04159-4_19","volume-title":"Selected Areas in Cryptography","author":"S Heidarvand","year":"2009","unstructured":"Heidarvand, S., Villar, J.L.: Public verifiability from pairings in secret sharing schemes. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 294\u2013308. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-04159-4_19"},{"key":"27_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-21031-0_21","volume-title":"Information Security Practice and Experience","author":"MP Jhanwar","year":"2011","unstructured":"Jhanwar, M.P.: A practical (non-interactive) publicly verifiable secret sharing scheme. In: Bao, F., Weng, J. (eds.) ISPEC 2011. LNCS, vol. 6672, pp. 273\u2013287. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-21031-0_21"},{"issue":"2","key":"27_CR30","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s10623-014-9952-6","volume":"73","author":"MP Jhanwar","year":"2014","unstructured":"Jhanwar, M.P., Venkateswarlu, A., Safavi-Naini, R.: Ayineedi venkateswarlu, and reihaneh safavi-naini. paillier-based publicly verifiable (non-interactive) secret sharing. Des. Codes Crypt. 73(2), 529\u2013546 (2014)","journal-title":"Des. Codes Crypt."},{"key":"27_CR31","unstructured":"Kiayias, A., Konstantinou, I., Russell, A., David, B., Oliynykov, R.: A provably secure proof-of-stake blockchain protocol. Cryptology ePrint Archive, Report 2016\/889 (2016). http:\/\/eprint.iacr.org\/2016\/889"},{"key":"27_CR32","doi-asserted-by":"crossref","unstructured":"Kosba, A.E., Miller, A., Shi, E., Wen, Z., Papamanthou, C.: Hawk: the blockchain model of cryptography and privacy-preserving smart contracts. In: 2016 IEEE Symposium on Security and Privacy, pp. 839\u2013858. IEEE Computer Society Press, May 2016","DOI":"10.1109\/SP.2016.55"},{"key":"27_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-78440-1_21","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"B Libert","year":"2008","unstructured":"Libert, B., Vergnaud, D.: Unidirectional chosen-ciphertext secure proxy re-encryption. In: Cramer, R. (ed.) PKC 2008. LNCS, vol. 4939, pp. 360\u2013379. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-78440-1_21"},{"key":"27_CR34","unstructured":"Lenstra, A.K., Wesolowski, B.: A random zoo: sloth, unicorn, and trx. Cryptology ePrint Archive, Report 2015\/366 (2015). http:\/\/eprint.iacr.org\/2015\/366"},{"key":"27_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68339-9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 1996","year":"1996","unstructured":"Maurer, U.M. (ed.): EUROCRYPT 1996. LNCS, vol. 1070. Springer, Heidelberg (1996). doi:10.1007\/3-540-68339-9"},{"issue":"9","key":"27_CR36","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"RJ McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and reed-solomon codes. Commun. ACM 24(9), 583\u2013584 (1981)","journal-title":"Commun. ACM"},{"key":"27_CR37","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system (2008)"},{"key":"27_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). doi:10.1007\/3-540-48910-X_16"},{"key":"27_CR39","doi-asserted-by":"crossref","unstructured":"Pointcheval, D., Stern, J.: Security proofs for signature schemes. In: Maurer [Mau96], pp. 387\u2013398 (1996)","DOI":"10.1007\/3-540-68339-9_33"},{"issue":"2","key":"27_CR40","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","volume":"27","author":"MO Rabin","year":"1983","unstructured":"Rabin, M.O.: Transaction protection by beacons. J. Comput. Syst. Sci. 27(2), 256\u2013267 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"27_CR41","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: 21st ACM STOC, pp. 73\u201385. ACM Press. May 1989","DOI":"10.1145\/73007.73014"},{"key":"27_CR42","unstructured":"Ruiz, A., Villar, J.L.: Publicly verifiable secret sharing from Paillier\u2019s cryptosystem. In: Wolf, C., Lucks, S., Yau, P.-W. (eds.) WEWoRC 2005 - Western European Workshop on Research in Cryptology. Leuven, Belgium, 5\u20137 July 2005. LNI, vol. 74, pp. 98\u2013108. GI (2005)"},{"key":"27_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-48405-1_10","volume-title":"Advances in Cryptology \u2014 CRYPTO 1999","author":"B Schoenmakers","year":"1999","unstructured":"Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 148\u2013164. Springer, Heidelberg (1999). doi:10.1007\/3-540-48405-1_10"},{"issue":"11","key":"27_CR44","first-page":"612","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. Assoc. Comput. Mach. 22(11), 612\u2013613 (1979)","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"27_CR45","doi-asserted-by":"crossref","unstructured":"Syta, E., Jovanovic, P., Kokoris Kogias, E., Gailly, N., Gasser, L., Khoffi, I., Fischer, M.J., Ford, B.: Scalable bias-resistant distributed randomness. Cryptology ePrint Archive, Report 2016\/1067 (2016). (To appear at IEEE Security & Privacy 2017). http:\/\/eprint.iacr.org\/2016\/1067","DOI":"10.1109\/SP.2017.45"},{"key":"27_CR46","doi-asserted-by":"crossref","unstructured":"Stadler, M.: Publicly verifiable secret sharing. In: Maurer [Mau96], pp. 190\u2013199 (1996)","DOI":"10.1007\/3-540-68339-9_17"},{"key":"27_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-28166-7_1","volume-title":"Applied Cryptography and Network Security","author":"B Schoenmakers","year":"2015","unstructured":"Schoenmakers, B., Veeningen, M.: Universally verifiable multiparty computation from threshold homomorphic cryptosystems. In: Malkin, T., Kolesnikov, V., Lewko, A.B., Polychronakis, M. (eds.) ACNS 2015. LNCS, vol. 9092, pp. 3\u201322. Springer, Cham (2015). doi:10.1007\/978-3-319-28166-7_1"},{"key":"27_CR48","doi-asserted-by":"crossref","unstructured":"van den Hooff, J., Lazar, D., Zaharia, M., Zeldovich, N.: Vuvuzela: scalable private messaging resistant to traffic analysis. In: Proceedings of 25th Symposium on Operating Systems Principles, SOSP 2015, pp. 137\u2013152. ACM, New York (2015)","DOI":"10.1145\/2815400.2815417"},{"key":"27_CR49","unstructured":"Wolinsky, D.I., Corrigan-Gibbs, H., Ford, B., Johnson, A.: Dissent in numbers: making strong anonymity scale. In: Proceedings of 10th USENIX Conference on Operating Systems Design and Implementation, OSDI 2012, pp. 179\u2013192. USENIX Association, Berkeley (2012)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61204-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T00:57:19Z","timestamp":1750381039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-61204-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319612034","9783319612041"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61204-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"26 June 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kanazawa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"10 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cy2sec.comm.eng.osaka-u.ac.jp\/acns2017\/index.html","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"}]}}