One-Time Capabilities for Authorizations without Trust

Authors:
Laurent Bussard;Refik Molva
Affiliations:
-;-
Venue:
PERCOM '04 Proceedings of the Second IEEE International Conference on Pervasive Computing and Communications (PerCom'04)
Year:
2004

Citing 0
Cited 3

Virtual monotonic counters and count-limited objects using a TPM without a trusted OS

Proceedings of the first ACM workshop on Scalable trusted computing
Offline count-limited certificates

Proceedings of the 2008 ACM symposium on Applied computing
Counting abuses using flexible off-line credentials

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces and solves a security problem ofpervasive computing: how to define authorizations for off-lineinteractions when trust relationships among entities donot exist. A new type of capability is proposed to assurethat user interactions are not traceable and that misbehavingusers automatically lose some money they deposited asa guarantee of their loyalty. The solution inspired by electroniccash is based on a new version of the cut-and-chooseprotocol adapted for open environments.