{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:03:36Z","timestamp":1743005016642,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031331695"},{"type":"electronic","value":"9783031331701"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33170-1_13","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:55:27Z","timestamp":1685710527000},"page":"207-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Framework for Policy Based Negotiation"],"prefix":"10.1007","author":[{"given":"Anna","family":"Fritz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5387-9157","authenticated-orcid":false,"given":"Perry","family":"Alexander","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"13_CR1","unstructured":"Baez, F.E.V.: Evaluating SGX\u2019s remote attestation security through the analysis of Copland phrases (2022)"},{"key":"13_CR2","unstructured":"Barclay, T.: Proof-producing synthesis of cakeml from coq. PhD Proposal (2022)"},{"key":"13_CR3","doi-asserted-by":"publisher","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development: Coq\u2019Art: The Calculus of Inductive Constructions. Springer Science & Business Media, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-662-07964-5","DOI":"10.1007\/978-3-662-07964-5"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Carrel, D., Harkins, D.: The Internet Key Exchange (IKE). RFC 2409, November 1998. https:\/\/www.rfc-editor.org\/info\/rfc2409","DOI":"10.17487\/rfc2409"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10207-011-0124-7","volume":"10","author":"G Coker","year":"2011","unstructured":"Coker, G., et al.: Principles of remote attestation. Int. J. Inf. Secur. 10(2), 63\u201381 (2011)","journal-title":"Int. J. Inf. Secur."},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-88625-9_1","volume-title":"Information and Communications Security","author":"G Coker","year":"2008","unstructured":"Coker, G., Guttman, J., Loscocco, P., Sheehy, J., Sniffen, B.: Attestation: evidence and trust. In: Chen, L., Ryan, M.D., Wang, G. (eds.) ICICS 2008. LNCS, vol. 5308, pp. 1\u201318. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88625-9_1"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Eldefrawy, K., Rattanavipanon, N., Tsudik, G.: Hydra: hybrid design for remote attestation (using a formally verified microkernel). In: Proceedings of the 10th ACM Conference on Security and Privacy in wireless and Mobile Networks, pp. 99\u2013110 (2017)","DOI":"10.1145\/3098243.3098261"},{"key":"13_CR8","unstructured":"Haldar, V., Chandra, D., Franz, M.: Semantic remote attestation - a virtual machine directed approach to trusted computing. In: Proceedings of the Third Virtual Machine Research and Technology Symposium. San Jose, CA, May 2004"},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3470535","volume":"24","author":"SC Helble","year":"2021","unstructured":"Helble, S.C., Kretz, I.D., Loscocco, P.A., Ramsdell, J.D., Rowe, P.D., Alexander, P.: Flexible mechanisms for remote attestation. ACM Trans. Priv. Secur. (TOPS) 24(4), 1\u201323 (2021)","journal-title":"ACM Trans. Priv. Secur. (TOPS)"},{"key":"13_CR10","unstructured":"Howard, W.A.: The formulae-as-types notion of construction (1969)"},{"key":"13_CR11","unstructured":"Huang, X., Peng, Y.: An effective approach for remote attestation in trusted computing. In: WISA 2009: Proceedings of the 2nd International Symposium on Web Information Systems and Applications, January 2009"},{"key":"13_CR12","unstructured":"Martin, A., et al.: The ten page introduction to trusted computing. Technical report CS-RR-08-11, Oxford University Computing Labratory, Oxford, UK (2008)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Maughan, D., Schertler, M., Schneider, M., Turner, J.: Internet security association and key management protocol RFC 2048 (ISAKMP). Technical report, The Internet Engineering Task Force of The Internet Society, November 1998","DOI":"10.17487\/rfc2408"},{"key":"13_CR14","unstructured":"Nunes, I.D.O., Eldefrawy, K., Rattanavipanon, N., Steiner, M., Tsudik, G.: $$\\{$$VRASED$$\\}$$: a verified hardware\/software co-design for remote attestation. In: 28th $$\\{$$USENIX$$\\}$$ Security Symposium ($$\\{$$USENIX$$\\}$$ Security 19), pp. 1429\u20131446 (2019)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Pendergrass, J.A., Helble, S., Clemens, J., Loscocco, P.: Maat: a platform service for measurement and attestation. arXiv preprint arXiv:1709.10147 (2017)","DOI":"10.1109\/MILCOM.2018.8599735"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Petz, A., Alexander, P.: A copland attestation manager. In: Hot Topics in Science of Security (HoTSoS 2019). Nashville, TN, 8\u201311 April 2019","DOI":"10.1145\/3314058.3314060"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-030-76384-8_17","volume-title":"NASA Formal Methods","author":"A Petz","year":"2021","unstructured":"Petz, A., Alexander, P.: An infrastructure for faithful execution of remote attestation protocols. In: Dutle, A., Moscato, M.M., Titolo, L., Mu\u00f1oz, C.A., Perez, I. (eds.) NFM 2021. LNCS, vol. 12673, pp. 268\u2013286. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76384-8_17"},{"key":"13_CR18","doi-asserted-by":"publisher","unstructured":"Petz, A., Jurgensen, G., Alexander, P.: Design and formal verification of a copland-based attestation protocol. In: Proceedings of the 19th ACM-IEEE International Conference on Formal Methods and Models for System Design, pp. 111\u2013117. MEMOCODE 2021, Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3487212.3487340","DOI":"10.1145\/3487212.3487340"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Ramsdell, J., et al.: Orchestrating layered attestations. In: Principles of Security and Trust (POST 2019). Prague, Czech Republic, 8\u201311 April 2019","DOI":"10.1007\/978-3-030-17138-4_9"},{"key":"13_CR20","unstructured":"Ramsdell, J.: Chase: a model finder for finitary geometric logic (2020). https:\/\/github.com\/ramsdell\/chase"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Rowe, P.D.: Confining adversary actions via measurement. In: Proceedings of the Third International Workshop on Graphical Models for Security, pp. 150\u2013166 (2016a)","DOI":"10.1007\/978-3-319-46263-9_10"},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Rowe, P.D.: Bundling evidence for layered attestation. In: Franz, M., Papadimitratos, P. (eds.) Trust 2016. LNCS, vol. 9824, pp. 119\u2013139. Springer, Cham (2016b). https:\/\/doi.org\/10.1007\/978-3-319-45572-3_7","DOI":"10.1007\/978-3-319-45572-3_7"},{"key":"13_CR23","unstructured":"Steffen, A.: strongswan, October 2021. https:\/\/www.strongswan.org\/. Accessed 29 June 2022"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33170-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:57:21Z","timestamp":1685710641000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33170-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331695","9783031331701"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33170-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Houston, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/nfm-2023","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"26","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":"3","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":"35% - 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.9","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":"6","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)"}}]}}