Optimistic validation of electronic tickets
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Electronic tickets, or e-tickets, give evidence that their holders have permission to enter a place of entertainment, use a means of transportation, or have access to some Internet services. E-tickets can be stored in desktop computers or personal digital assistants for future use. Before being used, e-tickets have to be validated to prevent duplication, and ensure authenticity and integrity. The paper discusses e-ticket validation in contexts in which users cannot be trusted and validation servers may fail by crashing. The paper considers formal definitions for the e-ticket problem and proposes an optimistic protocol for validation of e-tickets. The protocol is optimistic in the sense that its best performance is achieved when e-tickets are validated only once.Keywords
This publication has 8 references indexed in Scilit:
- Asynchronous group mutual exclusionDistributed Computing, 2000
- The state of the art in electronic payment systemsComputer, 1997
- Unreliable failure detectors for reliable distributed systemsJournal of the ACM, 1996
- The dangers of replication and a solutionPublished by Association for Computing Machinery (ACM) ,1996
- Atomicity in electronic commercePublished by Association for Computing Machinery (ACM) ,1996
- A Taxonomy of Distributed Mutual ExclusionJournal of Parallel and Distributed Computing, 1993
- Fault-tolerant critical section management in asynchronous environmentsInformation and Computation, 1991
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978