{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T21:51:36Z","timestamp":1770328296612,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,8]],"date-time":"2010-10-08T00:00:00Z","timestamp":1286496000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,10,8]]},"DOI":"10.1145\/1866835.1866854","type":"proceedings-article","created":{"date-parts":[[2010,10,12]],"date-time":"2010-10-12T15:38:31Z","timestamp":1286897911000},"page":"103-108","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":73,"title":["Determinating timing channels in compute clouds"],"prefix":"10.1145","author":[{"given":"Amittai","family":"Aviram","sequence":"first","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]},{"given":"Sen","family":"Hu","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]},{"given":"Bryan","family":"Ford","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]},{"given":"Ramakrishna","family":"Gummadi","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2010,10,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"CCAW","author":"Ach\u00e7mez O.","year":"2007","unstructured":"}} O. Ach\u00e7mez . Yet another microarchitectural attack: Exploiting I-cache . In CCAW , Nov. 2007 . }}O. Ach\u00e7mez. Yet another microarchitectural attack: Exploiting I-cache. In CCAW, Nov. 2007."},{"key":"e_1_3_2_1_2_1","volume-title":"CT-RSA","author":"Ach\u00e7mez O.","year":"2007","unstructured":"}} O. Ach\u00e7mez , \u00c7etin Kaya Ko\u00e7, and J.-P. Seifert . Predicting secret keys via branch prediction . In CT-RSA , Feb. 2007 . }}O. Ach\u00e7mez, \u00c7etin Kaya Ko\u00e7, and J.-P. Seifert. Predicting secret keys via branch prediction. In CT-RSA, Feb. 2007."},{"key":"e_1_3_2_1_3_1","volume-title":"Feb.","author":"Aviram A.","year":"2010","unstructured":"}} A. Aviram and B. Ford . Deterministic consistency: A programming model for shared memory parallelism , Feb. 2010 . http:\/\/arxiv.org\/abs\/0912.0926. }}A. Aviram and B. Ford. Deterministic consistency: A programming model for shared memory parallelism, Feb. 2010. http:\/\/arxiv.org\/abs\/0912.0926."},{"key":"e_1_3_2_1_4_1","volume-title":"9th OSDI","author":"Aviram A.","year":"2010","unstructured":"}} A. Aviram , S.-C. Weng , S. Hu , and B. Ford . Determinator: OS support for race-free deterministic parallelism . In 9th OSDI , Oct. 2010 . To appear. http:\/\/arxiv.org\/abs\/1005.3450. }}A. Aviram, S.-C. Weng, S. Hu, and B. Ford. Determinator: OS support for race-free deterministic parallelism. In 9th OSDI, Oct. 2010. To appear. http:\/\/arxiv.org\/abs\/1005.3450."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1736020.1736029"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640096"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/224056.224077"},{"key":"e_1_3_2_1_8_1","volume-title":"1st HotPar.","author":"Bocchino R. L.","year":"2009","unstructured":"}} R. L. Bocchino Jr . et al. Parallel programming must be deterministic by default . In 1st HotPar. Mar. 2009 . }}R. L. Bocchino Jr. et al. Parallel programming must be deterministic by default. In 1st HotPar. Mar. 2009."},{"key":"e_1_3_2_1_9_1","volume-title":"12th USENIX Security Symposium","author":"Brumley D.","year":"2003","unstructured":"}} D. Brumley and D. Boneh . Remote timing attacks are practical . In 12th USENIX Security Symposium , Aug. 2003 . }}D. Brumley and D. Boneh. Remote timing attacks are practical. In 12th USENIX Security Symposium, Aug. 2003."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/121132.121159"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.20"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508255"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060309"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346256.1346273"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1403375.1403735"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095810.1095813"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/238721.238769"},{"key":"e_1_3_2_1_18_1","first-page":"471","volume-title":"Information Processing","author":"Kahn G.","year":"1974","unstructured":"}} G. Kahn . The semantics of a simple language for parallel programming . In Information Processing , pages 471 -- 475 . 1974 . }}G. Kahn. The semantics of a simple language for parallel programming. In Information Processing, pages 471--475. 1974."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/357369.357374"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1456508.1456514"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676929"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2006.180"},{"key":"e_1_3_2_1_23_1","volume-title":"SREIS'02 2nd Symposium on Requirements Engineering for Information Security, oct","author":"Liu L.","year":"2002","unstructured":"}} L. Liu , E. Yu , and J. Mylopoulos . Analyzing security requirements as relationships among strategic actors . In SREIS'02 2nd Symposium on Requirements Engineering for Information Security, oct 2002 . }}L. Liu, E. Yu, and J. Mylopoulos. Analyzing security requirements as relationships among strategic actors. In SREIS'02 2nd Symposium on Requirements Engineering for Information Security, oct 2002."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1346281.1346323"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1983.236733"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2009.5071532"},{"key":"e_1_3_2_1_27_1","unstructured":"}}C. Percival. Cache missing for fun and profit. In BSDCan May2005.  }}C. Percival. Cache missing for fun and profit. In BSDCan May2005."},{"key":"e_1_3_2_1_28_1","volume-title":"DATE","author":"N.","year":"2006","unstructured":"}} N. R. Potlapally et al. Satisfiability-based framework for enabling side-channel attacks on cryptographic software . In DATE , Mar. 2006 . }}N. R. Potlapally et al. Satisfiability-based framework for enabling side-channel attacks on cryptographic software. In DATE, Mar. 2006."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653687"},{"key":"e_1_3_2_1_30_1","volume-title":"HotCloud","author":"Santos N.","year":"2009","unstructured":"}} N. Santos , K. P. Gummadi , and R. Rodrigues . Towards trusted cloud computing . In HotCloud , June 2009 . }}N. Santos, K. P. Gummadi, and R. Rodrigues. Towards trusted cloud computing. In HotCloud, June 2009."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273025"},{"key":"e_1_3_2_1_32_1","volume-title":"USENIX Security Symposium","author":"Song D.","year":"2001","unstructured":"}} D. Song , D. Wagner , and X. Tian . Timing analysis of keystrokes and SSH timing attacks . In USENIX Security Symposium , 2001 . }}D. Song, D. Wagner, and X. Tian. Timing analysis of keystrokes and SSH timing attacks. In USENIX Security Symposium, 2001."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11767480_18"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSAC.2006.20"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/RISP.1991.130767"},{"key":"e_1_3_2_1_36_1","volume-title":"7th OSDI","author":"Zeldovich N.","year":"2006","unstructured":"}} N. Zeldovich , S. Boyd-Wickizer , E. Kohler , and D. Mazi\u00e8res . Making information flow explicit in HiStar . In 7th OSDI , Nov. 2006 . }}N. Zeldovich, S. Boyd-Wickizer, E. Kohler, and D. Mazi\u00e8res. Making information flow explicit in HiStar. In 7th OSDI, Nov. 2006."}],"event":{"name":"CCS '10: 17th ACM Conference on Computer and Communications Security 2010","location":"Chicago Illinois USA","acronym":"CCS '10","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2010 ACM workshop on Cloud computing security workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866835.1866854","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1866835.1866854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:59Z","timestamp":1750243979000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866835.1866854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,8]]},"references-count":36,"alternative-id":["10.1145\/1866835.1866854","10.1145\/1866835"],"URL":"https:\/\/doi.org\/10.1145\/1866835.1866854","relation":{},"subject":[],"published":{"date-parts":[[2010,10,8]]},"assertion":[{"value":"2010-10-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}