{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T01:44:57Z","timestamp":1775267097022,"version":"3.50.1"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030026400","type":"print"},{"value":"9783030026417","type":"electronic"}],"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-02641-7_18","type":"book-chapter","created":{"date-parts":[[2018,11,9]],"date-time":"2018-11-09T08:24:09Z","timestamp":1541751849000},"page":"390-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two Cents for Strong Anonymity: The Anonymous Post-office Protocol"],"prefix":"10.1007","author":[{"given":"Nethanel","family":"Gelernter","sequence":"first","affiliation":[]},{"given":"Amir","family":"Herzberg","sequence":"additional","affiliation":[]},{"given":"Hemi","family":"Leibowitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,10]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.F.: Tor: the second-generation onion router. In: USENIX Security Symposium, USENIX, pp. 303\u2013320 (2004)","DOI":"10.21236\/ADA465464"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-642-31680-7_6","volume-title":"Privacy Enhancing Technologies","author":"Y Gilad","year":"2012","unstructured":"Gilad, Y., Herzberg, A.: Spying in the dark: TCP and tor traffic analysis. In: Fischer-H\u00fcbner, S., Wright, M. (eds.) PETS 2012. LNCS, vol. 7384, pp. 100\u2013119. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31680-7_6"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Bauer, K., McCoy, D., Grunwald, D., Kohno, T., Sicker, D.: Low-resource routing attacks against tor. In: Proceedings of the 2007 ACM Workshop on Privacy in Electronic Society, pp. 11\u201320. ACM (2007)","DOI":"10.1145\/1314333.1314336"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Borisov, N., Danezis, G., Mittal, P., Tabriz, P.: Denial of service or denial of security? In: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 92\u2013102. ACM (2007)","DOI":"10.1145\/1315245.1315258"},{"key":"18_CR5","unstructured":"Dingledine, R., Mathewson, N.: Anonymity loves company: usability and the network effect. In: WEIS (2006)"},{"key":"18_CR6","unstructured":"Gelernter, N., Herzberg, A., Leibowitz, H.: Two cents for strong anonymity: the anonymous post-office protocol. Cryptology ePrint Archive, Report 2016\/489 (2016) http:\/\/eprint.iacr.org\/2016\/489"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Farb, M., Burman, M., Chandok, G., McCune, J., Perrig, A.: SafeSlinger: an easy-to-use and secure approach for human trust establishment. Technical report, Technical Report CMU-CyLab-11-021, Carnegie Mellon University (2011)","DOI":"10.21236\/ADA579928"},{"key":"18_CR8","unstructured":"Bellare, M., Rogaway, P.: Asymmetric encryption. http:\/\/cseweb.ucsd.edu\/~mihir\/cse207\/w-asym.pdf"},{"issue":"2","key":"18_CR9","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201390 (1981)","journal-title":"Commun. ACM"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/293411.293443","volume":"42","author":"D Goldschlag","year":"1999","unstructured":"Goldschlag, D., Reed, M., Syverson, P.: Onion routing. Commun. ACM 42(2), 39\u201341 (1999)","journal-title":"Commun. ACM"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/3-540-44448-3_41","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Namprempre, C.: Authenticated encryption: relations among notions and analysis of the generic composition paradigm. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 531\u2013545. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_41"},{"key":"18_CR12","first-page":"451","volume":"267","author":"A Pfitzmann","year":"1991","unstructured":"Pfitzmann, A., Pfitzmann, B., Waidner, M.: ISDN-MIXes: untraceable communication with very small bandwidth overhead. GI\/ITG Conf. Commun. Distrib. Syst. 267, 451\u2013463 (1991)","journal-title":"GI\/ITG Conf. Commun. Distrib. Syst."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Piotrowska, A., Hayes, J., Gelernter, N., Danezis, G., Herzberg, A.: AnNotify: a private notification service. In: Workshop on Privacy in the Electronic Society (WPES 2017) (2017)","DOI":"10.1145\/3139550.3139566"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/3-540-36504-4_18","volume-title":"Financial Cryptography","author":"R Dingledine","year":"2003","unstructured":"Dingledine, R., Syverson, P.: Reliable MIX cascade networks through reputation. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 253\u2013268. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36504-4_18"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Berthold, O., Federrath, H., K\u00f6hntopp, M.: Project \u201canonymity and unobservability in the internet\u201d. In: Proceedings of the Tenth Conference on Computers, Freedom and Privacy: Challenging the Assumptions, pp. 57\u201365. ACM (2000)","DOI":"10.1145\/332186.332211"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-36467-6_9","volume-title":"Privacy Enhancing Technologies","author":"O Berthold","year":"2003","unstructured":"Berthold, O., Langos, H.: Dummy traffic against long term intersection attacks. In: Dingledine, R., Syverson, P. (eds.) PET 2002. LNCS, vol. 2482, pp. 110\u2013128. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36467-6_9"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11423409_2","volume-title":"Privacy Enhancing Technologies","author":"N Mathewson","year":"2005","unstructured":"Mathewson, N., Dingledine, R.: Practical traffic analysis: extending and resisting statistical disclosure. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol. 3424, pp. 17\u201334. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11423409_2"},{"issue":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1330332.1330335","volume":"11","author":"MK Wright","year":"2008","unstructured":"Wright, M.K., Adler, M., Levine, B.N., Shields, C.: Passive-logging attacks against anonymous communications systems. ACM Trans. Inf. Syst. Secur. (TISSEC) 11(2), 3 (2008)","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"},{"key":"18_CR19","unstructured":"Pfitzmann, A., Hansen, M.: A terminology for talking about privacy by data minimization: anonymity, unlinkability, undetectability, unobservability, pseudonymity, and identity management, 34 (2010). http:\/\/dud.inf.tu-dresden.de\/literatur\/Anon_Terminology_v0"},{"issue":"1","key":"18_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.3233\/JCS-2004-12102","volume":"12","author":"D Hughes","year":"2004","unstructured":"Hughes, D., Shmatikov, V.: Information hiding, anonymity and privacy: a modular approach. J. Comput. Secur. 12(1), 3\u201336 (2004)","journal-title":"J. Comput. Secur."},{"issue":"3","key":"18_CR21","doi-asserted-by":"publisher","first-page":"483","DOI":"10.3233\/JCS-2005-13305","volume":"13","author":"J Halpern","year":"2005","unstructured":"Halpern, J., O\u2019Neill, K.: Anonymity and information hiding in multiagent systems. J. Comput. Secur. 13(3), 483\u2013514 (2005)","journal-title":"J. Comput. Secur."},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Pashalidis, A.: Measuring the effectiveness and the fairness of relation hiding systems. In: IEEE Asia-Pacific Services Computing Conference, APSCC 2008, pp. 1387\u20131394. IEEE (2008)","DOI":"10.1109\/APSCC.2008.20"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Tsukada, Y., Mano, K., Sakurada, H., Kawabe, Y.: Anonymity, privacy, onymity, and identity: a modal logic approach. In: International Conference on Computational Science and Engineering, CSE 2009, vol. 3, pp. 42\u201351. IEEE (2009)","DOI":"10.1109\/CSE.2009.251"},{"issue":"1","key":"18_CR24","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/1952982.1952986","volume":"14","author":"J Bohli","year":"2011","unstructured":"Bohli, J., Pashalidis, A.: Relations among privacy notions. ACM Trans. Inf. Syst. Secur. (TISSEC) 14(1), 4 (2011)","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Goriac, I.: An epistemic logic based framework for reasoning about information hiding. In: 2011 Sixth International Conference on Availability, Reliability and Security (ARES), pp. 286\u2013293. IEEE (2011)","DOI":"10.1109\/ARES.2011.49"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-19751-2_9","volume-title":"Formal Aspects of Security and Trust","author":"M Veeningen","year":"2011","unstructured":"Veeningen, M., de Weger, B., Zannone, N.: Modeling identity-related properties and their privacy strength. In: Degano, P., Etalle, S., Guttman, J. (eds.) FAST 2010. LNCS, vol. 6561, pp. 126\u2013140. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19751-2_9"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Backes, M., Goldberg, I., Kate, A., Mohammadi, E.: Provably secure and practical onion routing. In: 2012 IEEE 25th Computer Security Foundations Symposium (CSF), pp. 369\u2013385. IEEE (2012)","DOI":"10.1109\/CSF.2012.32"},{"issue":"3","key":"18_CR28","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/2382448.2382452","volume":"15","author":"J Feigenbaum","year":"2012","unstructured":"Feigenbaum, J., Johnson, A., Syverson, P.: Probabilistic analysis of onion routing in a black-box model. ACM Trans. Inf. Syst. Secur. 15(3), 14:1\u201314:28 (2012)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-540-70630-4_3","volume-title":"Privacy Enhancing Technologies","author":"A Hevia","year":"2008","unstructured":"Hevia, A., Micciancio, D.: An indistinguishability-based characterization of anonymous channels. In: Borisov, N., Goldberg, I. (eds.) PETS 2008. LNCS, vol. 5134, pp. 24\u201343. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70630-4_3"},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Gelernter, N., Herzberg, A.: On the limits of provable anonymity. In: Proceedings of the 12th Annual ACM Workshop on Privacy in the Electronic Society, WPES 2013 (2013)","DOI":"10.1145\/2517840.2517850"},{"key":"18_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-39200-9_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 255\u2013271. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_16"},{"issue":"1","key":"18_CR32","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s001459910004","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R., Halevi, S., Herzberg, A.: Maintaining authenticated communication in the presence of break-ins. J. Cryptol. 13(1), 61\u2013105 (2000)","journal-title":"J. Cryptol."},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Danezis, G., Goldberg, I.: Sphinx: a compact and provably secure mix format. In: 2009 30th IEEE Symposium on Security and Privacy, pp. 269\u2013282. IEEE (2009)","DOI":"10.1109\/SP.2009.15"},{"key":"18_CR34","doi-asserted-by":"crossref","unstructured":"Danezis, G., Dingledine, R., Mathewson, N.: Mixminion: design of a type iii anonymous remailer protocol. In: Proceedings of 2003 Symposium on Security and Privacy, pp. 2\u201315. IEEE (2003)","DOI":"10.1109\/SECPRI.2003.1199323"},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"G\u00fclc\u00fc, C., Tsudik, G.: Mixing email with Babel. In: Ellis, J.T., Neuman, B.C., Balenson, D.M. (eds.) NDSS, pp. 2\u201316. IEEE Computer Society (1996)","DOI":"10.1109\/NDSS.1996.492350"},{"key":"18_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-30108-0_9","volume-title":"Computer Security \u2013 ESORICS 2004","author":"C D\u00edaz","year":"2004","unstructured":"D\u00edaz, C., Sassaman, L., Dewitte, E.: Comparison between two practical mix designs. In: Samarati, P., Ryan, P., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol. 3193, pp. 141\u2013159. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30108-0_9"},{"issue":"1","key":"18_CR37","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00145-002-0128-6","volume":"16","author":"A Beimel","year":"2003","unstructured":"Beimel, A., Dolev, S.: Buses for anonymous message delivery. J. Cryptol. 16(1), 25\u201339 (2003)","journal-title":"J. Cryptol."},{"key":"18_CR38","unstructured":"Corrigan-Gibbs, H., Wolinsky, D.I., Ford, B.: Proactively accountable anonymous messaging in Verdict. In: Proceedings of the 22nd USENIX Conference on Security, pp. 147\u2013162. USENIX Association (2013)"},{"key":"18_CR39","unstructured":"Wolinsky, D.I., Corrigan-Gibbs, H., Ford, B., Johnson, A.: Dissent in numbers: making strong anonymity scale. In: 10th OSDI (2012)"},{"issue":"1","key":"18_CR40","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptol. 1(1), 65\u201375 (1988)","journal-title":"J. Cryptol."},{"key":"18_CR41","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Boneh, D., Mazires, D.: Riposte: an anonymous messaging system handling millions of users. In: IEEE Symposium on Security and Privacy, pp. 321\u2013338. IEEE Computer Society (2015)","DOI":"10.1109\/SP.2015.27"},{"issue":"6","key":"18_CR42","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B Chor","year":"1998","unstructured":"Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM (JACM) 45(6), 965\u2013981 (1998)","journal-title":"J. ACM (JACM)"},{"key":"18_CR43","doi-asserted-by":"crossref","unstructured":"Demmler, D., Herzberg, A., Schneider, T.: RAID-PIR: practical multi-server PIR. In: Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, pp. 45\u201356. ACM (2014)","DOI":"10.1145\/2664168.2664181"},{"key":"18_CR44","doi-asserted-by":"crossref","unstructured":"Sassaman, L., Cohen, B., Mathewson, N.: The Pynchon gate: a secure method of pseudonymous mail retrieval. In: Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, pp. 1\u20139. ACM (2005)","DOI":"10.1145\/1102199.1102201"},{"key":"18_CR45","doi-asserted-by":"crossref","unstructured":"Nipane, N., Dacosta, I., Traynor, P.: \u201cmix-in-place\u201d anonymous networking using secure function evaluation. In: Zakon, R.H., McDermott, J.P., Locasto, M.E. (eds.) ACSAC, pp. 63\u201372. ACM (2011)","DOI":"10.1145\/2076732.2076742"},{"key":"18_CR46","doi-asserted-by":"crossref","unstructured":"Le Blond, S., Choffnes, D., Zhou, W., Druschel, P., Ballani, H., Francis, P.: Towards efficient traffic-analysis resistant anonymity networks. In: Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM, pp. 303\u2013314. ACM (2013)","DOI":"10.1145\/2486001.2486002"},{"key":"18_CR47","doi-asserted-by":"crossref","unstructured":"von Ahn, L., Bortz, A., Hopper, N.J.: K-anonymous message transmission. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, pp. 122\u2013130. ACM (2003)","DOI":"10.1145\/948109.948128"},{"key":"18_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: SOSP, pp. 137\u2013152. ACM (2015)","DOI":"10.1145\/2815400.2815417"},{"key":"18_CR49","unstructured":"Gelernter, N., Herzberg, A.: AnonPoP old anonymous technical report (before the system implementation). Anonymised Technical report, August 2014. https:\/\/sites.google.com\/site\/anonymoustechreports\/home"},{"key":"18_CR50","unstructured":"Gelernter, N., Herzberg, A.: Hide from the NSA: achieving strong anonymity against strong adversaries. In: 2014 IEEE International Conference on Software Science, Technology and Engineering (SWSTE), Doctoral Symposium (2014)"},{"key":"18_CR51","doi-asserted-by":"crossref","unstructured":"Wolinsky, D.I., Syta, E., Ford, B.: Hang with your buddies to resist intersection attacks. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, CCS 2013, pp. 1153\u20131166. ACM, New York (2013)","DOI":"10.1145\/2508859.2516740"},{"key":"18_CR52","doi-asserted-by":"crossref","unstructured":"Herzberg, A., Leibowitz, H.: Can Johnny finally encrypt? Evaluating E2E encryption in popular IM applications. In: ACM Workshop on Socio-Technical Aspects in Security and Trust (STAST) (2016)","DOI":"10.1145\/3046055.3046059"},{"key":"18_CR53","unstructured":"Leibowitz, H., Piotrowska, A., Danezis, G., Herzberg, A.: No right to remain silent: isolating malicious mixes. Cryptology ePrint Archive, Report 2017\/1000 (2017). http:\/\/eprint.iacr.org\/2017\/1000"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02641-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T00:47:37Z","timestamp":1775263657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-02641-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030026400","9783030026417"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02641-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"30 November 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/crypto.ie.cuhk.edu.hk\/cans17\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"88","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}