{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:08:13Z","timestamp":1765112893614,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384293","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"280-293","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Better secret sharing via robust conditional disclosure of secrets"],"prefix":"10.1145","author":[{"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[{"name":"Tel Aviv University, Israel"}]},{"given":"Amos","family":"Beimel","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev, Israel"}]},{"given":"Oded","family":"Nir","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}]},{"given":"Naty","family":"Peter","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev, Israel"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"118","volume-title":"EUROCRYPT 2001 ( LNCS), B. Pfitzmann (Ed.)","volume":"2045","author":"Aiello B.","unstructured":"B. Aiello , Y. Ishai , and O. Reingold . 2001. Priced Oblivious Transfer: How to Sell Digital Goods . In EUROCRYPT 2001 ( LNCS), B. Pfitzmann (Ed.) , Vol. 2045 . Springer-Verlag , 118 - 134 . B. Aiello, Y. Ishai, and O. Reingold. 2001. Priced Oblivious Transfer: How to Sell Digital Goods. In EUROCRYPT 2001 ( LNCS), B. Pfitzmann (Ed.), Vol. 2045. Springer-Verlag, 118-134."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03807-6_12"},{"key":"e_1_3_2_1_3_1","first-page":"441","volume-title":"Secret-Sharing Schemes for General and Uniform Access Structures. In EUROCRYPT 2019 ( LNCS ), Y. Ishai and V. Rijmen (Eds.)","volume":"11478","author":"Applebaum B.","unstructured":"B. Applebaum , A. Beimel , O. Farr\u00e0s , O. Nir , and N. Peter . 2019 . Secret-Sharing Schemes for General and Uniform Access Structures. In EUROCRYPT 2019 ( LNCS ), Y. Ishai and V. Rijmen (Eds.) , Vol. 11478 . Springer-Verlag , 441 - 471 . B. Applebaum, A. Beimel, O. Farr\u00e0s, O. Nir, and N. Peter. 2019. Secret-Sharing Schemes for General and Uniform Access Structures. In EUROCRYPT 2019 ( LNCS ), Y. Ishai and V. Rijmen (Eds.), Vol. 11478. Springer-Verlag, 441-471."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"B. Applebaum A. Beimel O. Nir and N. Peter. 2020. Better Secret Sharing via Robust Conditional Disclosure of Secrets. Electronic Colloquium on Computational Complexity (ECCC) 27 ( 2020 ) 8.  B. Applebaum A. Beimel O. Nir and N. Peter. 2020. Better Secret Sharing via Robust Conditional Disclosure of Secrets. Electronic Colloquium on Computational Complexity (ECCC) 27 ( 2020 ) 8.","DOI":"10.1145\/3357713.3384293"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_31"},{"key":"e_1_3_2_1_6_1","first-page":"62","volume-title":"Menezes and S. A. Vanstone (Eds.)","volume":"537","author":"Beaver D.","unstructured":"D. Beaver , J. Feigenbaum , J. Kilian , and P. Rogaway . 1990. Security with Low Communication Overhead. In CRYPTO ' 90 ( LNCS ), A. J . Menezes and S. A. Vanstone (Eds.) , Vol. 537 . Springer-Verlag , 62 - 76 . D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. 1990. Security with Low Communication Overhead. In CRYPTO ' 90 ( LNCS ), A. J. Menezes and S. A. Vanstone (Eds.), Vol. 537. Springer-Verlag, 62-76."},{"key":"e_1_3_2_1_8_1","first-page":"11","volume-title":"Secret-Sharing Schemes: A Survey. In Coding and Cryptology-Third International Workshop, IWCC 2011 ( LNCS ), Y. Meng Chee, Z. Guo, S. Ling, F. Shao, Y. Tang, H. Wang, and C. Xing (Eds.)","volume":"6639","author":"Beimel A.","year":"2011","unstructured":"A. Beimel . 2011 . Secret-Sharing Schemes: A Survey. In Coding and Cryptology-Third International Workshop, IWCC 2011 ( LNCS ), Y. Meng Chee, Z. Guo, S. Ling, F. Shao, Y. Tang, H. Wang, and C. Xing (Eds.) , Vol. 6639 . Springer-Verlag , 11 - 46 . A. Beimel. 2011. Secret-Sharing Schemes: A Survey. In Coding and Cryptology-Third International Workshop, IWCC 2011 ( LNCS ), Y. Meng Chee, Z. Guo, S. Ling, F. Shao, Y. Tang, H. Wang, and C. Xing (Eds.), Vol. 6639. Springer-Verlag, 11-46."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.335890"},{"key":"e_1_3_2_1_10_1","first-page":"394","volume-title":"Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. In TCC 2017 ( LNCS ), Y. Kalai and L. Reyzin (Eds.)","volume":"10678","author":"Beimel A.","unstructured":"A. Beimel , O. Farr\u00e0s , Y. Mintz , and N. Peter . 2017 . Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. In TCC 2017 ( LNCS ), Y. Kalai and L. Reyzin (Eds.) , Vol. 10678 . Springer-Verlag , 394 - 423 . A. Beimel, O. Farr\u00e0s, Y. Mintz, and N. Peter. 2017. Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. In TCC 2017 ( LNCS ), Y. Kalai and L. Reyzin (Eds.), Vol. 10678. Springer-Verlag, 394-423."},{"volume-title":"Distribution Design. In Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science. ACM, 81-92","author":"Beimel A.","key":"e_1_3_2_1_11_1","unstructured":"A. Beimel , A. Gabizon , Y. Ishai , and E. Kushilevitz . 2016 . Distribution Design. In Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science. ACM, 81-92 . A. Beimel, A. Gabizon, Y. Ishai, and E. Kushilevitz. 2016. Distribution Design. In Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science. ACM, 81-92."},{"key":"e_1_3_2_1_12_1","first-page":"332","volume-title":"Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols. In ASIACRYPT 2018 ( LNCS ), T. Peyrin and S. D. Galbraith (Eds.)","volume":"11274","author":"Beimel A.","unstructured":"A. Beimel and N. Peter . 2018 . Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols. In ASIACRYPT 2018 ( LNCS ), T. Peyrin and S. D. Galbraith (Eds.) , Vol. 11274 . Springer-Verlag , 332 - 362 . A. Beimel and N. Peter. 2018. Optimal Linear Multiparty Conditional Disclosure of Secrets Protocols. In ASIACRYPT 2018 ( LNCS ), T. Peyrin and S. D. Galbraith (Eds.), Vol. 11274. Springer-Verlag, 332-362."},{"key":"e_1_3_2_1_13_1","unstructured":"A. Beimel and N. Peter. 2019. Secret-Sharing from Robust Conditional Disclosure of Secrets. Cryptology ePrint Archive Report 2019 \/522. https:\/\/eprint.iacr.org\/ 2019 \/522.  A. Beimel and N. Peter. 2019. Secret-Sharing from Robust Conditional Disclosure of Secrets. Cryptology ePrint Archive Report 2019 \/522. https:\/\/eprint.iacr.org\/ 2019 \/522."},{"key":"e_1_3_2_1_14_1","first-page":"1","article-title":"Completeness theorems for noncryptographic fault-tolerant distributed computations. In 20th STOC","author":"Ben-Or M.","year":"1988","unstructured":"M. Ben-Or , S. Goldwasser , and A. Wigderson . 1988 . Completeness theorems for noncryptographic fault-tolerant distributed computations. In 20th STOC . ACM , 1 - 10 . M. Ben-Or, S. Goldwasser, and A. Wigderson. 1988. Completeness theorems for noncryptographic fault-tolerant distributed computations. In 20th STOC. ACM, 1-10.","journal-title":"ACM"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34799-2_3"},{"key":"e_1_3_2_1_16_1","first-page":"67","volume-title":"Seberry and Y. Zheng (Eds.)","volume":"718","author":"Bertilsson M.","unstructured":"M. Bertilsson and I. Ingemarsson . 1992. A Construction of Practical Secret Sharing Schemes using Linear Block Codes. In AUSCRYPT ' 92 ( LNCS ), J . Seberry and Y. Zheng (Eds.) , Vol. 718 . Springer-Verlag , 67 - 79 . M. Bertilsson and I. Ingemarsson. 1992. A Construction of Practical Secret Sharing Schemes using Linear Block Codes. In AUSCRYPT ' 92 ( LNCS ), J. Seberry and Y. Zheng (Eds.), Vol. 718. Springer-Verlag, 67-79."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"e_1_3_2_1_18_1","first-page":"11","article-title":"Multiparty Unconditionally Secure Protocols. In 20th STOC","author":"Chaum D.","year":"1988","unstructured":"D. Chaum , C. Cr\u00e9peau , and I. Damg\u00e5rd . 1988 . Multiparty Unconditionally Secure Protocols. In 20th STOC . ACM , 11 - 19 . D. Chaum, C. Cr\u00e9peau, and I. Damg\u00e5rd. 1988. Multiparty Unconditionally Secure Protocols. In 20th STOC. ACM, 11-19.","journal-title":"ACM"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.841169"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02620136"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900029"},{"key":"e_1_3_2_1_22_1","first-page":"457","article-title":"Shared Generation of Authenticators and Signatures. In CRYPTO ' 91 ( LNCS ), J. Feigenbaum (Ed.), Vol. 576","author":"Desmedt Y.","year":"1991","unstructured":"Y. Desmedt and Y. Frankel . 1991 . Shared Generation of Authenticators and Signatures. In CRYPTO ' 91 ( LNCS ), J. Feigenbaum (Ed.), Vol. 576 . Springer-Verlag , 457 - 469 . Y. Desmedt and Y. Frankel. 1991. Shared Generation of Authenticators and Signatures. In CRYPTO ' 91 ( LNCS ), J. Feigenbaum (Ed.), Vol. 576. Springer-Verlag, 457-469.","journal-title":"Springer-Verlag"},{"key":"e_1_3_2_1_23_1","first-page":"554","article-title":"A Minimal Model for Secure Computation. In 26th STOC","author":"Feige U.","year":"1994","unstructured":"U. Feige , J. Kilian , and M. Naor . 1994 . A Minimal Model for Secure Computation. In 26th STOC . ACM , 554 - 563 . U. Feige, J. Kilian, and M. Naor. 1994. A Minimal Model for Secure Computation. In 26th STOC. ACM, 554-563.","journal-title":"ACM"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"e_1_3_2_1_25_1","first-page":"485","volume-title":"Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. In CRYPTO 2015 ( LNCS ), R. Gennaro and M. Robshaw (Eds.)","volume":"9216","author":"Gay R.","unstructured":"R. Gay , I. Kerenidis , and H. Wee . 2015 . Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. In CRYPTO 2015 ( LNCS ), R. Gennaro and M. Robshaw (Eds.) , Vol. 9216 . Springer-Verlag , 485 - 502 . R. Gay, I. Kerenidis, and H. Wee. 2015. Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. In CRYPTO 2015 ( LNCS ), R. Gennaro and M. Robshaw (Eds.), Vol. 9216. Springer-Verlag, 485-502."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1689"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"M. G\u00f6\u00f6s T. Pitassi and T. Watson. 2016. Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. Algorithmica 76 3 ( 2016 ) 684-719.  M. G\u00f6\u00f6s T. Pitassi and T. Watson. 2016. Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. Algorithmica 76 3 ( 2016 ) 684-719.","DOI":"10.1007\/s00453-015-0104-9"},{"key":"e_1_3_2_1_28_1","first-page":"162","volume-title":"CRYPTO 2012 ( LNCS ), R. Safavi-Naini and R. Canetti (Eds.)","volume":"7417","author":"Gorbunov S.","unstructured":"S. Gorbunov , V. Vaikuntanathan , and H. Wee . 2012. Functional encryption with bounded collusions via multi-party computation . In CRYPTO 2012 ( LNCS ), R. Safavi-Naini and R. Canetti (Eds.) , Vol. 7417 . Springer-Verlag , 162 - 179 . S. Gorbunov, V. Vaikuntanathan, and H. Wee. 2012. Functional encryption with bounded collusions via multi-party computation. In CRYPTO 2012 ( LNCS ), R. Safavi-Naini and R. Canetti (Eds.), Vol. 7417. Springer-Verlag, 162-179."},{"key":"e_1_3_2_1_29_1","first-page":"89","article-title":"Attribute-based encryption for fine-grained access control of encrypted data. In 13th CCS","author":"Goyal V.","year":"2006","unstructured":"V. Goyal , O. Pandey , A. Sahai , and B. Waters . 2006 . Attribute-based encryption for fine-grained access control of encrypted data. In 13th CCS . ACM , 89 - 98 . V. Goyal, O. Pandey, A. Sahai, and B. Waters. 2006. Attribute-based encryption for fine-grained access control of encrypted data. In 13th CCS. ACM, 89-98.","journal-title":"ACM"},{"key":"e_1_3_2_1_30_1","first-page":"439","volume-title":"EUROCRYPT 2004 ( LNCS), C. Cachin and J. Camenisch (Eds.)","volume":"3027","author":"Ishai Y.","unstructured":"Y. Ishai and E. Kushilevitz . 2004. On the hardness of information-theoretic multiparty computation . In EUROCRYPT 2004 ( LNCS), C. Cachin and J. Camenisch (Eds.) , Vol. 3027 . Springer-Verlag , 439 - 455 . Y. Ishai and E. Kushilevitz. 2004. On the hardness of information-theoretic multiparty computation. In EUROCRYPT 2004 ( LNCS), C. Cachin and J. Camenisch (Eds.), Vol. 3027. Springer-Verlag, 439-455."},{"key":"e_1_3_2_1_31_1","first-page":"99","article-title":"Secret Sharing Schemes Realizing General Access Structure. In Globecom 87","author":"Ito M.","year":"1987","unstructured":"M. Ito , A. Saito , and T. Nishizeki . 1987 . Secret Sharing Schemes Realizing General Access Structure. In Globecom 87 . IEEE , 99 - 102 . Journal version: Multiple assignment scheme for sharing secret. J. of Cryptology 6 ( 1 ), 15-20, ( 1993 ). M. Ito, A. Saito, and T. Nishizeki. 1987. Secret Sharing Schemes Realizing General Access Structure. In Globecom 87. IEEE, 99-102. Journal version: Multiple assignment scheme for sharing secret. J. of Cryptology 6 ( 1 ), 15-20, ( 1993 ).","journal-title":"IEEE"},{"volume-title":"Boolean Function Complexity-Advances and Frontiers. Algorithms and combinatorics","author":"Jukna S.","key":"e_1_3_2_1_32_1","unstructured":"S. Jukna . 2012. Boolean Function Complexity-Advances and Frontiers. Algorithms and combinatorics , Vol. 27 . Springer-Verlag . S. Jukna. 2012. Boolean Function Complexity-Advances and Frontiers. Algorithms and combinatorics, Vol. 27. Springer-Verlag."},{"key":"e_1_3_2_1_33_1","first-page":"102","article-title":"On Span Programs. In 8th Structure in Complexity Theory","author":"Karchmer M.","year":"1993","unstructured":"M. Karchmer and A. Wigderson . 1993 . On Span Programs. In 8th Structure in Complexity Theory . IEEE Computer Society , 102 - 111 . M. Karchmer and A. Wigderson. 1993. On Span Programs. In 8th Structure in Complexity Theory. IEEE Computer Society, 102-111.","journal-title":"IEEE Computer Society"},{"key":"e_1_3_2_1_34_1","first-page":"699","article-title":"Breaking the Circuit-Size Barrier in Secret Sharing. In 50th STOC","author":"Liu T.","year":"2018","unstructured":"T. Liu and V. Vaikuntanathan . 2018 . Breaking the Circuit-Size Barrier in Secret Sharing. In 50th STOC . ACM , 699 - 708 . T. Liu and V. Vaikuntanathan. 2018. Breaking the Circuit-Size Barrier in Secret Sharing. In 50th STOC. ACM, 699-708.","journal-title":"ACM"},{"key":"e_1_3_2_1_35_1","first-page":"758","volume-title":"CRYPTO 2017 ( LNCS ), J. Katz and H. Shacham (Eds.)","volume":"10401","author":"Liu T.","unstructured":"T. Liu , V. Vaikuntanathan , and H. Wee . 2017. Conditional Disclosure of Secrets via Non-linear Reconstruction . In CRYPTO 2017 ( LNCS ), J. Katz and H. Shacham (Eds.) , Vol. 10401 . Springer-Verlag , 758 - 790 . T. Liu, V. Vaikuntanathan, and H. Wee. 2017. Conditional Disclosure of Secrets via Non-linear Reconstruction. In CRYPTO 2017 ( LNCS ), J. Katz and H. Shacham (Eds.), Vol. 10401. Springer-Verlag, 758-790."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78381-9_21"},{"key":"e_1_3_2_1_37_1","first-page":"157","article-title":"Access Control and Signatures via Quorum Secret Sharing. In 3rd CCS","author":"Naor M.","year":"1996","unstructured":"M. Naor and A. Wool . 1996 . Access Control and Signatures via Quorum Secret Sharing. In 3rd CCS . ACM , 157 - 167 . M. Naor and A. Wool. 1996. Access Control and Signatures via Quorum Secret Sharing. In 3rd CCS. ACM, 157-167.","journal-title":"ACM"},{"key":"e_1_3_2_1_38_1","first-page":"1246","article-title":"Strongly exponential lower bounds for monotone computation. In 49th STOC","author":"Pitassi T.","year":"2017","unstructured":"T. Pitassi and R. Robere . 2017 . Strongly exponential lower bounds for monotone computation. In 49th STOC . ACM , 1246 - 1255 . T. Pitassi and R. Robere. 2017. Strongly exponential lower bounds for monotone computation. In 49th STOC. ACM, 1246-1255.","journal-title":"ACM"},{"key":"e_1_3_2_1_39_1","first-page":"1207","article-title":"Lifting nullstellensatz to monotone span programs over any field. In 50th STOC","author":"Pitassi T.","year":"2018","unstructured":"T. Pitassi and R. Robere . 2018 . Lifting nullstellensatz to monotone span programs over any field. In 50th STOC . ACM , 1207 - 1219 . T. Pitassi and R. Robere. 2018. Lifting nullstellensatz to monotone span programs over any field. In 50th STOC. ACM, 1207-1219.","journal-title":"ACM"},{"key":"e_1_3_2_1_40_1","first-page":"406","article-title":"Exponential Lower Bounds for Monotone Span Programs. In 57th FOCS","author":"Robere R.","year":"2016","unstructured":"R. Robere , T. Pitassi , B. Rossman , and S. A. Cook . 2016 . Exponential Lower Bounds for Monotone Span Programs. In 57th FOCS . IEEE Computer Society , 406 - 415 . R. Robere, T. Pitassi, B. Rossman, and S. A. Cook. 2016. Exponential Lower Bounds for Monotone Span Programs. In 57th FOCS. IEEE Computer Society, 406-415.","journal-title":"IEEE Computer Society"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","unstructured":"A. Shamir. 1979. How to Share a Secret. Commun. ACM 22 ( 1979 ) 612-613.  A. Shamir. 1979. How to Share a Secret. Commun. ACM 22 ( 1979 ) 612-613.","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77444-0_31"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"T. Tassa. 2011. Generalized Oblivious Transfer by Secret Sharing. Designs Codes and Cryptography 58 1 ( 2011 ) 11-21.  T. Tassa. 2011. Generalized Oblivious Transfer by Secret Sharing. Designs Codes and Cryptography 58 1 ( 2011 ) 11-21.","DOI":"10.1007\/s10623-010-9378-8"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19379-8_4"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54242-8_26"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC '20"},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384293","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:12Z","timestamp":1750200072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":44,"alternative-id":["10.1145\/3357713.3384293","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384293","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}