In this paper we propose an anonymous mobile payment system based on a group blind signature scheme in order to prevent blackmailing. The message transfer from the customer to the merchant occurs only once during the payment protocol. Also, the amount of communication between customer and merchant is about 900 Bytes. Therefore, our mobile payment system can be used in the wireless networks with...

We consider delivering interactive dramas. A viewer interacts with a contents provider by answering multiple-choice questions and the answers to these questions influence the plot of delivered story. All possible plots can be represented by a directed graph such that every plot corresponds to some path of the graph. A delivery should be controlled according to the directed graph such that each ...

With the rapid evolution of intelligent computing and networking technology, security support is a must for the emerging networked embedded systems. As a key building block of the security infrastructure for the networked embedded systems, the design of signature schemes is one of the most critical aspects in the research field of secure networked embedded systems. In this paper, we propose a n...

Deducibility constraints represent in a symbolic way the infinite set of possible executions of a finite protocol. Solving a deducibility constraint amounts to finding all possible ways of filling the gaps in a proof. For finite local inference systems, there is an algorithm that reduces any deducibility constraint to a finite set of solved forms. This allows one to decide any trace security pr...

In a (t, n) threshold proxy signature scheme, an original signer can delegate the signature authority to a proxy group of n member such that t or more than t proxy signers can cooperatively sign messages on behalf of the original signer, but t − 1 or fewer proxy signers cannot generate a valid proxy signature. In this paper, we review the security of C. L. Hsu et al.’s threshold proxy signature...

We propose a generic method to construct forward-secure signature schemes from standard signature schemes. The proposed construction is more computationally efficient than previously proposed schemes. In particular, the key updating operation in the proposed scheme is orders of magnitude more computationally efficient than previous schemes, making it attractive for a variety of applications, su...