{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:00:19Z","timestamp":1775638819138,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":61,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T00:00:00Z","timestamp":1636675200000},"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":[[2021,11,12]]},"DOI":"10.1145\/3460120.3485381","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:34Z","timestamp":1636805134000},"page":"2292-2306","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":78,"title":["OnionPIR: Response Efficient Single-Server PIR"],"prefix":"10.1145","author":[{"given":"Muhammad Haris","family":"Mughees","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]},{"given":"Hao","family":"Chen","sequence":"additional","affiliation":[{"name":"Facebook, San Francisco, CA, USA"}]},{"given":"Ling","family":"Ren","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1515\/jmc-2015-0016"},{"key":"e_1_3_2_1_2_1","first-page":"1483","article-title":"Communication-Computation Trade-offs in PIR","volume":"2019","author":"Ali Asra","year":"2019","unstructured":"Asra Ali, Tancr\u00e8 de Lepoint, Sarvar Patel, Mariana Raykova, Phillipp Schoppmann, Karn Seth, and Kevin Yeo. 2019. Communication-Computation Trade-offs in PIR. IACR Cryptol. ePrint Arch., Vol. 2019 (2019), 1483.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_3_1","unstructured":"Amazon. 2021. Amazon EC2 On-Demand Pricing. https:\/\/aws.amazon.com\/ec2\/pricing\/on-demand\/ Accessed: 2021-07--13."},{"key":"e_1_3_2_1_4_1","volume-title":"PIR with Compressed Queries and Amortized Query Processing. In 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society","author":"Angel Sebastian","unstructured":"Sebastian Angel, Hao Chen, Kim Laine, and Srinath T. V. Setty. 2018. PIR with Compressed Queries and Amortized Query Processing. In 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society, San Francisco, California, USA, 962--979."},{"key":"e_1_3_2_1_5_1","volume-title":"12th USENIX Symposium on Operating Systems Design and Implementation, OSDI. USENIX Association","author":"Angel Sebastian","unstructured":"Sebastian Angel and Srinath T. V. Setty. 2016. Unobservable Communication over Fully Untrusted Infrastructure. In 12th USENIX Symposium on Operating Systems Design and Implementation, OSDI. USENIX Association, Savannah, GA, USA, 551--569."},{"key":"e_1_3_2_1_6_1","volume-title":"10th International Workshop, APPROX","volume":"4627","author":"Barkol Omer","year":"2010","unstructured":"Omer Barkol, Yuval Ishai, and Enav Weinreb. 2010. On Locally Decodable Codes, Self-Correctable Codes, and t-Private PIR. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX, Vol. 4627 (2010), 311--325."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-006-0208-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2012.23"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-004-0134-y"},{"key":"e_1_3_2_1_10_1","volume-title":"Applied Cryptography and Network Security - 15th International Conference, ACNS (Lecture Notes in Computer Science)","author":"Blass Erik-Oliver","unstructured":"Erik-Oliver Blass, Travis Mayberry, and Guevara Noubir. 2017. Multi-client Oblivious RAM Secure Against Malicious Servers. In Applied Cryptography and Network Security - 15th International Conference, ACNS (Lecture Notes in Computer Science). Springer, Kanazawa, Japan, 686--707."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2015-0008"},{"key":"e_1_3_2_1_12_1","volume-title":"TCC (Lecture Notes in Computer Science","volume":"204","author":"Boyle Elette","year":"2016","unstructured":"Elette Boyle, Kai-Min Chung, and Rafael Pass. 2016. Oblivious Parallel RAM and Applications. In Theory of Cryptography - 13th International Conference, TCC (Lecture Notes in Computer Science, Vol. 9563). Springer, Tel Aviv, Israel, 175--204."},{"key":"e_1_3_2_1_13_1","volume-title":"Theory of Cryptography - 15th International Conference","author":"Boyle Elette","unstructured":"Elette Boyle, Yuval Ishai, Rafael Pass, and Mary Wootters. 2017. Can We Access a Database Both Locally and Privately?. In Theory of Cryptography - 15th International Conference, TCC. Springer, Baltimore, MD, USA, 662--693."},{"key":"e_1_3_2_1_14_1","volume-title":"International Conference on the Theory and Application of Cryptographic Techniques. Springer, Prague, Czech Republic, 402--414","author":"Cachin Christian","year":"1999","unstructured":"Christian Cachin, Silvio Micali, and Markus Stadler. 1999. Computationally Private Information Retrieval with Polylogarithmic Communication. In Advances in Cryptology - EUROCRYPT, International Conference on the Theory and Application of Cryptographic Techniques. Springer, Prague, Czech Republic, 402--414."},{"key":"e_1_3_2_1_15_1","volume-title":"Theory of Cryptography - 15th International Conference","author":"Canetti Ran","unstructured":"Ran Canetti, Justin Holmgren, and Silas Richelson. 2017. Towards Doubly Efficient Private Information Retrieval. In Theory of Cryptography - 15th International Conference, TCC. Springer, Baltimore, MD, USA, 694--726."},{"key":"e_1_3_2_1_16_1","volume-title":"ConcurORAM: High-Throughput Stateless Parallel Multi-Client ORAM. In 26th Annual Network and Distributed System Security Symposium, NDSS","author":"Chakraborti Anrin","year":"2019","unstructured":"Anrin Chakraborti and Radu Sion. 2019. ConcurORAM: High-Throughput Stateless Parallel Multi-Client ORAM. In 26th Annual Network and Distributed System Security Symposium, NDSS 2019. The Internet Society, San Diego, California, USA, 23--63."},{"key":"e_1_3_2_1_17_1","volume-title":"Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, (Lecture Notes in Computer Science","author":"Hubert Chan T.-H.","unstructured":"T.-H. Hubert Chan, Kai-Min Chung, and Elaine Shi. 2017. On the Depth of Oblivious Parallel RAM. In Advances in Cryptology - ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, (Lecture Notes in Computer Science, Vol. 10624). Springer, Hong Kong, China, 567--597."},{"key":"e_1_3_2_1_18_1","volume-title":"TCC 2017 (Lecture Notes in Computer Science","volume":"107","author":"Hubert Chan T.-H.","year":"2017","unstructured":"T.-H. Hubert Chan and Elaine Shi. 2017. Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs. In Theory of Cryptography - 15th International Conference, TCC 2017 (Lecture Notes in Computer Science, Vol. 10678). Springer, Baltimore, MD, USA, 72--107."},{"key":"e_1_3_2_1_19_1","volume-title":"Single Database Private Information Retrieval with Logarithmic Communication. In Information Security and Privacy: 9th Australasian Conference, ACISP. Springer","author":"Chang Yan-Cheng","year":"2004","unstructured":"Yan-Cheng Chang. 2004. Single Database Private Information Retrieval with Logarithmic Communication. In Information Security and Privacy: 9th Australasian Conference, ACISP. Springer, Sydney, Australia, 50--61."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354226"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09319-x"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258609"},{"key":"e_1_3_2_1_24_1","volume-title":"Private Information Retrieval. In 36th Annual Symposium on Foundations of Computer Science. IEEE Computer Society","author":"Chor Benny","year":"1995","unstructured":"Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan. 1995. Private Information Retrieval. In 36th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Milwaukee, Wisconsin, USA, 41--50."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293350"},{"key":"e_1_3_2_1_26_1","volume-title":"Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Corrigan-Gibbs Henry","unstructured":"Henry Corrigan-Gibbs and Dmitry Kogan. 2020. Private Information Retrieval with Sublinear Online Time. In Advances in Cryptology - EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, Anne Canteaut and Yuval Ishai (Eds.). Springer, Zagreb, Croatia, 44--75."},{"key":"e_1_3_2_1_27_1","volume-title":"4th International Workshop on Practice and Theory in Public Key Cryptography, PKC (Lecture Notes in Computer Science","volume":"136","author":"Damg\u00e5rd Ivan","year":"2001","unstructured":"Ivan Damg\u00e5rd and Mads Jurik. 2001. A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System. In Public Key Cryptography, 4th International Workshop on Practice and Theory in Public Key Cryptography, PKC (Lecture Notes in Computer Science, Vol. 1992). Springer, Cheju Island, Korea, 119--136."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2006.882249"},{"key":"e_1_3_2_1_29_1","volume-title":"TCC 2016 (Lecture Notes in Computer Science","volume":"174","author":"Devadas Srinivas","year":"2016","unstructured":"Srinivas Devadas, Marten van Dijk, Christopher W. Fletcher, Ling Ren, Elaine Shi, and Daniel Wichs. 2016. Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM. In Theory of Cryptography - 13th International Conference, TCC 2016 (Lecture Notes in Computer Science, Vol. 9563). Springer, Tel Aviv, Israel, 145--174."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536422"},{"key":"e_1_3_2_1_31_1","first-page":"144","article-title":"Somewhat Practical Fully Homomorphic Encryption","volume":"2012","author":"Fan Junfeng","year":"2012","unstructured":"Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch., Vol. 2012 (2012), 144.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_32_1","volume-title":"SSTD (Lecture Notes in Computer Science","volume":"312","author":"Fung Eric","year":"2015","unstructured":"Eric Fung, Georgios Kellaris, and Dimitris Papadias. 2015. Combining Differential Privacy and PIR for Efficient Strong Location Privacy. In Advances in Spatial and Temporal Databases - 14th International Symposium, SSTD (Lecture Notes in Computer Science, Vol. 9239). Springer, Hong Kong, China, 295--312."},{"key":"e_1_3_2_1_33_1","volume-title":"Automata, Languages and Programming, 32nd International Colloquium","author":"Gentry Craig","unstructured":"Craig Gentry and Zulfikar Ramzan. 2005. Single-Database Private Information Retrieval with Constant Communication Rate. In Automata, Languages and Programming, 32nd International Colloquium, ICALP. Springer, Lisbon, Portugal, 803--815."},{"key":"e_1_3_2_1_34_1","volume-title":"Asymptotically-Faster, Attribute-Based. In Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference","author":"Gentry Craig","unstructured":"Craig Gentry, Amit Sahai, and Brent Waters. 2013. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based. In Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference. Springer, Santa Barbara, CA, USA, 75--92."},{"key":"e_1_3_2_1_35_1","volume-title":"Proceedings of the 33nd International Conference on Machine Learning, ICML (JMLR Workshop and Conference Proceedings","volume":"210","author":"Gilad-Bachrach Ran","year":"2016","unstructured":"Ran Gilad-Bachrach, Nathan Dowlin, Kim Laine, Kristin E. Lauter, Michael Naehrig, and John Wernsing. 2016. CryptoNets: Applying Neural Networks to Encrypted Data with High Throughput and Accuracy. In Proceedings of the 33nd International Conference on Machine Learning, ICML (JMLR Workshop and Conference Proceedings, Vol. 48). JMLR.org, New York City, NY, USA, 201--210."},{"key":"e_1_3_2_1_36_1","volume-title":"Copenhagen (Lecture Notes in Computer Science","volume":"658","author":"Gilboa Niv","year":"2014","unstructured":"Niv Gilboa and Yuval Ishai. 2014. Distributed Point Functions and Their Applications. In Advances in Cryptology - EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen (Lecture Notes in Computer Science, Vol. 8441). Springer, Copenhagen, Denmark, 640--658."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28416"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978407"},{"key":"e_1_3_2_1_40_1","volume-title":"Scalable and Private Media Consumption with Popcorn. In 13th USENIX Symposium on Networked Systems Design and Implementation, NSDI. USENIX Association","author":"Gupta Trinabh","year":"2016","unstructured":"Trinabh Gupta, Natacha Crooks, Whitney Mulhern, Srinath T. V. Setty, Lorenzo Alvisi, and Michael Walfish. 2016. Scalable and Private Media Consumption with Popcorn. In 13th USENIX Symposium on Networked Systems Design and Implementation, NSDI. USENIX Association, Santa Clara, CA, USA, 91--107."},{"key":"e_1_3_2_1_41_1","volume-title":"Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques (Lecture Notes in Computer Science","author":"Hamlin Ariel","unstructured":"Ariel Hamlin, Rafail Ostrovsky, Mor Weiss, and Daniel Wichs. 2019. Private Anonymous Data Access. In Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques (Lecture Notes in Computer Science, Vol. 11477). Springer, Darmstadt, Germany, 244--273."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0036"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.25"},{"key":"e_1_3_2_1_45_1","first-page":"1077","article-title":"Blurry-ORAM: A Multi-Client Oblivious Storage Architecture","volume":"2016","author":"Karvelas Nikolaos P.","year":"2016","unstructured":"Nikolaos P. Karvelas, Andreas Peter, and Stefan Katzenbeisser. 2016. Blurry-ORAM: A Multi-Client Oblivious Storage Architecture. IACR Cryptol. ePrint Arch., Vol. 2016 (2016), 1077.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_46_1","first-page":"345","article-title":"Private Blocklist Lookups with Checklist","volume":"2021","author":"Kogan Dmitry","year":"2021","unstructured":"Dmitry Kogan and Henry Corrigan-Gibbs. 2021. Private Blocklist Lookups with Checklist. IACR Cryptol. ePrint Arch., Vol. 2021 (2021), 345.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_47_1","volume-title":"Computationally-Private Information Retrieval. In 38th Annual Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society","author":"Kushilevitz Eyal","year":"1997","unstructured":"Eyal Kushilevitz and Rafail Ostrovsky. 1997. Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval. In 38th Annual Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society, Miami Beach, Florida, USA, 364--373."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.12873"},{"key":"e_1_3_2_1_49_1","volume-title":"8th International Conference, ISC (Lecture Notes in Computer Science","volume":"328","author":"Lipmaa Helger","year":"2005","unstructured":"Helger Lipmaa. 2005. An Oblivious Transfer Protocol with Log-Squared Communication. In Information Security, 8th International Conference, ISC (Lecture Notes in Computer Science, Vol. 3650). Springer, Singapore, 314--328."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2016-0010"},{"key":"e_1_3_2_1_51_1","volume-title":"PIR-Tor: Scalable Anonymous Communication Using Private Information Retrieval. In 20th USENIX Security Symposium. USENIX Association","author":"Mittal Prateek","year":"2011","unstructured":"Prateek Mittal, Femi G. Olumofin, Carmela Troncoso, Nikita Borisov, and Ian Goldberg. 2011. PIR-Tor: Scalable Anonymous Communication Using Private Information Retrieval. In 20th USENIX Security Symposium. USENIX Association, San Francisco, CA, USA, 295--312."},{"key":"e_1_3_2_1_52_1","first-page":"1141","article-title":"An Oblivious Parallel RAM with O(log(^2 ) N) Parallel Runtime Blowup","volume":"2016","author":"Nayak Kartik","year":"2016","unstructured":"Kartik Nayak and Jonathan Katz. 2016. An Oblivious Parallel RAM with O(log(^2 ) N) Parallel Runtime Blowup. IACR Cryptol. ePrint Arch., Vol. 2016 (2016), 1141.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_53_1","volume-title":"Computer Security - ESORICS 2020 - 25th European Symposium on Research in Computer Security","author":"Park Jeongeun","unstructured":"Jeongeun Park and Mehdi Tibouchi. 2020. SHECS-PIR: Somewhat Homomorphic Encryption-Based Compact and Scalable Private Information Retrieval. In Computer Security - ESORICS 2020 - 25th European Symposium on Research in Computer Security. Springer, Guildford, UK, 86--106."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243821"},{"key":"e_1_3_2_1_55_1","unstructured":"Quarkslab. 2016. quarkslab\/NFLlib. https:\/\/github.com\/quarkslab\/NFLlib"},{"key":"e_1_3_2_1_56_1","volume-title":"HEAX: An Architecture for Computing on Encrypted Data. In ASPLOS '20: Architectural Support for Programming Languages and Operating Systems. ACM","author":"Riazi M. Sadegh","year":"2020","unstructured":"M. Sadegh Riazi, Kim Laine, Blake Pelton, and Wei Dai. 2020. HEAX: An Architecture for Computing on Encrypted Data. In ASPLOS '20: Architectural Support for Programming Languages and Operating Systems. ACM, Lausanne, Switzerland, 1295--1309."},{"key":"e_1_3_2_1_57_1","volume-title":"Proceedings of the Network and Distributed Systems Security Symposium. Internet Society","author":"Sion Radu","year":"2007","unstructured":"Radu Sion and Bogdan Carbunar. 2007. On the computational practicality of private information retrieval. In Proceedings of the Network and Distributed Systems Security Symposium. Internet Society, San Diego, California, USA, 2006--06."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49649-1_28"},{"key":"e_1_3_2_1_60_1","volume-title":"32nd International Colloquium, ICALP (Lecture Notes in Computer Science","volume":"1436","author":"Wehner Stephanie","year":"2005","unstructured":"Stephanie Wehner and Ronald de Wolf. 2005. Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval. In Automata, Languages and Programming, 32nd International Colloquium, ICALP (Lecture Notes in Computer Science, Vol. 3580). Springer, Lisbon, Portugal, 1424--1436."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250830"}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event Republic of Korea","acronym":"CCS '21","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3485381","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3485381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:48:07Z","timestamp":1763498887000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3485381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":61,"alternative-id":["10.1145\/3460120.3485381","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3485381","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}