{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T20:47:52Z","timestamp":1726001272087},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030032500"},{"type":"electronic","value":"9783030032517"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-03251-7_21","type":"book-chapter","created":{"date-parts":[[2018,11,23]],"date-time":"2018-11-23T07:12:07Z","timestamp":1542957127000},"page":"179-185","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["From Secure Messaging to Secure Collaboration"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kleppmann","sequence":"first","affiliation":[]},{"given":"Stephan A.","family":"Kollmann","sequence":"additional","affiliation":[]},{"given":"Diana A.","family":"Vasile","sequence":"additional","affiliation":[]},{"given":"Alastair R.","family":"Beresford","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,24]]},"reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/3-540-48285-7_24","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1993","author":"J Benaloh","year":"1994","unstructured":"Benaloh, J., de Mare, M.: One-way accumulators: a decentralized alternative to digital signatures. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 274\u2013285. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_24"},{"key":"21_CR2","unstructured":"Castro, M., Liskov, B.H.: Practical Byzantine fault tolerance. In: 3rd USENIX Symposium on Operating Systems Design and Implementation (OSDI), February 1999"},{"key":"21_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4842-0076-6","volume-title":"Pro Git","author":"S Chacon","year":"2014","unstructured":"Chacon, S., Straub, B.: Pro Git, 2nd edn. Apress, New York (2014). https:\/\/git-scm.com\/book\/en\/v2","edition":"2"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Cohn-Gordon, K., Cremers, C., Garratt, L., Millican, J., Milner, K.: On ends-to-ends encryption: asynchronous group messaging with strong security guarantees. Technical report, 2017\/666, IACR Cryptology ePrint, July 2017. https:\/\/eprint.iacr.org\/2017\/666","DOI":"10.1145\/3243734.3243747"},{"issue":"2","key":"21_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1504\/IJCCBS.2011.041257","volume":"2","author":"M Correia","year":"2011","unstructured":"Correia, M., Veronese, G.S., Neves, N.F., Verissimo, P.: Byzantine consensus in asynchronous message-passing systems: a survey. Int. J. Crit. Comput.-Based Syst. 2(2), 141\u2013161 (2011). https:\/\/doi.org\/10.1504\/IJCCBS.2011.041257","journal-title":"Int. J. Crit. Comput.-Based Syst."},{"issue":"OOPSLA","key":"21_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3133933","volume":"1","author":"Victor B. F. Gomes","year":"2017","unstructured":"Gomes, V.B.F., Kleppmann, M., Mulligan, D.P., Beresford, A.R.: Verifying strong eventual consistency in distributed systems. In: Proceedings of the ACM on Programming Languages (PACMPL), vol. 1, no. (OOPSLA), October 2017. https:\/\/doi.org\/10.1145\/3133933","journal-title":"Proceedings of the ACM on Programming Languages"},{"key":"21_CR7","series-title":"IFIP International Federation for Information Processing","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/0-306-46998-7_16","volume-title":"Trusted Information","author":"Y Kim","year":"2002","unstructured":"Kim, Y., Perrig, A., Tsudik, G.: Communication-efficient group key agreement. In: Dupuy, M., Paradinas, P. (eds.) SEC 2001. IIFIP, vol. 65, pp. 229\u2013244. Springer, Boston, MA (2002). https:\/\/doi.org\/10.1007\/0-306-46998-7_16"},{"issue":"10","key":"21_CR8","doi-asserted-by":"publisher","first-page":"2733","DOI":"10.1109\/TPDS.2017.2697382","volume":"28","author":"M Kleppmann","year":"2017","unstructured":"Kleppmann, M., Beresford, A.R.: A conflict-free replicated JSON datatype. IEEE Trans. Parallel Distrib. Syst. 28(10), 2733\u20132746 (2017). https:\/\/doi.org\/10.1109\/TPDS.2017.2697382","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Laurie, B., Langley, A., Kasper, E.: RFC 6962: certificate transparency. IETF, June 2013. https:\/\/tools.ietf.org\/html\/rfc6962","DOI":"10.17487\/rfc6962"},{"key":"21_CR10","doi-asserted-by":"publisher","unstructured":"Lerner, A., Zeng, E., Roesner, F.: Confidante: usable encrypted email: a case study with lawyers and journalists. In: 2nd IEEE European Symposium on Security and Privacy, pp. 385\u2013400, April 2017. https:\/\/doi.org\/10.1109\/EuroSP.2017.41","DOI":"10.1109\/EuroSP.2017.41"},{"key":"21_CR11","unstructured":"McGregor, S.E., Charters, P., Holliday, T., Roesner, F.: Investigating the computer security practices and needs of journalists. In: 24th USENIX Security Symposium, August 2015"},{"key":"21_CR12","unstructured":"McGregor, S.E., Watkins, E.A., Al-Ameen, M.N., Caine, K., Roesner, F.: When the weakest link is strong: secure collaboration in the case of the panama papers. In: 26th USENIX Security Symposium, August 2017"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"R\u00f6sler, P., Mainka, C., Schwenk, J.: More is less: on the end-to-end security of group chats in signal, WhatsApp, and Threema. Technical report, 2017\/713, IACR Cryptology ePrint, January 2018. https:\/\/eprint.iacr.org\/2017\/713","DOI":"10.1109\/EuroSP.2018.00036"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-24550-3_29","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Shapiro","year":"2011","unstructured":"Shapiro, M., Pregui\u00e7a, N., Baquero, C., Zawirski, M.: Conflict-free replicated data types. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 386\u2013400. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24550-3_29"},{"key":"21_CR15","doi-asserted-by":"publisher","unstructured":"Unger, N., et al.: SoK: secure messaging. In: IEEE Symposium on Security and Privacy, pp. 232\u2013249, May 2015. https:\/\/doi.org\/10.1109\/SP.2015.22","DOI":"10.1109\/SP.2015.22"},{"key":"21_CR16","unstructured":"WhatsApp Inc.: Connecting one billion users every day, July 2017. https:\/\/blog.whatsapp.com\/10000631\/Connecting-One-Billion-Users-Every-Day"}],"container-title":["Lecture Notes in Computer Science","Security Protocols XXVI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03251-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,15]],"date-time":"2020-11-15T21:06:24Z","timestamp":1605474384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03251-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030032500","9783030032517"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03251-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"Security Protocols","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge International Workshop on Security Protocols","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spw2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spw2018.crocs.fi.muni.cz","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"the workshop is invitation only","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"email","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"N\/A% - 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"}},{"value":"0.0","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0.0","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"the workshop is invitation only","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}