{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T13:10:06Z","timestamp":1751807406731,"version":"3.41.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T00:00:00Z","timestamp":1534723200000},"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":["comput. complex."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00037-018-0170-x","type":"journal-article","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T15:29:53Z","timestamp":1534778993000},"page":"573-616","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings"],"prefix":"10.1007","volume":"28","author":[{"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[]},{"given":"Pavel","family":"Raykov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,20]]},"reference":[{"key":"170_CR1","doi-asserted-by":"crossref","unstructured":"Shweta Agrawal, Yuval Ishai, Dakshita Khurana & Anat Paskin-Cherniavsky (2015). Statistical Randomized Encodings: A Complexity Theoretic View. In Automata, Languages, and Programming\u201442nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6\u201310, 2015, Proceedings, Part I, Magn\u00fas\u00a0M. Halld\u00f3rsson, Kazuo Iwama, Naoki Kobayashi & Bettina Speckmann, editors, volume 9134 of Lecture Notes in Computer Science, 1\u201313. Springer. ISBN 978-3-662-47671-0. http:\/\/dx.doi.org\/10.1007\/978-3-662-47672-7_1","DOI":"10.1007\/978-3-662-47672-7_1"},{"key":"170_CR2","doi-asserted-by":"crossref","unstructured":"William Aiello & Johan H\u00e5stad (1987). Perfect Zero-Knowledge Languages Can Be Recognized in Two Rounds. In 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27\u201329 October 1987, 439\u2013448. IEEE Computer Society. ISBN 0-8186-0807-2. http:\/\/dx.doi.org\/10.1109\/SFCS.1987.47","DOI":"10.1109\/SFCS.1987.47"},{"key":"170_CR3","doi-asserted-by":"crossref","unstructured":"Applebaum, Benny: Cryptography in Constant Parallel Time. Springer, Information Security and Cryptography (2014). ISBN 978-3-642-17366-0. http:\/\/dx.doi.org\/10.1007\/978-3-642-17367-7","DOI":"10.1007\/978-3-642-17367-7"},{"key":"170_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-57048-8_1","volume-title":"Tutorials on the Foundations of Cryptography","author":"Benny Applebaum","year":"2017","unstructured":"Benny Applebaum (2017). Garbled Circuits as Randomized Encodings of Functions: a Primer. In Tutorials on the Foundations of Cryptography., Yehuda Lindell, editor, 1\u201344. Springer International Publishing. ISBN 978-3-319-57047-1. https:\/\/doi.org\/10.1007\/978-3-319-57048-8_1"},{"key":"170_CR5","doi-asserted-by":"crossref","unstructured":"Benny Applebaum, Yuval Ishai & Eyal Kushilevitz (2004). Cryptography in $$\\text{NC}^{0}$$ NC 0 . In 45th Symposium on Foundations of Computer Science (FOCS 2004), 17\u201319 October 2004, Rome, Italy, Proceedings, 166\u2013175. IEEE Computer Society. ISBN 0-7695-2228-9. http:\/\/dx.doi.org\/10.1109\/FOCS.2004.20","DOI":"10.1109\/FOCS.2004.20"},{"key":"170_CR6","doi-asserted-by":"crossref","unstructured":"Benny Applebaum, Yuval Ishai & Eyal Kushilevitz (2005). Computationally Private Randomizing Polynomials and Their Applications. In 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11\u201315 June 2005, San Jose, CA, USA, 260\u2013274. IEEE Computer Society. ISBN 0-7695-2364-1. http:\/\/dx.doi.org\/10.1109\/CCC.2005.9","DOI":"10.1109\/CCC.2005.9"},{"issue":"1","key":"170_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-016-9244-6","volume":"31","author":"Benny Applebaum","year":"2016","unstructured":"Benny Applebaum, Yuval Ishai & Eyal Kushilevitz (2018). Minimizing Locality of One-Way Functions via Semi-private Randomized Encodings. J. Cryptology 31(1), 1\u201322. https:\/\/doi.org\/10.1007\/s00145-016-9244-6","journal-title":"Journal of Cryptology"},{"key":"170_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-662-53015-3_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Benny Applebaum","year":"2016","unstructured":"Benny Applebaum & Pavel Raykov (2016). On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings. In Advances in Cryptology\u2014CRYPTO 2016\u201436th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14\u201318, 2016, Proceedings, Part III, Matthew Robshaw & Jonathan Katz, editors, volume 9816 of Lecture Notes in Computer Science, 449\u2013477. Springer. ISBN 978-3-662-53014-6. https:\/\/doi.org\/10.1007\/978-3-662-53015-3_16"},{"issue":"4","key":"170_CR9","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s00145-016-9239-3","volume":"30","author":"Benny Applebaum","year":"2016","unstructured":"Benny Applebaum & Pavel Raykov (2017). From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back. J. Cryptology 30(4), 961\u2013988. https:\/\/doi.org\/10.1007\/s00145-016-9239-3","journal-title":"Journal of Cryptology"},{"key":"170_CR10","unstructured":"Manuel Blum, Paul Feldman & Silvio Micali (1988). Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2\u20134, 1988, Chicago, Illinois, USA, Janos Simon, editor, 103\u2013112. ACM. ISBN 0-89791-264-0. http:\/\/doi.acm.org\/10.1145\/62212.62222"},{"key":"170_CR11","doi-asserted-by":"crossref","unstructured":"Manuel Blum, Alfredo\u00a0De Santis, Silvio Micali & Giuseppe Persiano (1991). Noninteractive Zero-Knowledge. SIAM J. Comput. 20(6), 1084\u20131118. http:\/\/dx.doi.org\/10.1137\/0220068","DOI":"10.1137\/0220068"},{"key":"170_CR12","doi-asserted-by":"crossref","unstructured":"J\u00f8rgen Brandt, Ivan Damg\u00e5rd, Peter Landrock & Torben\u00a0P. Pedersen (1988). Zero-Knowledge Authentication Scheme with Secret Key Exchange (Extended Abstract). In Advances in Cryptology\u2014CRYPTO '88, 8th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21\u201325, 1988, Proceedings, Shafi Goldwasser, editor, volume 403 of Lecture Notes in Computer Science, 583\u2013588. Springer. ISBN 3-540-97196-3. http:\/\/dx.doi.org\/10.1007\/0-387-34799-2_43","DOI":"10.1007\/0-387-34799-2_43"},{"key":"170_CR13","doi-asserted-by":"crossref","unstructured":"Larry Carter & Mark\u00a0N. Wegman (1979). Universal classes of hash functions. Journal of Computer and System Sciences 18(2), 143\u2013154. http:\/\/portal.acm.org\/citation.cfm?doid=800105.803400 . Preliminary version appeared in STOC '77","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"170_CR14","doi-asserted-by":"crossref","unstructured":"Andr\u00e9 Chailloux, Dragos\u00a0Florin Ciocan, Iordanis Kerenidis & Salil\u00a0P. Vadhan (2008). Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. In Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19\u201321, 2008., Ran Canetti, editor, volume 4948 of Lecture Notes in Computer Science, 501\u2013534. Springer. ISBN 978-3-540-78523-1. http:\/\/dx.doi.org\/10.1007\/978-3-540-78524-8_28","DOI":"10.1007\/978-3-540-78524-8_28"},{"key":"170_CR15","doi-asserted-by":"crossref","unstructured":"Richard Chang, Benny Chor, Oded Goldreich, Juris Hartmanis, Johan H\u00e5stad, Desh Ranjan & Pankaj Rohatgi (1994). The Random Oracle Hypothesis Is False. J. Comput. Syst. Sci. 49(1), 24\u201339. http:\/\/dx.doi.org\/10.1016\/S0022-0000(05)80084-4","DOI":"10.1016\/S0022-0000(05)80084-4"},{"key":"170_CR16","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd (1987). Collision Free Hash Functions and Public Key Signature Schemes. In Advances in Cryptology\u2014EUROCRYPT '87, Workshop on the Theory and Application of Cryptographic Techniques, Amsterdam, The Netherlands, April 13\u201315, 1987, Proceedings, David Chaum & Wyn\u00a0L. Price, editors, volume 304 of Lecture Notes in Computer Science, 203\u2013216. Springer. ISBN 3-540-19102-X. http:\/\/dx.doi.org\/10.1007\/3-540-39118-5_19","DOI":"10.1007\/3-540-39118-5_19"},{"key":"170_CR17","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd (2000). Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In Advances in Cryptology\u2014EUROCRYPT 2000, International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14\u201318, 2000, Proceeding, Bart Preneel, editor, volume 1807 of Lecture Notes in Computer Science, 418\u2013430. Springer. ISBN 3-540-67517-5. http:\/\/dx.doi.org\/10.1007\/3-540-45539-6_30","DOI":"10.1007\/3-540-45539-6_30"},{"key":"170_CR18","doi-asserted-by":"crossref","unstructured":"Shimon Even, Alan\u00a0L. Selman & Yacov Yacobi (1984). The Complexity of Promise Problems with Applications to Public-key Cryptography. Inf. Control 61(2), 159\u2013173. ISSN 0019-9958. http:\/\/dx.doi.org\/10.1016\/S0019-9958(84)80056-X","DOI":"10.1016\/S0019-9958(84)80056-X"},{"key":"170_CR19","doi-asserted-by":"crossref","unstructured":"Uriel Feige, Joe Kilian & Moni Naor (1994). A minimal model for secure computation (extended abstract). In Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23\u201325 May 1994, Montr\u00e9al, Qu\u00e9bec, Canada, Frank\u00a0Thomson Leighton & Michael\u00a0T. Goodrich, editors, 554\u2013563. ACM. ISBN 0-89791-663-8. http:\/\/doi.acm.org\/10.1145\/195058.195408","DOI":"10.1145\/195058.195408"},{"key":"170_CR20","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"The Foundations of Cryptography-Volume 1","author":"Oded Goldreich","year":"2001","unstructured":"Goldreich, Oded: The Foundations of Cryptography-Volume 1. Cambridge University Press, Basic Techniques (2001). ISBN 0-521-79172-3","ISBN":"https:\/\/id.crossref.org\/isbn\/0521791723"},{"key":"170_CR21","doi-asserted-by":"crossref","unstructured":"Oded Goldreich (2006). On Promise Problems: A Survey. In Theoretical Computer Science, Essays in Memory of Shimon Even, Oded Goldreich, Arnold\u00a0L. Rosenberg & Alan\u00a0L. Selman, editors, volume 3895 of Lecture Notes in Computer Science, 254\u2013290. Springer. ISBN 3-540-32880-7. http:\/\/dx.doi.org\/10.1007\/11685654_12","DOI":"10.1007\/11685654_12"},{"key":"170_CR22","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Silvio Micali & Avi Wigderson (1991). Proofs that Yield Nothing But Their Validity for All Languages in NP Have Zero-Knowledge Proof Systems. J. ACM 38(3), 691\u2013729. http:\/\/doi.acm.org\/10.1145\/116825.116852","DOI":"10.1145\/116825.116852"},{"key":"170_CR23","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Amit Sahai & Salil\u00a0P. Vadhan (1999). Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK. In Advances in Cryptology\u2014CRYPTO '99, 19th Annual International Cryptology Conference, Santa Barbara, California, USA, August 15\u201319, 1999, Proceedings, Michael\u00a0J. Wiener, editor, volume 1666 of Lecture Notes in Computer Science, 467\u2013484. Springer. ISBN 3-540-66347-9. http:\/\/dx.doi.org\/10.1007\/3-540-48405-1_30","DOI":"10.1007\/3-540-48405-1_30"},{"key":"170_CR24","unstructured":"Oded Goldreich & Salil\u00a0P. Vadhan (1999). Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK. In Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4\u20136, 1999, 54. IEEE Computer Society. ISBN 0-7695-0075-7. http:\/\/doi.ieeecomputersociety.org\/10.1109\/CCC.1999.766262"},{"key":"170_CR25","doi-asserted-by":"crossref","unstructured":"Goldwasser, Micali & Rackoff (1989). The Knowledge Complexity of Interactive Proof Systems. SICOMP: SIAM Journal on Computing 18","DOI":"10.1137\/0218012"},{"key":"170_CR26","doi-asserted-by":"crossref","unstructured":"Shafi Goldwasser, Silvio Micali & Ronald\u00a0L. Rivest (1988). A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput. 17(2), 281\u2013308. http:\/\/dx.doi.org\/10.1137\/0217017","DOI":"10.1137\/0217017"},{"key":"170_CR27","doi-asserted-by":"crossref","unstructured":"Mika G\u00f6\u00f6s, Toniann Pitassi & Thomas Watson (2015). Zero-Information Protocols and Unambiguity in Arthur-Merlin Communication. In Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, Rehovot, Israel, January 11\u201313, 2015, Tim Roughgarden, editor, 113\u2013122. ACM. ISBN 978-1-4503-3333-7. http:\/\/doi.acm.org\/10.1145\/2688073.2688074","DOI":"10.1145\/2688073.2688074"},{"key":"170_CR28","doi-asserted-by":"crossref","unstructured":"Danny Gutfreund & Michael Ben-Or (2000). Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems. In Advances in Cryptology\u2014ASIACRYPT 2000, 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, Japan, December 3\u20137, 2000, Proceedings, Tatsuaki Okamoto, editor, volume 1976 of Lecture Notes in Computer Science, 429\u2013442. Springer. ISBN 3-540-41404-5. http:\/\/dx.doi.org\/10.1007\/3-540-44448-3_33","DOI":"10.1007\/3-540-44448-3_33"},{"key":"170_CR29","doi-asserted-by":"crossref","unstructured":"Iftach Haitner, Jonathan\u00a0J. Hoch, Omer Reingold & Gil Segev (2015). Finding Collisions in Interactive Protocols\u2014Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. SIAM J. Comput. 44(1), 193\u2013242. http:\/\/dx.doi.org\/10.1137\/130938438","DOI":"10.1137\/130938438"},{"key":"170_CR30","unstructured":"Russell Impagliazzo, Leonid\u00a0A. Levin & Michael Luby (1989). Pseudo-random Generation from one-way functions (Extended Abstracts). In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14\u201317, 1989, Seattle, Washigton, USA, David\u00a0S. Johnson, editor, 12\u201324. ACM. ISBN 0-89791-307-8. http:\/\/doi.acm.org\/10.1145\/73007.73009"},{"key":"170_CR31","doi-asserted-by":"crossref","unstructured":"Russell Impagliazzo & Michael Luby (1989). One-way Functions are Essential for Complexity Based Cryptography (Extended Abstract). In 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October\u20131 November 1989, 230\u2013235. IEEE Computer Society. ISBN 0-8186-1982-1. http:\/\/dx.doi.org\/10.1109\/SFCS.1989.63483","DOI":"10.1109\/SFCS.1989.63483"},{"key":"170_CR32","doi-asserted-by":"crossref","unstructured":"Yuval Ishai (2013). Randomization Techniques for Secure Computation. In Secure Multi-Party Computation, Manoj Prabhakaran & Amit Sahai, editors, volume\u00a010 of Cryptology and Information Security Series, 222\u2013248. IOS Press. ISBN 978-1-61499-168-7. http:\/\/dx.doi.org\/10.3233\/978-1-61499-169-4-222","DOI":"10.3233\/978-1-61499-169-4-222"},{"key":"170_CR33","doi-asserted-by":"crossref","unstructured":"Yuval Ishai & Eyal Kushilevitz (2000). Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. In 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12\u201314 November 2000, Redondo Beach, California, USA, 294\u2013304. IEEE Computer Society. ISBN 0-7695-0850-2. http:\/\/dx.doi.org\/10.1109\/SFCS.2000.892118","DOI":"10.1109\/SFCS.2000.892118"},{"key":"170_CR34","doi-asserted-by":"crossref","unstructured":"Tatsuaki Okamoto (2000). On Relationships between Statistical Zero-Knowledge Proofs. J. Comput. Syst. Sci. 60(1), 47\u2013108. http:\/\/dx.doi.org\/10.1006\/jcss.1999.1664","DOI":"10.1006\/jcss.1999.1664"},{"key":"170_CR35","doi-asserted-by":"crossref","unstructured":"Shien\u00a0Jin Ong & Salil\u00a0P. Vadhan (2008). An Equivalence Between Zero Knowledge and Commitments. In Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19\u201321, 2008., 482\u2013500. http:\/\/dx.doi.org\/10.1007\/978-3-540-78524-8_27","DOI":"10.1007\/978-3-540-78524-8_27"},{"key":"170_CR36","doi-asserted-by":"crossref","unstructured":"Rafail Ostrovsky (1991). One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs. In Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30\u2013July 3, 1991, 133\u2013138. IEEE Computer Society. ISBN 0-8186-2255-5. http:\/\/dx.doi.org\/10.1109\/SCT.1991.160253","DOI":"10.1109\/SCT.1991.160253"},{"key":"170_CR37","doi-asserted-by":"crossref","unstructured":"Rafael Pass & Abhi Shelat (2005). Unconditional Characterizations of Non-interactive Zero-Knowledge. In Advances in Cryptology\u2014CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14\u201318, 2005, Proceedings, Victor Shoup, editor, volume 3621 of Lecture Notes in Computer Science, 118\u2013134. Springer. ISBN 3-540-28114-2. http:\/\/dx.doi.org\/10.1007\/11535218_8","DOI":"10.1007\/11535218_8"},{"key":"170_CR38","doi-asserted-by":"crossref","unstructured":"Alexander Russell (1995). Necessary and Sufficient Conditions for Collision-Free Hashing. J. Cryptology 8(2), 87\u2013100. http:\/\/dx.doi.org\/10.1007\/BF00190757","DOI":"10.1007\/BF00190757"},{"key":"170_CR39","doi-asserted-by":"crossref","unstructured":"Amit Sahai & Salil\u00a0P. Vadhan (2003). A complete problem for statistical zero knowledge. J. ACM 50(2), 196\u2013249. http:\/\/doi.acm.org\/10.1145\/636865.636868","DOI":"10.1145\/636865.636868"},{"key":"170_CR40","doi-asserted-by":"crossref","unstructured":"Alfredo\u00a0De Santis, Giovanni\u00a0Di Crescenzo, Giuseppe Persiano & Moti Yung (1998). Image Density is Complete for Non-Interactive-SZK (Extended Abstract). In Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13\u201317, 1998, Proceedings, Kim\u00a0Guldstrand Larsen, Sven Skyum & Glynn Winskel, editors, volume 1443 of Lecture Notes in Computer Science, 784\u2013795. Springer. ISBN 3-540-64781-3. http:\/\/dx.doi.org\/10.1007\/BFb0055102","DOI":"10.1007\/BFb0055102"},{"key":"170_CR41","unstructured":"Salil\u00a0P. Vadhan (1999). A Study of Statistical Zero-Knowledge Proofs. Ph.D. thesis, MIT Department of Mathematics"}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-018-0170-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-018-0170-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-018-0170-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T12:29:25Z","timestamp":1751804965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-018-0170-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,20]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["170"],"URL":"https:\/\/doi.org\/10.1007\/s00037-018-0170-x","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"type":"print","value":"1016-3328"},{"type":"electronic","value":"1420-8954"}],"subject":[],"published":{"date-parts":[[2018,8,20]]},"assertion":[{"value":"4 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}