By Topic

One-time capabilities for authorizations without trust

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bussard, L. ; Inst. Eurocom, Sophia Antipolis, France ; Molva, R.

This paper introduces and solves a security problem of pervasive computing: how to define authorizations for off-line interactions when trust relationships among entities do not exist. A new type of capability is proposed to assure that user interactions are not traceable and that misbehaving users automatically lose some money they deposited as a guarantee of their loyalty. The solution inspired by electronic cash is based on a new version of the cut-and-choose protocol adapted for open environments.

Published in:

Pervasive Computing and Communications, 2004. PerCom 2004. Proceedings of the Second IEEE Annual Conference on

Date of Conference:

14-17 March 2004