{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:10:43Z","timestamp":1743045043726,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030549961"},{"type":"electronic","value":"9783030549978"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-54997-8_11","type":"book-chapter","created":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T20:11:50Z","timestamp":1597090310000},"page":"167-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Calculus of Chaos in Stochastic Compilation"],"prefix":"10.1007","author":[{"given":"Peter T.","family":"Breuer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon J.","family":"Pickin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,11]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-36563-8_9","volume-title":"Engineering Secure Software and Systems","author":"PT Breuer","year":"2013","unstructured":"Breuer, P.T., Bowen, J.P.: A fully homomorphic crypto-processor design: correctness of a secret computer. In: J\u00fcrjens, J., Livshits, B., Scandariato, R. (eds.) ESSoS 2013. LNCS, vol. 7781, pp. 123\u2013138. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-36563-8_9"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Breuer, P., Bowen, J.: Chaotic compilation: a (statistical) cloak for a secret computer. In: Proceedings of 1st Annual International Workshop SW\/HW Interaction Faults (SHIFT 2019), IEEE International Symposium on SW Reliability Engineering Workshops (ISSREW 2019), CA, USA, pp. 428\u2013433. IEEE, October 2019. \nhttps:\/\/doi.org\/10.1109\/ISSREW.2019.00106","DOI":"10.1109\/ISSREW.2019.00106"},{"issue":"1\/2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1504\/IJCCBS.2019.10020015","volume":"9","author":"P Breuer","year":"2019","unstructured":"Breuer, P., Bowen, J.: A fully encrypted high-speed microprocessor architecture: the secret computer in simulation. Int. J. Crit. Comput.-Based Sys. 9(1\/2), 26\u201355 (2019). \nhttps:\/\/doi.org\/10.1504\/IJCCBS.2019.10020015","journal-title":"Int. J. Crit. Comput.-Based Sys."},{"key":"11_CR4","unstructured":"Breuer, P., Bowen, J.: (Un)encrypted computing and indistinguishability obfuscation, January 2019. \nhttp:\/\/arxiv.org\/abs\/1811.12365v1\n\n. Principles of Secure Compilation (PriSC 2019) at 46th ACM Symposium on Principles of Programming Languages (POPL 2019)"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Breuer, P., Bowen, J., Palomar, E., Liu, Z.: A practical encrypted microprocessor. In: Callegari, C., et al. (eds.) Proceedings of 13th International Conference on Security and Cryptography (SECRYPT 2016), Port, vol. 4, pp. 239\u2013250. SCITEPRESS, July 2016. \nhttps:\/\/doi.org\/10.5220\/0005955902390250","DOI":"10.5220\/0005955902390250"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Breuer, P., Bowen, J., Palomar, E., Liu, Z.: On obfuscating compilation for encrypted computing. In: Samarati, P., et al. (eds.) Proceedings of 14th International Conference on Security and Cryptography (SECRYPT 2017), Port, pp. 247\u2013254. SCITEPRESS, July 2017. \nhttps:\/\/doi.org\/10.5220\/0006394002470254","DOI":"10.5220\/0006394002470254"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-030-01950-1_12","volume-title":"Information and Communications Security","author":"PT Breuer","year":"2018","unstructured":"Breuer, P.T., Bowen, J.P., Palomar, E., Liu, Z.: On security in encrypted computing. In: Naccache, D., et al. (eds.) ICICS 2018. LNCS, vol. 11149, pp. 192\u2013211. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-030-01950-1_12"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Breuer, P., Bowen, J., Palomar, E., Liu, Z.: Superscalar encrypted RISC: the measure of a secret computer. In: Proceedings of 17th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom 2018), pp. 1336\u20131341. IEEE Computer Society (2018). \nhttps:\/\/doi.org\/10.1109\/TrustCom\/BigDataSE.2018.00184","DOI":"10.1109\/TrustCom\/BigDataSE.2018.00184"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-1-4612-4808-8_2","volume-title":"Open Problems in Communication and Computation","author":"JH Conway","year":"1987","unstructured":"Conway, J.H.: FRACTRAN: a simple universal programming language for arithmetic. In: Cover, T.M., Gopinath, B. (eds.) Open Problems in Communication and Computation, pp. 4\u201326. Springer, Heidelberg (1987). \nhttps:\/\/doi.org\/10.1007\/978-1-4612-4808-8_2"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M van Dijk","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24\u201343. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13190-5_2"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Fletcher, C.W., van Dijk, M., Devadas, S.: A secure processor architecture for encrypted computation on untrusted programs. In: Proceedings of 7th ACM Workshop on Scalable Trusted Computing (STC 2012), pp. 3\u20138. ACM, New York (2012). \nhttps:\/\/doi.org\/10.1145\/2382536.2382540","DOI":"10.1145\/2382536.2382540"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of 41st Annual ACM Symposium on Theory of Computing (STOC 2009), NY, USA, pp. 169\u2013178 (2009). \nhttps:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-20465-4_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"C Gentry","year":"2011","unstructured":"Gentry, C., Halevi, S.: Implementing gentry\u2019s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129\u2013148. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-20465-4_9"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption & how to play mental poker keeping secret all partial information. In: Proceedings of Annual ACM Symposium on Theory of Computing (STOC 1982), pp. 365\u2013377. ACM (1982). \nhttps:\/\/doi.org\/10.1145\/800070.802212","DOI":"10.1145\/800070.802212"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28, 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/3-540-46674-6_11","volume-title":"Advances in Computing Science \u2014 ASIAN\u201999","author":"JI den Hartog","year":"1999","unstructured":"den Hartog, J.I.: Verifying probabilistic programs using a hoare like logic. In: Thiagarajan, P.S., Yap, R. (eds.) ASIAN 1999. LNCS, vol. 1742, pp. 113\u2013125. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-46674-6_11"},{"issue":"10","key":"11_CR17","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969). \nhttps:\/\/doi.org\/10.1145\/363235.363259","journal-title":"Commun. ACM"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Irena, F., Murphy, D., Parameswaran, S.: CryptoBlaze: a partially homomorphic processor with multiple instructions and non-deterministic encryption support. In: Proceedings of 23rd Asia and South Pacific Design Automation Conference (ASP-DAC 2018), pp. 702\u2013708. IEEE (2018)","DOI":"10.1109\/ASPDAC.2018.8297404"},{"key":"11_CR19","unstructured":"ISO\/IEC: Programming languages - C. 9899:201x Technical report, n1570, International Organization for Standardization, August 2011. JTC 1, SC 22, WG 14"},{"issue":"3","key":"11_CR20","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1145\/229542.229547","volume":"18","author":"C Morgan","year":"1996","unstructured":"Morgan, C., McIver, A., Seidel, K.: Probabilistic predicate transformers. ACM Trans. Prog. Lang. Syst. (TOPLAS) 18(3), 325\u2013353 (1996). \nhttps:\/\/doi.org\/10.1145\/229542.229547","journal-title":"ACM Trans. Prog. Lang. Syst. (TOPLAS)"},{"issue":"3","key":"11_CR21","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948). \nhttps:\/\/doi.org\/10.1002\/j.1538-7305.1948.tb01338.x","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"11_CR22","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF01935330","volume":"11","author":"Y Sundblad","year":"1971","unstructured":"Sundblad, Y.: The Ackermann function: a theoretical, computational, and formula manipulative study. BIT Numer. Math. 11(1), 107\u2013119 (1971)","journal-title":"BIT Numer. Math."},{"issue":"6","key":"11_CR23","first-page":"875","volume":"34","author":"NG Tsoutsos","year":"2015","unstructured":"Tsoutsos, N.G., Maniatakos, M.: The HEROIC framework: encrypted computation without shared keys. IEEE TCAD IC Syst. 34(6), 875\u2013888 (2015)","journal-title":"IEEE TCAD IC Syst."},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE (1986). \nhttps:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Formal Methods. FM 2019 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54997-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,10]],"date-time":"2020-08-10T20:15:22Z","timestamp":1597090522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-54997-8_11"}},"subtitle":["Engineering in the Cause of Mathematics"],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549961","9783030549978"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54997-8_11","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":"11 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/formalmethods2019.inesctec.pt\/?page_id=84","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":"129","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":"44","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":"7","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":"34% - 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":"4","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":"5,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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}