{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T04:45:13Z","timestamp":1745469913440,"version":"3.40.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030459888"},{"type":"electronic","value":"9783030459895"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-45989-5_24","type":"book-chapter","created":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T23:10:08Z","timestamp":1587683408000},"page":"280-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ADS4all: Democratizing Authenticated Data Structures"],"prefix":"10.1007","author":[{"given":"Nasser","family":"Alzahrani","sequence":"first","affiliation":[]},{"given":"Ibrhaim","family":"Khalil","sequence":"additional","affiliation":[]},{"given":"Xun","family":"Yi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,24]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-319-50230-4_14","volume-title":"Software Technologies: Applications and Foundations","author":"N Alzahrani","year":"2016","unstructured":"Alzahrani, N., Spichkova, M., Blech, J.O.: Spatio-temporal models for formal analysis and property-based testing. In: Milazzo, P., Varr\u00f3, D., Wimmer, M. (eds.) STAF 2016. LNCS, vol. 9946, pp. 196\u2013206. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50230-4_14"},{"doi-asserted-by":"crossref","unstructured":"Alzahrani, N., Spichkova, M., Blech, J.O.: From temporal models to property-based testing. arXiv preprint arXiv:1705.10032 (2017)","key":"24_CR2","DOI":"10.5220\/0006340302410246"},{"unstructured":"Baez, J.C., Fong, B.: A compositional framework for passive linear networks. arXiv preprint arXiv:1504.05625 (2015)","key":"24_CR3"},{"key":"24_CR4","volume-title":"Category Theory for Computing Science","author":"M Barr","year":"1990","unstructured":"Barr, M., Wells, C.: Category Theory for Computing Science, vol. 49. Prentice Hall, New York (1990)"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-03359-9_6","volume-title":"Theorem Proving in Higher Order Logics","author":"A Bove","year":"2009","unstructured":"Bove, A., Dybjer, P., Norell, U.: A brief overview of Agda \u2013 a functional language with dependent types. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 73\u201378. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03359-9_6"},{"unstructured":"Bowe, S., Chiesa, A., Green, M., Miers, I., Mishra, P., Wu, H.: ZEXE: enabling decentralized private computation. IACR ePrint 962 (2018)","key":"24_CR6"},{"doi-asserted-by":"crossref","unstructured":"Elliott, C.: The simple essence of automatic differentiation. In: Proceedings of the ACM on Programming Languages 2(ICFP), 70 (2018)","key":"24_CR7","DOI":"10.1145\/3236765"},{"unstructured":"Fong, B., Spivak, D.I., Tuy\u00e9ras, R.: Backprop as functor: a compositional perspective on supervised learning. arXiv preprint arXiv:1711.10455 (2017)","key":"24_CR8"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-540-72845-0_8","volume-title":"Experimental Algorithms","author":"MT Goodrich","year":"2007","unstructured":"Goodrich, M.T., Papamanthou, C., Tamassia, R.: On the cost of persistence and authentication in skip lists. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 94\u2013107. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72845-0_8"},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s00453-009-9355-7","volume":"60","author":"MT Goodrich","year":"2011","unstructured":"Goodrich, M.T., Tamassia, R., Triandopoulos, N.: Efficient authenticated data structures for graph connectivity and geometric search problems. Algorithmica 60(3), 505\u2013552 (2011)","journal-title":"Algorithmica"},{"issue":"5","key":"24_CR11","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1016\/j.jlamp.2015.12.004","volume":"85","author":"R Hinze","year":"2016","unstructured":"Hinze, R., Marsden, D.: Equational reasoning with lollipops, forks, cups, caps, snakes, and speedometers. J. Log. Algebr. Methods Program. 85(5), 931\u2013951 (2016)","journal-title":"J. Log. Algebr. Methods Program."},{"doi-asserted-by":"crossref","unstructured":"Kosba, A., Miller, A., Shi, E., Wen, Z., Papamanthou, C.: Hawk: the blockchain model of cryptography and privacy-preserving smart contracts. In: 2016 IEEE Symposium on Security and Privacy (SP), pp. 839\u2013858. IEEE (2016)","key":"24_CR12","DOI":"10.1109\/SP.2016.55"},{"unstructured":"Leroy, X., Doligez, D., Frisch, A., Garrigue, J., R\u00e9my, D., Vouillon, J.: The OCaml system release 4.02. Institut National de Recherche en Informatique et en Automatique 54 (2014)","key":"24_CR13"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","volume-title":"Advances in Cryptology \u2014 CRYPTO 1987","author":"RC Merkle","year":"1988","unstructured":"Merkle, R.C.: A digital signature based on a conventional encryption function. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 369\u2013378. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_32"},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1145\/2578855.2535851","volume":"49","author":"A Miller","year":"2014","unstructured":"Miller, A., Hicks, M., Katz, J., Shi, E.: Authenticated data structures, generically. ACM SIGPLAN Notices 49(1), 411\u2013423 (2014)","journal-title":"ACM SIGPLAN Notices"},{"issue":"1","key":"24_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inf. Comput. 93(1), 55\u201392 (1991)","journal-title":"Inf. Comput."},{"issue":"2","key":"24_CR17","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1149976.1149977","volume":"2","author":"E Mykletun","year":"2006","unstructured":"Mykletun, E., Narasimha, M., Tsudik, G.: Authentication and integrity in outsourced databases. ACM Trans. Storage (TOS) 2(2), 107\u2013138 (2006)","journal-title":"ACM Trans. Storage (TOS)"},{"unstructured":"Nakamoto, S., et al.: Bitcoin: A Peer-to-Peer Electronic Cash System (2008)","key":"24_CR18"},{"unstructured":"Sasson, E.B., et al.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 459\u2013474. IEEE (2014)","key":"24_CR19"},{"key":"24_CR20","volume-title":"Lectures on the Curry-Howard Isomorphism","author":"MH S\u00f8rensen","year":"2006","unstructured":"S\u00f8rensen, M.H., Urzyczyn, P.: Lectures on the Curry-Howard Isomorphism, vol. 149. Elsevier, Amsterdam (2006)"},{"key":"24_CR21","volume-title":"Haskell: The Craft of Functional Programming","author":"S Thompson","year":"2011","unstructured":"Thompson, S.: Haskell: The Craft of Functional Programming, vol. 2. Addison-Wesley, Boston (2011)"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-59451-5_2","volume-title":"Advanced Functional Programming","author":"P Wadler","year":"1995","unstructured":"Wadler, P.: Monads for functional programming. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol. 925, pp. 24\u201352. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59451-5_2"},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-319-07151-0_8","volume-title":"Functional and Logic Programming","author":"J Yallop","year":"2014","unstructured":"Yallop, J., White, L.: Lightweight higher-kinded polymorphism. In: Codish, M., Sumii, E. (eds.) FLOPS 2014. LNCS, vol. 8475, pp. 119\u2013135. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07151-0_8"}],"container-title":["Lecture Notes in Computer Science","Service-Oriented Computing \u2013 ICSOC 2019 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45989-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T22:03:42Z","timestamp":1745445822000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-45989-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030459888","9783030459895"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45989-5_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSOC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Service-Oriented Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icsoc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icsoc-laas.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conftool pro","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"181","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":"28","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":"12","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":"15% - 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","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":"2","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":"7 posters + 2 invited papers","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)"}}]}}