{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:08:59Z","timestamp":1755839339723,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031092336"},{"type":"electronic","value":"9783031092343"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-09234-3_36","type":"book-chapter","created":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T07:23:45Z","timestamp":1655450625000},"page":"727-747","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["FAST: Fair Auctions via\u00a0Secret Transactions"],"prefix":"10.1007","author":[{"given":"Bernardo","family":"David","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorenzo","family":"Gentile","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohsen","family":"Pourpouneh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,18]]},"reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-45664-3_8","volume-title":"Public Key Cryptography","author":"M Abe","year":"2002","unstructured":"Abe, M., Suzuki, K.: M + 1-st price auction using homomorphic encryption. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 115\u2013124. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45664-3_8"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Andrychowicz, M., Dziembowski, S., Malinowski, D., Mazurek, L.: Secure multiparty computations on bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 443\u2013458. IEEE Computer Society Press, May 2014","DOI":"10.1109\/SP.2014.35"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"2042","DOI":"10.1109\/TIFS.2019.2955793","volume":"15","author":"S Bag","year":"2019","unstructured":"Bag, S., Hao, F., Shahandashti, S.F., Ray, I.G.: Seal: sealed-bid auction without auctioneers. IEEE Trans. Inf. Forensics Secur. 15, 2042\u20132052 (2019)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-46088-8_28","volume-title":"Financial Cryptography","author":"O Baudron","year":"2002","unstructured":"Baudron, O., Stern, J.: Non-interactive private auctions. In: Syverson, P. (ed.) FC 2001. LNCS, vol. 2339, pp. 364\u2013377. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46088-8_28"},{"key":"36_CR5","first-page":"207","volume":"2020","author":"C Baum","year":"2020","unstructured":"Baum, C., David, B., Dowsley, R.: A framework for universally composable publicly verifiable cryptographic protocols. IACR Cryptol. ePrint Arch. 2020, 207 (2020)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-030-51280-4_22","volume-title":"Financial Cryptography and Data Security","author":"C Baum","year":"2020","unstructured":"Baum, C., David, B., Dowsley, R.: Insured MPC: efficient secure computation with financial penalties. In: Bonneau, J., Heninger, N. (eds.) FC 2020. LNCS, vol. 12059, pp. 404\u2013420. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51280-4_22"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-030-64375-1_10","volume-title":"Theory of Cryptography","author":"F Benhamouda","year":"2020","unstructured":"Benhamouda, F., et al.: Can a public blockchain keep a secret? In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 260\u2013290. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_10"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-662-44381-1_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"I Bentov","year":"2014","unstructured":"Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 421\u2013439. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_24"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-319-70697-9_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"I Bentov","year":"2017","unstructured":"Bentov, I., Kumaresan, R., Miller, A.: Instantaneous decentralized poker. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 410\u2013440. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_15"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11889663_10","volume-title":"Financial Cryptography and Data Security","author":"P Bogetoft","year":"2006","unstructured":"Bogetoft, P., Damg\u00e5rd, I., Jakobsen, T., Nielsen, K., Pagter, J., Toft, T.: A practical implementation of secure auctions based on multiparty integer computation. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 142\u2013147. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889663_10"},{"key":"36_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-45126-6_16","volume-title":"Financial Cryptography","author":"F Brandt","year":"2003","unstructured":"Brandt, F.: Fully private auctions in a constant number of rounds. In: Wright, R.N. (ed.) FC 2003. LNCS, vol. 2742, pp. 223\u2013238. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45126-6_16"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy, pp. 315\u2013334. IEEE Computer Society Press, May 2018","DOI":"10.1109\/SP.2018.00020"},{"key":"36_CR13","unstructured":"Camenisch, J., Stadler, M.: Proof systems for general statements about discrete logarithms. Technical Report\/ETH Zurich, Department of Computer Science, vol. 260 (1997)"},{"issue":"1","key":"36_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-030-64840-4_11","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"I Cascudo","year":"2020","unstructured":"Cascudo, I., David, B.: ALBATROSS: publicly AttestabLe BATched randomness based on secret sharing. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 311\u2013341. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_11"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: 18th ACM STOC, pp. 364\u2013369. ACM Press, May 1986","DOI":"10.1145\/12130.12168"},{"key":"36_CR17","unstructured":"Cramton, P., et al.: Spectrum auctions. In: Handbook of Telecommunications Economics, vol. 1, pp. 605\u2013639 (2002)"},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-662-58387-6_27","volume-title":"Financial Cryptography and Data Security","author":"B David","year":"2018","unstructured":"David, B., Dowsley, R., Larangeira, M.: Kaleidoscope: an efficient poker protocol with payment distribution and penalty enforcement. In: Meiklejohn, S., Sako, K. (eds.) FC 2018. LNCS, vol. 10957, pp. 500\u2013519. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-58387-6_27"},{"key":"36_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-78375-8_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B David","year":"2018","unstructured":"David, B., Ga\u017ei, P., Kiayias, A., Russell, A.: Ouroboros praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 66\u201398. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_3"},{"key":"36_CR20","unstructured":"David, B., Gentile, L., Pourpouneh, M.: FAST: fair auctions via secret transactions. Cryptology ePrint Archive, Report 2021\/264 (2021). https:\/\/ia.cr\/2021\/264"},{"key":"36_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-030-57808-4_16","volume-title":"Applied Cryptography and Network Security","author":"D Deuber","year":"2020","unstructured":"Deuber, D., D\u00f6ttling, N., Magri, B., Malavolta, G., Thyagarajan, S.A.K.: Minting mechanism for proof of stake blockchains. In: Conti, M., Zhou, J., Casalicchio, E., Spognardi, A. (eds.) ACNS 2020. LNCS, vol. 12146, pp. 315\u2013334. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57808-4_16"},{"issue":"5","key":"36_CR22","doi-asserted-by":"publisher","first-page":"587","DOI":"10.3233\/JCS-150535","volume":"23","author":"J Dreier","year":"2015","unstructured":"Dreier, J., Dumas, J.-G., Lafourcade, P.: Brandt\u2019s fully private auction protocol revisited. J. Comput. Secur. 23(5), 587\u2013610 (2015)","journal-title":"J. Comput. Secur."},{"issue":"5","key":"36_CR23","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/32.502223","volume":"22","author":"MK Franklin","year":"1996","unstructured":"Franklin, M.K., Reiter, M.K.: The design and implementation of a secure auction service. IEEE Trans. Softw. Eng. 22(5), 302\u2013312 (1996)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"36_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/978-3-030-43725-1_14","volume-title":"Financial Cryptography and Data Security","author":"HS Galal","year":"2020","unstructured":"Galal, H.S., Youssef, A.M.: Trustee: full privacy preserving Vickrey auction on top of ethereum. In: Bracciali, A., Clark, J., Pintore, F., R\u00f8nne, P.B., Sala, M. (eds.) FC 2019. LNCS, vol. 11599, pp. 190\u2013207. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43725-1_14"},{"key":"36_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-04904-0_28","volume-title":"Security Protocols","author":"F Hao","year":"2009","unstructured":"Hao, F., Zieli\u0144ski, P.: A 2-round anonymous veto protocol. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2006. LNCS, vol. 5087, pp. 202\u2013211. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04904-0_28"},{"key":"36_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-662-44381-1_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"Y Ishai","year":"2014","unstructured":"Ishai, Y., Ostrovsky, R., Zikas, V.: Secure multi-party computation with identifiable abort. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 369\u2013386. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_21"},{"key":"36_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-36504-4_6","volume-title":"Financial Cryptography","author":"A Juels","year":"2003","unstructured":"Juels, A., Szydlo, M.: A two-server, sealed-bid auction protocol. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 72\u201386. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36504-4_6"},{"key":"36_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-63688-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"A Kiayias","year":"2017","unstructured":"Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 357\u2013388. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_12"},{"key":"36_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1007\/978-3-662-49896-5_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"A Kiayias","year":"2016","unstructured":"Kiayias, A., Zhou, H.-S., Zikas, V.: Fair and robust multi-party computation using a global transaction ledger. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 705\u2013734. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_25"},{"key":"36_CR30","doi-asserted-by":"publisher","DOI":"10.1515\/9780691186290","volume-title":"Auctions: Theory and Practice","author":"P Klemperer","year":"2004","unstructured":"Klemperer, P.: Auctions: Theory and Practice. Princeton University Press, Princeton (2004)"},{"key":"36_CR31","volume-title":"Auction Theory","author":"V Krishna","year":"2009","unstructured":"Krishna, V.: Auction Theory. Academic Press, Cambridge (2009)"},{"key":"36_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-45853-0_2","volume-title":"Computer Security \u2014 ESORICS 2002","author":"K Kurosawa","year":"2002","unstructured":"Kurosawa, K., Ogata, W.: Bit-slice auction circuit. In: Gollmann, D., Karjoth, G., Waidner, M. (eds.) ESORICS 2002. LNCS, vol. 2502, pp. 24\u201338. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45853-0_2"},{"key":"36_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-36504-4_7","volume-title":"Financial Cryptography","author":"H Lipmaa","year":"2003","unstructured":"Lipmaa, H., Asokan, N., Niemi, V.: Secure Vickrey auctions without threshold trust. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, pp. 87\u2013101. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36504-4_7"},{"key":"36_CR34","volume-title":"Microeconomic Theory","author":"A Mas-Colell","year":"1995","unstructured":"Mas-Colell, A., Whinston, M.D., Green, J.R., et al.: Microeconomic Theory, vol. 1. Oxford University Press, New York (1995)"},{"key":"36_CR35","unstructured":"Maxwell, G.: Confidential transactions (2016). https:\/\/people.xiph.org\/~greg\/confidential_values.txt"},{"key":"36_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-642-03356-8_32","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"PB Miltersen","year":"2009","unstructured":"Miltersen, P.B., Nielsen, J.B., Triandopoulos, N.: Privacy-enhancing auctions using rational cryptography. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 541\u2013558. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_32"},{"key":"36_CR37","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)"},{"issue":"4","key":"36_CR38","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF01384489","volume":"2","author":"H Nurmi","year":"1993","unstructured":"Nurmi, H., Salomaa, A.: Cryptographic protocols for Vickrey auctions. Group Decis. Negot. 2(4), 363\u2013373 (1993). https:\/\/doi.org\/10.1007\/BF01384489","journal-title":"Group Decis. Negot."},{"key":"36_CR39","unstructured":"Pass, R., Shi, E.: Hybrid consensus: efficient consensus in the permissionless model. In: Richa, A.W. (ed.) 31st International Symposium on Distributed Computing, DISC 2017, volume 91 of LIPIcs, Vienna, Austria, 16\u201320 October 2017, pp. 39:1\u201339:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"36_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"issue":"1","key":"36_CR41","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey, W.: Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16(1), 8\u201337 (1961)","journal-title":"J. Finance"}],"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-031-09234-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T19:42:07Z","timestamp":1671478927000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09234-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031092336","9783031092343"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09234-3_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 June 2022","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":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/di.uniroma1.it\/acns2022\/","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - 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 (provided by the conference organizers)"}},{"value":"3.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the Workshops, 52 papers were submitted, from which 31 were accepted. Additionally they include 5 posters.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}