{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T03:32:20Z","timestamp":1768015940985,"version":"3.49.0"},"publisher-location":"Cham","reference-count":46,"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_28","type":"book-chapter","created":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T06:02:42Z","timestamp":1498370562000},"page":"557-578","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["cMix: Mixing with Minimal Real-Time Asymmetric Cryptographic Operations"],"prefix":"10.1007","author":[{"given":"David","family":"Chaum","sequence":"first","affiliation":[]},{"given":"Debajyoti","family":"Das","sequence":"additional","affiliation":[]},{"given":"Farid","family":"Javani","sequence":"additional","affiliation":[]},{"given":"Aniket","family":"Kate","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Krasnova","sequence":"additional","affiliation":[]},{"given":"Joeri","family":"De Ruiter","sequence":"additional","affiliation":[]},{"given":"Alan T.","family":"Sherman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,26]]},"reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-73420-8_43","volume-title":"Automata, Languages and Programming","author":"B Adida","year":"2007","unstructured":"Adida, B., Wikstr\u00f6m, D.: Offline\/online mixing. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 484\u2013495. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-73420-8_43"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Backes, M., Goldberg, I., Kate, A., Mohammadi, E.: Provably secure and practical onion routing. In: Proceeding of the 25th IEEE Computer Security Foundations Symposium (CSF), pp. 369\u2013385 (2012)","DOI":"10.1109\/CSF.2012.32"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Backes, M., Kate, A., Mohammadi, E.: Ace: an efficient key-exchange protocol for onion routing. In: Proceeding of the 11th ACM Workshop on Privacy in the Electronic Society (WPES), pp. 55\u201364 (2012)","DOI":"10.1145\/2381966.2381974"},{"key":"28_CR4","unstructured":"Benaloh, J.: Simple verifiable elections. In: Proceeding of USENIX\/Accurate Electronic Voting Technology Workshop (EVT), p. 5 (2006)"},{"issue":"2","key":"28_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s13389-012-0027-1","volume":"2","author":"DJ Bernstein","year":"2012","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.Y.: High-speed high-security signatures. J. Cryptogr. Eng. 2(2), 77\u201389 (2012)","journal-title":"J. Cryptogr. Eng."},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-44702-4_3","volume-title":"Designing Privacy Enhancing Technologies","author":"O Berthold","year":"2001","unstructured":"Berthold, O., Pfitzmann, A., Standtke, R.: The disadvantages of free MIX routes and how to overcome them. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 30\u201345. Springer, Heidelberg (2001). doi:10.1007\/3-540-44702-4_3"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-40041-4_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Lewi, K., Montgomery, H., Raghunathan, A.: Key homomorphic PRFs and their applications. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 410\u2013428. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40041-4_23"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/11535218_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J Camenisch","year":"2005","unstructured":"Camenisch, J., Lysyanskaya, A.: A formal treatment of onion routing. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 169\u2013187. Springer, Heidelberg (2005). doi:10.1007\/11535218_11"},{"issue":"2","key":"28_CR9","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"4","author":"D Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 4(2), 84\u201388 (1981)","journal-title":"Commun. ACM"},{"key":"28_CR10","unstructured":"Chaum, D., Das, D., Javani, F., Kate, A., Krasnova, A., Ruiter, J.D., Sherman, A.T.: cMix: mixing with minimal real-time asymmetric cryptographic operations. Cryptology ePrint Archive, Report 2016\/008 (2016). https:\/\/eprint.iacr.org\/2016\/008.pdf"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Chen, C., Asoni, D.E., Barrera, D., Danezis, G., Perrig, A.: HORNET: high-speed onion routing at the network layer. In: Proceeding of the 22nd ACM Conference on Computer and Communications Security, pp. 1441\u20131454 (2015)","DOI":"10.1145\/2810103.2813628"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11423409_3","volume-title":"Privacy Enhancing Technologies","author":"G Danezis","year":"2005","unstructured":"Danezis, G.: The traffic analysis of continuous-time mixes. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol. 3424, pp. 35\u201350. Springer, Heidelberg (2005). doi:10.1007\/11423409_3"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-75551-7_3","volume-title":"Privacy Enhancing Technologies","author":"G Danezis","year":"2007","unstructured":"Danezis, G., Diaz, C., Troncoso, C.: Two-sided statistical disclosure attack. In: Borisov, N., Golle, P. (eds.) PET 2007. LNCS, vol. 4776, pp. 30\u201344. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-75551-7_3"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-30114-1_21","volume-title":"Information Hiding","author":"G Danezis","year":"2004","unstructured":"Danezis, G., Serjantov, A.: Statistical disclosure or intersection attacks on anonymity systems. In: Fridrich, J. (ed.) IH 2004. LNCS, vol. 3200, pp. 293\u2013308. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-30114-1_21"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Tor: the second-generation onion router. In: Proceeding of the 13th USENIX Security Symposium, pp. 303\u2013320 (2004)","DOI":"10.21236\/ADA465464"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11423409_12","volume-title":"Privacy Enhancing Technologies","author":"R Dingledine","year":"2005","unstructured":"Dingledine, R., Shmatikov, V., Syverson, P.: Synchronous batching: from cascades to free routes. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol. 3424, pp. 186\u2013206. Springer, Heidelberg (2005). doi:10.1007\/11423409_12"},{"issue":"4","key":"28_CR17","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D Dolev","year":"1990","unstructured":"Dolev, D., Reischuk, R., Strong, H.R.: Early stopping in byzantine agreement. J. ACM 37(4), 720\u2013741 (1990)","journal-title":"J. ACM"},{"key":"28_CR18","unstructured":"Evans, N.S., Dingledine, R., Grothoff, C.: A practical congestion attack on tor using long paths. In: Proceeding of the 18th USENIX Security Symposium, pp. 33\u201350 (2009)"},{"key":"28_CR19","unstructured":"Galteland, H., Mj\u00f8lsnes, S.F., Olimid, R.F.: Attacks on cMix - some small overlooked details. Cryptology ePrint Archive, Report 2016\/729 (2016). http:\/\/eprint.iacr.org\/2016\/729"},{"issue":"2","key":"28_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10623-011-9604-z","volume":"67","author":"I Goldberg","year":"2013","unstructured":"Goldberg, I., Stebila, D., Ustaoglu, B.: Anonymity and one-way authentication in key exchange protocols. Des. Codes Crypt. 67(2), 245\u2013269 (2013)","journal-title":"Des. Codes Crypt."},{"issue":"2","key":"28_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/293411.293443","volume":"42","author":"DM Goldschlag","year":"1999","unstructured":"Goldschlag, D.M., Reed, M.G., Syverson, P.F.: Onion routing. Commun. ACM 42(2), 39\u201341 (1999)","journal-title":"Commun. ACM"},{"issue":"2","key":"28_CR22","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1995","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281\u2013308 (1995)","journal-title":"SIAM J. Comput."},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-24660-2_14","volume-title":"Topics in Cryptology \u2013 CT-RSA 2004","author":"P Golle","year":"2004","unstructured":"Golle, P., Jakobsson, M., Juels, A., Syverson, P.: Universal re-encryption for mixnets. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 163\u2013178. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-24660-2_14"},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-68697-5_16","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"S Halevi","year":"1996","unstructured":"Halevi, S., Micali, S.: Practical and provably-secure commitment schemes from collision-free hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 201\u2013215. Springer, Heidelberg (1996). doi:10.1007\/3-540-68697-5_16"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Jakobsson, M.: Flash mixing. In: Proceedings of 18th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 83\u201389 (1999)","DOI":"10.1145\/301308.301333"},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Juels, A.: An optimally robust hybrid mix network. In: Proceedings of 20th Annual ACM Symposium on Principles of Distributed Computing, pp. 284\u2013292 (2001)","DOI":"10.1145\/383962.384046"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Jansen, R., Tschorsch, F., Johnson, A., Scheuermann, B.: The sniper attack: anonymously deanonymizing and disabling the Tor network. In: Proceedings of Network and Distributed System Security Symposium (NDSS 2014) (2014)","DOI":"10.14722\/ndss.2014.23288"},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-642-14577-3_30","volume-title":"Financial Cryptography and Data Security","author":"A Kate","year":"2010","unstructured":"Kate, A., Goldberg, I.: Using Sphinx to improve onion routing circuit construction. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 359\u2013366. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-14577-3_30"},{"issue":"4","key":"28_CR29","doi-asserted-by":"publisher","first-page":"29:1","DOI":"10.1145\/1880022.1880023","volume":"13","author":"A Kate","year":"2010","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Pairing-based onion routing with improved forward secrecy. ACM Trans. Inf. Syst. Secur. 13(4), 29:1\u201329:32 (2010)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"28_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-642-36095-4_8","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"S Khazaei","year":"2013","unstructured":"Khazaei, S., Wikstr\u00f6m, D.: Randomized partial checking revisited. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol. 7779, pp. 115\u2013128. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-36095-4_8"},{"issue":"2","key":"28_CR31","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1515\/popets-2016-0008","volume":"2016","author":"A Kwon","year":"2016","unstructured":"Kwon, A., Lazar, D., Devadas, S., Ford, B.: Riffle: an efficient communication system with strong anonymity. PoPETs 2016(2), 115\u2013134 (2016)","journal-title":"PoPETs"},{"key":"28_CR32","doi-asserted-by":"crossref","unstructured":"Murdoch, S.J., Danezis, G.: Low-cost traffic analysis of Tor. In: Proceedings of 26th IEEE Symposium on Security and Privacy, pp. 183\u2013195 (2005)","DOI":"10.1109\/SP.2005.12"},{"key":"28_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-44448-3_14","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Ohkubo","year":"2000","unstructured":"Ohkubo, M., Abe, M.: A length-invariant hybrid mix. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 178\u2013191. Springer, Heidelberg (2000). doi:10.1007\/3-540-44448-3_14"},{"key":"28_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-540-75551-7_9","volume-title":"Privacy Enhancing Technologies","author":"L \u00d8verlier","year":"2007","unstructured":"\u00d8verlier, L., Syverson, P.: Improving efficiency and simplicity of tor circuit establishment and hidden services. In: Borisov, N., Golle, P. (eds.) PET 2007. LNCS, vol. 4776, pp. 134\u2013152. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-75551-7_9"},{"key":"28_CR35","doi-asserted-by":"crossref","unstructured":"\u00d8verlier, L., Syverson, P.F.: Locating hidden servers. In: Proceedings of 27th IEEE Symposium on Security and Privacy, pp. 100\u2013114 (2006)","DOI":"10.1109\/SP.2006.24"},{"key":"28_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-48285-7_21","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201993","author":"C Park","year":"1994","unstructured":"Park, C., Itoh, K., Kurosawa, K.: Efficient anonymous channel and all\/nothing election scheme. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 248\u2013259. Springer, Heidelberg (1994). doi:10.1007\/3-540-48285-7_21"},{"key":"28_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-39805-8_29","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201985","author":"A Pfitzmann","year":"1986","unstructured":"Pfitzmann, A., Waidner, M.: Networks without user observability \u2013 design options. In: Pichler, F. (ed.) EUROCRYPT 1985. LNCS, vol. 219, pp. 245\u2013253. Springer, Heidelberg (1986). doi:10.1007\/3-540-39805-8_29"},{"key":"28_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/BFb0053448","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201994","author":"B Pfitzmann","year":"1995","unstructured":"Pfitzmann, B.: Breaking an efficient anonymous channel. In: Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 332\u2013340. Springer, Heidelberg (1995). doi:10.1007\/BFb0053448"},{"key":"28_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-44702-4_2","volume-title":"Designing Privacy Enhancing Technologies","author":"J-F Raymond","year":"2001","unstructured":"Raymond, J.-F.: Traffic analysis: protocols, attacks, design issues, and open problems. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 10\u201329. Springer, Heidelberg (2001). doi:10.1007\/3-540-44702-4_2"},{"issue":"4","key":"28_CR40","first-page":"482","volume":"16","author":"M Reed","year":"1998","unstructured":"Reed, M., Syverson, P., Goldschlag, D.: Anonymous connections and onion routing. IEEE J-SAC 16(4), 482\u2013494 (1998)","journal-title":"IEEE J-SAC"},{"key":"28_CR41","doi-asserted-by":"crossref","unstructured":"Ruffing, T., Moreno-Sanchez, P., Kate, A.: P2P mixing and unlinkable Bitcoin transactions. In: NDSS 2017 (2017)","DOI":"10.14722\/ndss.2017.23415"},{"key":"28_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-36415-3_3","volume-title":"Information Hiding","author":"A Serjantov","year":"2003","unstructured":"Serjantov, A., Dingledine, R., Syverson, P.: From a trickle to a flood: active attacks on several mix types. In: Petitcolas, F.A.P. (ed.) IH 2002. LNCS, vol. 2578, pp. 36\u201352. Springer, Heidelberg (2003). doi:10.1007\/3-540-36415-3_3"},{"key":"28_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-540-39650-5_7","volume-title":"Computer Security \u2013 ESORICS 2003","author":"A Serjantov","year":"2003","unstructured":"Serjantov, A., Sewell, P.: Passive attack analysis for connection-based anonymity systems. In: Snekkenes, E., Gollmann, D. (eds.) ESORICS 2003. LNCS, vol. 2808, pp. 116\u2013131. Springer, Heidelberg (2003). doi:10.1007\/978-3-540-39650-5_7"},{"issue":"2","key":"28_CR44","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"TK Srikanth","year":"1987","unstructured":"Srikanth, T.K., Toueg, S.: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distrib. Comput. 2(2), 80\u201394 (1987)","journal-title":"Distrib. Comput."},{"key":"28_CR45","unstructured":"Sun, Y., Edmundson, A., Vanbever, L., Li, O., Rexford, J., Chiang, M., Mittal, P.: Raptor: routing attacks on privacy in Tor. In: Proceedings of 24th USENIX Security Symposium, pp. 271\u2013286 (2015)"},{"key":"28_CR46","unstructured":"The Tor project (2003). https:\/\/www.torproject.org\/. Accessed April 2017"}],"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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T00:57:17Z","timestamp":1750381037000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-61204-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319612034","9783319612041"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61204-1_28","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"}]}}