ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Virtual monotonic counters and count-limited objects using a TPM without a trusted OS
Full text PdfPdf (448 KB)
Source Conference on Computer and Communications Security archive
Proceedings of the first ACM workshop on Scalable trusted computing table of contents
Alexandria, Virginia, USA
SESSION: Applications and compliance table of contents
Pages: 27 - 42  
Year of Publication: 2006
ISBN:1-59593-548-7
Authors
Luis F. G. Sarmenta  Massachusetts Institute of Technology, Cambridge, MA
Marten van Dijk  Massachusetts Institute of Technology, Cambridge, MA
Charles W. O'Donnell  Massachusetts Institute of Technology, Cambridge, MA
Jonathan Rhodes  Massachusetts Institute of Technology, Cambridge, MA
Srinivas Devadas  Massachusetts Institute of Technology, Cambridge, MA
Sponsors
ACM: Association for Computing Machinery
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 85,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1179474.1179485
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Balfe, A. Lakhani, and K. Paterson. Securing peer-to-peer networks using trusted computing. In C. Mitchell, editor, Trusted Computing, chapter 10. IEE, 2005.
 
2
L. Bauer, K. D. Bowers, F. Pfenning, and M. K. Reiter. Consumable credentials in logic-based access control. Technical Report CMU-CYLAB-06-002, CyLab, Carnegie Mellon University, Feb. 2006.
 
3
4
 
5
 
6
D. Chaum. Blind signatures for untraceable payments. In Advances in Cryptology - Crypto '82 Proceedings, pages 199--203. Plenum Press, 1982.
 
7
D. Chess, B. Grosof, C. Harrison, D. Levine, C. Parris, and G. Tsudik. Itinerant agents for mobile computing. IEEE Personal Communications, 2(5):34--49, Oct. 1985.
 
8
A. Dent and G. Price. Certificate management using distributed trusted third parties. In C. Mitchell, editor, Trusted Computing, chapter 9. IEE, 2005.
 
9
E. Gallery. An overview of trusted computing technology. In C. Mitchell, editor, Trusted Computing, chapter 3. IEE, 2005.
 
10
E. Gallery and A. Tomlinson. Secure delivery of conditional access applications to mobile receivers. In C. Mitchell, editor, Trusted Computing, chapter 7. IEE, 2005.
 
11
 
12
S. Goldwasser, G. Rothblum, and Y. Kalai. One-time programs. Personal communication, June 2006.
 
13
F. Hohl. Time limited blackbox security: Protecting mobile agents from malicious hosts. Lecture Notes in Computer Science, 1419, 1998.
 
14
IBM. Linux TPM Device Driver. http://tpmdd.sourceforge.net/.
 
15
IBM. SecureBlue. http://domino.watson.ibm.com/ comm/pr.nsf/pages/news.20060410_security.html, 2006.
 
16
Intel. LaGrande Technology. http://www.intel.com/technology/security/, 2003.
 
17
H. Kim, J. Baek, B. Lee, and K. Kim. Secret computation with secrets for mobile agent using one-time proxy signature. In Proceedings of the 2001 Symposium on Cryptography and Information Security, 2001.
 
18
U. Maheshwari, R. Vingralek, and W. Shapiro. How to Build a Trusted Database System on Untrusted Storage. In Proceedings of OSDI 2000, 2000.
 
19
R. Merkle. A certified digital signature. In manuscript, 1979.
 
20
C. Mitchell, editor. Trusted Computing. The Institution of Electrical Engineers, 2005.
 
21
M. Naor and K. Nissim. Certificate revocation and certificate update. In Proceedings 7th USENIX Security Symposium (San Antonio, Texas), 1998.
 
22
L. Nguyen and R. Safavi-Naini. Dynamic k-times anonymous authentication. In Applied Cryptography and Network Security (ACNS 2005), volume 3531 of Lecture Notes in Computer Science, pages 318--333, 2005.
 
23
 
24
M. Peinado, P. England, and Y. Chen. An overview of NGSCB. In C. Mitchell, editor, Trusted Computing, chapter 4. IEE, 2005.
 
25
L. F. G. Sarmenta, M. van Dijk, C. W. O'Donnell, J. Rhodes, and S. Devadas. Virtual Monotonic Counters and Count-Limited Objects using a TPM without a Trusted OS (Extended Version). MIT CSAIL Technical Report (to be published), Sept. 2006. http://publications.csail.mit.edu/.
26
27
 
28
I. Teranishi, J. Furukawa, and K. Sako. k-times anonymous authentication (extended abstract). In ASIACRYPT 2004, volume 3329 of Lecture Notes in Computer Science, pages 308--322, 2004.
 
29
Trusted Computing Group. TPM v1.2 specification changes. https://www.trustedcomputinggroup.org/groups/tpm/TPM_1_2_Changes_final.pdf, 2003.
 
30
Trusted Computing Group. TCG TPM Specification version 1.2, Revisions 62--94 (Design Principles, Structures of the TPM, and Commands). https://www.trustedcomputinggroup.org/specs/TPM/, 2003-2006.
 
31

CITED BY  7

Collaborative Colleagues:
Luis F. G. Sarmenta: colleagues
Marten van Dijk: colleagues
Charles W. O'Donnell: colleagues
Jonathan Rhodes: colleagues
Srinivas Devadas: colleagues