Results 11 - 20
of
25
Verification of Receipts from M-Commerce Transactions on NFC Cellular Phones
"... Abstract—A main challenge in mobile commerce is to make it possible for users to manage their transaction histories from both online e-commerce transactions and in-person transactions. Such histories are typically useful to build credit or to establish trust based on past transactions. In this paper ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
(Show Context)
Abstract—A main challenge in mobile commerce is to make it possible for users to manage their transaction histories from both online e-commerce transactions and in-person transactions. Such histories are typically useful to build credit or to establish trust based on past transactions. In this paper we propose an approach to manage electronic receipts on cellular devices by assuring their secure and privacy-preserving usage. We provide a comprehensive notion of transactions history including both on-line transaction and in-person transactions. We apply cryptographic protocols, such as secret sharing and zero knowledge proofs, in a potentially vulnerable and constrained setting. Specifically, our approach supports flexible strategies based on Shamir’s secret sharing to cater to different user requirements and architectural constraints. In addition, aggregate zero knowledge proofs are used to efficiently support proofs of various receipt attributes. We have implemented the system on Nokia NFC cellular phones and report in the paper performance evaluation results. I.
A secure mobile electronic payment architecture platform for wireless mobile networks
- IEEE Transactions on Wireless Communications
, 2008
"... Abstract—When the basic functionalities of a wireless mobile network have been achieved, customers are then more interested in value-added mobile applications. In order to attract more customers to such mobile applications, a solid, secure and robust trading model is a must. This paper proposes such ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—When the basic functionalities of a wireless mobile network have been achieved, customers are then more interested in value-added mobile applications. In order to attract more customers to such mobile applications, a solid, secure and robust trading model is a must. This paper proposes such a secure trading model named Mobile Electronic Payment (MEP) for wireless mobile networks, which applies the emerging ID-based cryptography for key agreement and authentication. Our MEP attempts to alleviate the computational cost, reduce the memory space requirement in mobile devices, and meet the requirements for secure trading: avoidance of overspending and double spending, fairness, user anonymity and privacy. Our design is transparent to the bearer networks and is of low deployment cost. We expect that our MEP provides a viable trading architecture model for the future mobile applications. Index Terms—Mobile application, security, micropayment, bilinear pairing, identity-based cryptography, billing.
Implementing fine and coarse grained payment mechanisms using WebCom
"... In a Grid environment applications are executed on distributed resources. Applications can be divided into separate parts for distributed and sequential execution. Typically, complete applications consisting of many parts may be executed on both local and remote resources. Computing resources may ex ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
In a Grid environment applications are executed on distributed resources. Applications can be divided into separate parts for distributed and sequential execution. Typically, complete applications consisting of many parts may be executed on both local and remote resources. Computing resources may expect some form of payment in exchange for services used. In this situation there are two scenarios where credit can be claimed: either in increments by executing parts of an application(fine grained) or by executing a complete application(coarse grained). This paper presents fine and coarse grained Condensed Graph applications and methods adopted for secure submission of applications. It also contrasts the payment mechanism for these approaches in WebCom. Many grid middlewares such as PBS, Torque, LSF and others employ a coarse grained approach for application distribution. Fine grained execution is partially supported by subdividing the application. Here we show both fine grain and coarse grain approaches to application distribution.
Personal Security Environment on Palm PDA
"... Digital signature schemes are based on the assumption that the signing key is kept in secret. Ensuring that this assumption holds is one of the most crucial problems for all current digital signature applications. This paper describes the solution developed and prototyped by the authors – using a mo ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Digital signature schemes are based on the assumption that the signing key is kept in secret. Ensuring that this assumption holds is one of the most crucial problems for all current digital signature applications. This paper describes the solution developed and prototyped by the authors – using a mobile computing device with a smart card reader for creating digital signatures. We give an overview of several common settings for digital signature applications and problems they have, describing also several frameworks for mobile security applications. A discussion about the choice of devices, design issues, concrete solutions and their security concerns follows. We conclude that although nothing can prevent careless private key handling, careful management is easier and more convenient when using our solution. 1
WANTED: A Theft-Deterrent Solution for the Pervasive Computing World
, 2000
"... This paper presents a new theft-deterrent system called WANTED 1 . The system relies on credits and blacklists, with each protected device periodically requesting new credit in order to continue operating. The main features of WANTED are resistance to attacks, guaranteed privacy, and scalability. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
This paper presents a new theft-deterrent system called WANTED 1 . The system relies on credits and blacklists, with each protected device periodically requesting new credit in order to continue operating. The main features of WANTED are resistance to attacks, guaranteed privacy, and scalability. The client part is a hybrid system consisting of an untrusted software component and a trusted hardware component. This offers maximum flexibility, while keeping the hardware requirements low. I. INTRODUCTION Portable high-tech devices tend to be valuable, therefore attractive candidates for theft. A variety of theft-protection methods already exist, see Fig. 1. They can be combined to increase the level of protection. Wireless signals can be used to prevent devices equipped with such transmitters from being removed from protected premises [1]. In contrast to physical locks, tracking is transparent to the user. Passive tracking systems, such as serial number registries, are easy to install,...
Light-weight Micro-Cash for the Internet
- ESORICS'96 Proceedings
, 1996
"... Abstract. We propose a micro-cash technique based on a one-time sig-nature scheme: signing a message more than once leads to disclosure of the signer's private key. In addition to usual cash properties such as off-fine bank for payment and spender's anonymity, the technique also provides a ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract. We propose a micro-cash technique based on a one-time sig-nature scheme: signing a message more than once leads to disclosure of the signer's private key. In addition to usual cash properties such as off-fine bank for payment and spender's anonymity, the technique also provides a number of useful features. These include: identifying double spender with strong proof, cash revocable for identified double spender, independent of using tamper-resistant devices, coin sub-divisible to smal-ler denominations, and system simplicity in terms of small-sized data for cash representation as well as simple protocols for cash withdrawal, pay-ment and deposit. We reason that these features support a lightweight cash system suitable for handling very low value payment transactions, such as information purchases on the Internet.
Practical Service Charge for P2P Content Distribution
"... Abstract. With emerging decentralized technologies, peer-to-peer (P2P) content distribution arises as a new model for storage and transmission of data. In this scenario, one peer can be playing different roles, either as a distributor or as a receiver of digital contents. In order to incentivize the ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. With emerging decentralized technologies, peer-to-peer (P2P) content distribution arises as a new model for storage and transmission of data. In this scenario, one peer can be playing different roles, either as a distributor or as a receiver of digital contents. In order to incentivize the legal distribution of these contents and prevent the network from free riders, we propose a charging model where distributors become merchants and receivers become customers. To help in the advertisement of digital contents and collection of payment details, an intermediary agent is introduced. An underlying P2P payment protocol presented in [1] is applied to this scenario without total trust on the intermediary agent. 1
unknown title
"... efficient "single-term " coins using no cut-and-choose were subsequently achieved by Brands [4] and by Ferguson [18]. Brands further generalised the line method into a "representation of Diffie Hellman problem in groups of prime orders " [6] which can be used to d ..."
Abstract
- Add to MetaCart
efficient "single-term " coins using no cut-and-choose were subsequently achieved by Brands [4] and by Ferguson [18]. Brands further generalised the line method into a "representation of Diffie Hellman problem in groups of prime orders " [6] which can be used to design an electronic wallet with an observer nested in. Eng and Okamoto combined the Brands ' representation problem with the binary-tree method for an improved efficiency ofdivisible coins [17]. Recently, Okamoto proposed an idea of "electronic license " [24]. Using a bit-commitment method, a bank can give its customer (an account holder) an "electronic license " which tells a payee the method to verify money issued by it. An electronic license contains a blinded composite number whose factorisation reveals the identity of a bank account holder. The factorisation can be computed if double spent coins are deposited (with the license). It is our understanding that all of the previous off-line cash techniques known to us have a common problem which can be referred to as an inability to swiftly stop an identified double spender from further spending. In these schemes, during the payment time the payee only check the format legitimacy of coins rather than checking whether any of them has been spent before. Proposals using tamper-resistant devices or observers (e.g., [4, 5, 6, 16]) only intend to make
