使用TPM的虚拟单调计数器和计数限制对象,而不需要可信的操作系统

L. Sarmenta, Marten van Dijk, C. W. O'Donnell, Jonathan Rhodes, S. Devadas
{"title":"使用TPM的虚拟单调计数器和计数限制对象,而不需要可信的操作系统","authors":"L. Sarmenta, Marten van Dijk, C. W. O'Donnell, Jonathan Rhodes, S. Devadas","doi":"10.1145/1179474.1179485","DOIUrl":null,"url":null,"abstract":"A trusted monotonic counter is a valuable primitive that enables a wide variety of highly scalable offline and decentralized applications that would otherwise be prone to replay attacks, including offline payment, e-wallets, virtual trusted storage, and digital rights management (DRM). In this paper, we show how one can implement a very large number of virtual monotonic counters on an untrusted machine with a Trusted Platform Module (TPM) or similar device, without relying on a trusted OS. We first present a log-based scheme that can be implemented with the current version of the TPM (1.2) and used in certain applications. We then show how the addition of a few simple features to the TPM makes it possible to implement a hash-tree-based scheme that not only offers improved performance and scalability compared to the log-based scheme, but also makes it possible to implement count-limited objects (or ``clobs'' for short) -- i.e., encrypted keys, data, and other objects that can only be used when an associated virtual monotonic counter is within a certain range. Such count-limited objects include n-time use keys, n-out-of-m data blobs, n-copy migratable objects, and other variants, which have many potential uses in digital rights management (DRM), digital cash, itinerant computing, and other application areas.","PeriodicalId":401412,"journal":{"name":"Scalable Trusted Computing","volume":"140 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"111","resultStr":"{\"title\":\"Virtual monotonic counters and count-limited objects using a TPM without a trusted OS\",\"authors\":\"L. Sarmenta, Marten van Dijk, C. W. O'Donnell, Jonathan Rhodes, S. Devadas\",\"doi\":\"10.1145/1179474.1179485\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A trusted monotonic counter is a valuable primitive that enables a wide variety of highly scalable offline and decentralized applications that would otherwise be prone to replay attacks, including offline payment, e-wallets, virtual trusted storage, and digital rights management (DRM). In this paper, we show how one can implement a very large number of virtual monotonic counters on an untrusted machine with a Trusted Platform Module (TPM) or similar device, without relying on a trusted OS. We first present a log-based scheme that can be implemented with the current version of the TPM (1.2) and used in certain applications. We then show how the addition of a few simple features to the TPM makes it possible to implement a hash-tree-based scheme that not only offers improved performance and scalability compared to the log-based scheme, but also makes it possible to implement count-limited objects (or ``clobs'' for short) -- i.e., encrypted keys, data, and other objects that can only be used when an associated virtual monotonic counter is within a certain range. Such count-limited objects include n-time use keys, n-out-of-m data blobs, n-copy migratable objects, and other variants, which have many potential uses in digital rights management (DRM), digital cash, itinerant computing, and other application areas.\",\"PeriodicalId\":401412,\"journal\":{\"name\":\"Scalable Trusted Computing\",\"volume\":\"140 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"111\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scalable Trusted Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1179474.1179485\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scalable Trusted Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1179474.1179485","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 111

摘要

可信单调计数器是一种有价值的原语,它支持各种高度可扩展的离线和分散的应用程序,否则这些应用程序很容易受到重放攻击,包括离线支付、电子钱包、虚拟可信存储和数字版权管理(DRM)。在本文中,我们展示了如何使用可信平台模块(Trusted Platform Module, TPM)或类似设备在不受信任的机器上实现大量虚拟单调计数器,而不依赖于受信任的操作系统。我们首先提出一个基于日志的方案,该方案可以在当前版本的TPM(1.2)上实现,并在某些应用程序中使用。然后,我们将展示向TPM添加一些简单的特性如何使实现基于哈希树的方案成为可能,与基于日志的方案相比,这种方案不仅提供了改进的性能和可伸缩性,而且还使实现计数限制对象(简称“clob”)成为可能——即加密的密钥、数据和其他对象,这些对象只能在相关的虚拟单调计数器在一定范围内时使用。这类限制计数的对象包括n-time使用键、n- of-m数据blob、n-copy可迁移对象和其他变体,它们在数字版权管理(DRM)、数字现金、巡回计算和其他应用程序领域中有许多潜在的用途。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Virtual monotonic counters and count-limited objects using a TPM without a trusted OS
A trusted monotonic counter is a valuable primitive that enables a wide variety of highly scalable offline and decentralized applications that would otherwise be prone to replay attacks, including offline payment, e-wallets, virtual trusted storage, and digital rights management (DRM). In this paper, we show how one can implement a very large number of virtual monotonic counters on an untrusted machine with a Trusted Platform Module (TPM) or similar device, without relying on a trusted OS. We first present a log-based scheme that can be implemented with the current version of the TPM (1.2) and used in certain applications. We then show how the addition of a few simple features to the TPM makes it possible to implement a hash-tree-based scheme that not only offers improved performance and scalability compared to the log-based scheme, but also makes it possible to implement count-limited objects (or ``clobs'' for short) -- i.e., encrypted keys, data, and other objects that can only be used when an associated virtual monotonic counter is within a certain range. Such count-limited objects include n-time use keys, n-out-of-m data blobs, n-copy migratable objects, and other variants, which have many potential uses in digital rights management (DRM), digital cash, itinerant computing, and other application areas.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信