Results 11 - 20
of
24
A Secure Pay-per-view Scheme for Web-based Video Service?
"... Abstract. With the development of high speed computer networks, video service on the Web has huge market potential in that the video service can be provided to subscribers with greater time and schedule exibility compared to the current cable TV system. Under the pay-perview (PPV) scheme, subscriber ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Abstract. With the development of high speed computer networks, video service on the Web has huge market potential in that the video service can be provided to subscribers with greater time and schedule exibility compared to the current cable TV system. Under the pay-perview (PPV) scheme, subscribers only need to pay for the programs that they have watched. A critical issue on PPV service is the capability of settling disputes over PPV service charges. This is especially important in the case that the Internet communication could be interrupted (by accident or deliberately) in the middle of a viewing session. This paper proposes a fair PPV billing protocol for web-based video service. With this protocol, a video service will be divided into small units, and a subscriber needs to submit cryptographic evidence which enables fair billing based on the number of units being provided in a viewing session. In addition, by the establishment of a one-way sequential link, the validity of evidence is maintained e ciently without any involvement of trusted third parties. Our scheme is light-weighted in terms of the storage requirement and computation overheads on subscribers, thus subscribers can request PPV service securely with their own smart cards regardless of their physical location.
APPROVED BY: DESIGN AND DEVELOPMENT OF CRYPTOGRAPHIC FAIR EXCHANGE PROTOCOLS
, 2004
"... In this thesis, the problem of fair exchange on specific cases is addressed. The main idea of fair exchange is as follows: Two entities that do not trust each other want to exchange some arbitrary data over a communication network. Since they do not trust each other, neither party wants to transmit ..."
Abstract
- Add to MetaCart
In this thesis, the problem of fair exchange on specific cases is addressed. The main idea of fair exchange is as follows: Two entities that do not trust each other want to exchange some arbitrary data over a communication network. Since they do not trust each other, neither party wants to transmit their own data before receiving the other entity’s data. Even though either party could prove an unjust situation after termination of the protocol, if they are in different countries, solving disputes may require time and money due to the bureaucracy of international laws. In this thesis, a special application of fair exchange, a fair e-commerce protocol for large e-goods is designed and implemented. The proposed protocol provides a method for fair exchange of e-money to e-products, and a method for verifying the contents of the exchanged items. The presented protocol is efficient such that when none of the parties tries to cheat, only three messages are sufficient. In case of disputes, three more messages are needed. Furthermore, in most of the previously proposed protocols in the literature, e-goods are transferred multiple times among some entities.
An Optimistic Fair E-Commerce Protocol for Large E-Goods
"... Abstract- Suppose two entities that do not trust each other want to exchange some arbitrary data over a public channel. A fair exchange protocol ensures that both parties get what they want or neither gets anything. In this paper, a fair e-commerce protocol for large e-goods is proposed and implemen ..."
Abstract
- Add to MetaCart
Abstract- Suppose two entities that do not trust each other want to exchange some arbitrary data over a public channel. A fair exchange protocol ensures that both parties get what they want or neither gets anything. In this paper, a fair e-commerce protocol for large e-goods is proposed and implemented. The proposed protocol provides a method for the fair exchange of e-money for e-products, and a method for verifying the contents of the exchanged items. The protocol is optimistic and efficient such that when none of the parties tries to cheat, only three messages are sufficient. In case of disputes, three more messages are needed. Furthermore, the customer remains anonymous after the transaction; thus, no information about the customers ' shopping habits can be gathered through the protocol. The implementation results show that the protocol is efficient and secure and that only a small number of cryptographic operations is sufficient. I.
