{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,11]],"date-time":"2025-12-11T20:58:05Z","timestamp":1765486685972,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030918583"},{"type":"electronic","value":"9783030918590"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91859-0_7","type":"book-chapter","created":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T22:09:51Z","timestamp":1638569391000},"page":"122-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Deciding a Fragment of $$(\\alpha , \\beta )$$-Privacy"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9028-1480","authenticated-orcid":false,"given":"Laouen","family":"Fernet","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6901-8319","authenticated-orcid":false,"given":"Sebastian","family":"M\u00f6dersheim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,4]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-540-27836-8_7","volume-title":"Automata, Languages and Programming","author":"M Abadi","year":"2004","unstructured":"Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 46\u201358. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27836-8_7"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.tcs.2003.12.023","volume":"322","author":"M Abadi","year":"2004","unstructured":"Abadi, M., Fournet, C.: Private authentication. Theoret. Comput. Sci. 322(3), 427\u2013476 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Basin, D., Dreier, J., Sasse, R.: Automated symbolic proofs of observational equivalence. In: 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 1144\u20131155. ACM (2015)","DOI":"10.1145\/2810103.2813662"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-23822-2_19","volume-title":"Computer Security \u2013 ESORICS 2011","author":"D Bernhard","year":"2011","unstructured":"Bernhard, D., Cortier, V., Pereira, O., Smyth, B., Warinschi, B.: Adapting helios for provable ballot privacy. In: Atluri, V., Diaz, C. (eds.) ESORICS 2011. LNCS, vol. 6879, pp. 335\u2013354. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23822-2_19"},{"issue":"1\u20132","key":"7_CR6","first-page":"1","volume":"1","author":"B Blanchet","year":"2016","unstructured":"Blanchet, B.: Modeling and verifying security protocols with the applied pi calculus and ProVerif. Found. Trends Priv. Secur. 1(1\u20132), 1\u2013135 (2016)","journal-title":"Found. Trends Priv. Secur."},{"key":"7_CR7","unstructured":"Boutet, A., et al.: Contact tracing by giant data collectors: opening Pandora\u2019s box of threats to privacy, sovereignty and national security. University works (2020). https:\/\/hal.inria.fr\/hal-03116024"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Cortier, V.: Computational soundness of observational equivalence. In: 15th ACM Conference on Computer and Communications Security, pp. 109\u2013118. ACM (2008)","DOI":"10.1145\/1455770.1455786"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Cortier, V., Delaune, S.: A method for proving observational equivalence. In: 2009 22nd IEEE Computer Security Foundations Symposium, pp. 266\u2013276. IEEE (2009)","DOI":"10.1109\/CSF.2009.9"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Cortier, V., Dupressoir, F., Dr\u0103gan, C.C., Schmidt, B., Strub, P.Y., Warinschi, B.: Machine-checked proofs of privacy for electronic voting protocols. In: 2017 IEEE Symposium on Security and Privacy, pp. 993\u20131008. IEEE (2017)","DOI":"10.1109\/SP.2017.28"},{"key":"7_CR11","unstructured":"Genesereth, M., Hinrichs, T.: Herbrand logic. Technical report, LG-2006-02, Stanford University (2006)"},{"key":"7_CR12","unstructured":"Gondron, S., M\u00f6dersheim, S., Vigan\u00f2, L.: Privacy as reachability. Technical report, DTU (2021). http:\/\/www2.compute.dtu.dk\/~samo\/abg.pdf"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-642-45221-5_41","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"SA M\u00f6dersheim","year":"2013","unstructured":"M\u00f6dersheim, S.A., Gro\u00df, T., Vigan\u00f2, L.: Defining privacy is supposed to be easy. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) LPAR 2013. LNCS, vol. 8312, pp. 619\u2013635. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45221-5_41"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Iovino, V., Vaudenay, S., Vuagnoux, M.: On the effectiveness of time travel to inject COVID-19 alerts. Cryptology ePrint Archive, Report 2020\/1393 (2020)","DOI":"10.1007\/978-3-030-75539-3_18"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3289255","volume":"22","author":"S M\u00f6dersheim","year":"2019","unstructured":"M\u00f6dersheim, S., Vigan\u00f2, L.: Alpha-beta privacy. ACM Trans. Priv. Secur. 22(1), 1\u201335 (2019)","journal-title":"ACM Trans. Priv. Secur."},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-319-66845-1_28","volume-title":"Integrated Formal Methods","author":"M Moran","year":"2017","unstructured":"Moran, M., Wallach, D.S.: Verification of STAR-vote and evaluation of FDR and ProVerif. In: Polikarpova, N., Schneider, S. (eds.) IFM 2017. LNCS, vol. 10510, pp. 422\u2013436. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66845-1_28"},{"key":"7_CR17","unstructured":"Vaudenay, S., Vuagnoux, M.: Analysis of SwissCovid (2020). https:\/\/lasec.epfl.ch\/people\/vaudenay\/swisscovid\/swisscovid-ana.pdf"}],"container-title":["Lecture Notes in Computer Science","Security and Trust Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91859-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,3]],"date-time":"2021-12-03T22:17:49Z","timestamp":1638569869000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91859-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030918583","9783030918590"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91859-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"STM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Security and Trust Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Darmstadt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2021","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":"stm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.nics.uma.es\/pub\/stm2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","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":"10","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":"0","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":"38% - 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.38","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.5","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":"The workshop was held online due to the COVID-19 pandemic","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)"}}]}}