{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:29:23Z","timestamp":1755034163741,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030315108"},{"type":"electronic","value":"9783030315115"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-31511-5_6","type":"book-chapter","created":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T23:26:53Z","timestamp":1568935613000},"page":"89-106","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Understanding Attestation: Analyzing Protocols that Use Quotes"],"prefix":"10.1007","author":[{"given":"Joshua D.","family":"Guttman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John D.","family":"Ramsdell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Barbosa, M., Portela, B., Scerri, G., Warinschi, B.: Foundations of hardware-based attested computation and application to SGX. In: IEEE EuroS&P, pp. 245\u2013260 (2016)","DOI":"10.1109\/EuroSP.2016.28"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Bhargavan, K., Corin, R., Deni\u00e9lou, P.-M., Fournet, C., Leifer, J.J.: Cryptographic protocol synthesis and verification for multiparty sessions. In: IEEE Computer Security Foundations Symposium (2009)","DOI":"10.1109\/CSF.2009.26"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/1237500.1237504","volume":"10","author":"K Bhargavan","year":"2007","unstructured":"Bhargavan, K., Corin, R., Fournet, C., Gordon, A.D.: Secure sessions for web services. ACM Trans. Inf. Syst. Secur. 10(2), 8 (2007)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"6_CR4","unstructured":"Blanchet, B.: An efficient protocol verifier based on prolog rules. In: IEEE CSFW, pp. 82\u201396. IEEE CS Press, June 2001"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/11818175_32","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"B Blanchet","year":"2006","unstructured":"Blanchet, B., Pointcheval, D.: Automated security proofs with sequences of games. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 537\u2013554. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_32"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Brickell, E., Li, J.: Enhanced privacy ID: a direct anonymous attestation scheme with enhanced revocation capabilities. In: ACM Workshop on Privacy in the Electronic Society, pp. 21\u201330. ACM (2007)","DOI":"10.1145\/1314333.1314337"},{"key":"6_CR7","unstructured":"Van Bulck, J., et al.: Foreshadow: extracting the keys to the intel SGX kingdom with transient out-of-order execution. In: USENIX Security, pp. 991\u20131008 (2018)"},{"issue":"4","key":"6_CR8","doi-asserted-by":"publisher","first-page":"23:1","DOI":"10.1145\/2926715","volume":"17","author":"R Chadha","year":"2016","unstructured":"Chadha, R., Cheval, V., Ciob\u00e2c, \u015e., Kremer, S.: Automated verification of equivalence properties of cryptographic protocols. ACM Trans. Comput. Log. 17(4), 23:1\u201323:32 (2016)","journal-title":"ACM Trans. Comput. Log."},{"issue":"2","key":"6_CR9","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. IJIS 10(2), 63\u201381 (2011)","journal-title":"IJIS"},{"key":"6_CR10","unstructured":"Costan, V., Lebedev, I.A., Devadas, S.: Sanctum: minimal hardware extensions for strong software isolation. In: USENIX Security Symposium, pp. 857\u2013874 (2016)"},{"key":"6_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78636-8","volume-title":"Operational Semantics and Verification of Security Protocols","author":"C Cremers","year":"2012","unstructured":"Cremers, C., Mauw, S.: Operational Semantics and Verification of Security Protocols. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-540-78636-8"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public-key protocols. IEEE Trans. Inf. Theory 29, 198\u2013208 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-319-98938-9_8","volume-title":"Integrated Formal Methods","author":"DJ Dougherty","year":"2018","unstructured":"Dougherty, D.J., Guttman, J.D., Ramsdell, J.D.: Security protocol analysis in context: computing minimal executions using SMT and CPSA. In: Furia, C.A., Winter, K. (eds.) IFM 2018. LNCS, vol. 11023, pp. 130\u2013150. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98938-9_8"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1017\/bsl.2015.7","volume":"21","author":"R Dyckhoff","year":"2015","unstructured":"Dyckhoff, R., Negri, S.: Geometrisation of first-order logic. Bull. Symb. Logic 21(2), 123\u2013163 (2015)","journal-title":"Bull. Symb. Logic"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-03829-7_1","volume-title":"Foundations of Security Analysis and Design V","author":"S Escobar","year":"2009","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: Maude-NPA: cryptographic protocol analysis modulo equational properties. In: Aldini, A., Barthe, G., Gorrieri, R. (eds.) FOSAD 2007-2009. LNCS, vol. 5705, pp. 1\u201350. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03829-7_1"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-31987-0_11","volume-title":"Programming Languages and Systems","author":"C Fournet","year":"2005","unstructured":"Fournet, C., Gordon, A.D., Maffeis, S.: A type discipline for authorization policies. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 141\u2013156. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31987-0_11"},{"issue":"10","key":"6_CR17","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1145\/3022671.2984002","volume":"51","author":"Anitha Gollamudi","year":"2016","unstructured":"Gollamudi, A., Chong, S.: Automatic enforcement of expressive security policies using enclaves. In: OOPSLA, pp. 494\u2013513 (2016)","journal-title":"ACM SIGPLAN Notices"},{"key":"6_CR18","unstructured":"Guttman, J.D.: Shapes: surveying crypto protocol runs. In: Cortier, V., Kremer, S. (eds.) Formal Models and Techniques for Analyzing Security Protocols, Cryptology and Information Security Series. IOS Press (2011)"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"201","DOI":"10.3233\/JCS-140497","volume":"22","author":"JD Guttman","year":"2014","unstructured":"Guttman, J.D.: Establishing and preserving protocol security goals. J. Comput. Secur. 22(2), 201\u2013267 (2014)","journal-title":"J. Comput. Secur."},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/11580850_8","volume-title":"Trustworthy Global Computing","author":"JD Guttman","year":"2005","unstructured":"Guttman, J.D., Herzog, J.C., Ramsdell, J.D., Sniffen, B.T.: Programming cryptographic protocols. In: De Nicola, R., Sangiorgi, D. (eds.) TGC 2005. LNCS, vol. 3705, pp. 116\u2013145. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11580850_8"},{"key":"6_CR21","unstructured":"Guttman, J.D., Ramsdell, J.D.: CPSA inputs for understanding attestation, April 2019. https:\/\/web.cs.wpi.edu\/~guttman\/pubs\/understanding_attestation_example\/"},{"key":"6_CR22","unstructured":"Intel. Intel\u00ae Software Guard Extensions (Intel\u00ae SGX) (2016). https:\/\/software.intel.com\/en-us\/sgx"},{"key":"6_CR23","unstructured":"Intel. Intel\u00ae Software Guard Extensions (Intel\u00ae SGX) data center attestation primitives: ECDSA quote library API, November 2018. https:\/\/download.01.org\/intel-sgx\/dcap-1.0.1\/docs\/Intel_SGX_ECDSA_QuoteGenReference_DCAP_API_Linux_1.0.1.pdf"},{"key":"6_CR24","unstructured":"Kaplan, D., Powell, J., Woller, T.: AMD memory encryption, April 2016. https:\/\/developer.amd.com\/wordpress\/media\/2013\/12\/AMD_Memory_Encryption_Whitepaper_v7-Public.pdf"},{"issue":"5","key":"6_CR25","doi-asserted-by":"publisher","first-page":"583","DOI":"10.3233\/JCS-160556","volume":"24","author":"S Kremer","year":"2016","unstructured":"Kremer, S., K\u00fcnnemann, R.: Automated analysis of security protocols with global state. J. Comput. Secur. 24(5), 583\u2013616 (2016)","journal-title":"J. Comput. Secur."},{"issue":"4","key":"6_CR26","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/138873.138874","volume":"10","author":"B Lampson","year":"1992","unstructured":"Lampson, B., Abadi, M., Burrows, M., Wobber, E.: Authentication in distributed systems: theory and practice. ACM Trans. Comput. Syst. 10(4), 265\u2013310 (1992)","journal-title":"ACM Trans. Comput. Syst."},{"key":"6_CR27","unstructured":"Li, N., Mitchell, J.C., Winsborough, W.H.: Design of a role-based trust management framework. In: Proceedings, 2002 IEEE Symposium on Security and Privacy, pp. 114\u2013130. IEEE CS Press, May 2002"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-030-19052-1_10","volume-title":"Foundations of Security, Protocols, and Equational Reasoning","author":"MD Liskov","year":"2019","unstructured":"Liskov, M.D., Guttman, J.D., Ramsdell, J.D., Rowe, P.D., Thayer, F.J.: Enrich-by-need protocol analysis for Diffie-Hellman. In: Guttman, J.D., Landwehr, C.E., Meseguer, J., Pavlovic, D. (eds.) Foundations of Security, Protocols, and Equational Reasoning. LNCS, vol. 11565, pp. 135\u2013155. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19052-1_10"},{"key":"6_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-642-39799-8_48","volume-title":"Computer Aided Verification","author":"S Meier","year":"2013","unstructured":"Meier, S., Schmidt, B., Cremers, C., Basin, D.: The TAMARIN prover for the symbolic analysis of security protocols. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 696\u2013701. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_48"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Murray, T., van Oorschot, P.C.: Formal proofs, the fine print and side effects. In: IEEE SecDev, September 2018","DOI":"10.1109\/SecDev.2018.00009"},{"issue":"3","key":"6_CR31","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/3079763","volume":"20","author":"J Noorman","year":"2017","unstructured":"Noorman, J., et al.: Sancus 2.0: a low-cost security architecture for IoT devices. ACM Trans. Priv. Secur. 20(3), 7:1\u20137:33 (2017)","journal-title":"ACM Trans. Priv. Secur."},{"key":"6_CR32","unstructured":"Ramsdell, J.D., Guttman, J.D.: CPSA4: a cryptographic protocol shapes analyzer with geometric rules. The MITRE Corporation (2018). https:\/\/github.com\/ramsdell\/cpsa"},{"key":"6_CR33","unstructured":"Ramsdell, J.D., Guttman, J.D., Liskov, M.: CPSA: A cryptographic protocol shapes analyzer (2016). http:\/\/hackage.haskell.org\/package\/cpsa"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Rescorla, E., Ray, M., Dispensa, S., Oskov, N.: Transport Layer Security (TLS) Renegotiation Indication Extension. RFC 5746 (Proposed Standard) (2010)","DOI":"10.17487\/rfc5746"},{"issue":"6","key":"6_CR35","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10207-016-0319-z","volume":"15","author":"Paul D. Rowe","year":"2016","unstructured":"Rowe, P.D., Guttman, J.D., Liskov, M.D.: Measuring protocol strength with security goals. Int. J. Inf. Secur. (2016). https:\/\/doi.org\/10.1007\/s10207-016-0319-z. http:\/\/web.cs.wpi.edu\/~guttman\/pubs\/ijis_measuring-security.pdf","journal-title":"International Journal of Information Security"},{"key":"6_CR36","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-319-21401-6_30","volume-title":"Automated Deduction - CADE-25","author":"S Saghafi","year":"2015","unstructured":"Saghafi, S., Danas, R., Dougherty, D.J.: Exploring theories with a model-finding assistant. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 434\u2013449. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21401-6_30"},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Schuster, F., et al.: VC3: trustworthy data analytics in the cloud using SGX. In: 2015 IEEE S&P, pp. 38\u201354 (2015)","DOI":"10.1109\/SP.2015.10"},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Sinha, R., et al.: A design and verification methodology for secure isolated regions. In: PLDI (2016)","DOI":"10.1145\/2908080.2908113"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Sinha, R., Rajamani, S., Seshia, S., Vaswani, K.: Moat: verifying confidentiality of enclave programs. In: ACM CCS, Moat (2015)","DOI":"10.1145\/2810103.2813608"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Subramanyan, P., Sinha, R., Lebedev, I.A. Devadas, S., Seshia, S.A.: A formal foundation for secure remote execution of enclaves. In: ACM CCS (2017)","DOI":"10.1145\/3133956.3134098"}],"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-31511-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T00:06:08Z","timestamp":1726790768000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-31511-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030315108","9783030315115"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31511-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 September 2019","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":"Luxembourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","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":"26 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2019","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":"stm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/stm2019.uni.lu\/","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":"23","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":"9","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":"1","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":"39% - 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":"2.91","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.23","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":"This content has been made available to all.","name":"free","label":"Free to read"}]}}