Signature schemes with message recovery have been wildly investigated a decade ago in the literature, but the first ID-based signature with message recovery goes out into the world until 2005. In this paper, we first point out and revise one little but important problem which occurs in the previous ID-based signature with message recovery scheme. Then, by completely different setting, we propos...

In 2000, Lee and Chang proposed a user identification scheme with key distribution preserving anonymity for distributed computer networks. Recently, Wu and Hsu pointed out that there are two weaknesses in the LeeChang scheme. They further not only proposed a new scheme to remedy the security leaks of the Lee-Chang scheme, but also reduced computation complexities and communication cost as compa...

In this paper we propose a very efficient two-round k-out-of-n oblivious transfer scheme, in which R sends O(k) messages to S, and S sends O(n) messages back to R. The computation cost of R and S is reasonable as R needs O(k) operations and S needs O(n) operations. The choices of R are unconditionally secure and the secrecy of unchosen messages is guaranteed as well if the decisional bilinear D...

The Yang-Shieh authentication is a timestamp based password authentication scheme that uses smart cards [1]. In [2,3], various attacks on this scheme are described. However, an enhancement of the scheme is proposed in [3] and enables the scheme to resist these existing attacks. In this paper, we show two new attack that can break the enhanced scheme. We further point out that the fundamental co...

This paper proposes an out-of-order execution control scheme that can be effectively applied to a coprocessor for embedded systems. A floating-point coprocessor has generally multiple pipelines such as a floating-point adder, a floating-point multiplier, a floating-point divider and a load/store pipelines. In order to utilize fully these pipelines, a constraint-based dynamic control scheme is d...

In an ` out of n threshold scheme, ` out of n members must cooperate to recover a secret. A kleptographic attack is a backdoor which can be implemented in an algorithm and further used to retrieve a user’s secret key. We combine the notions of threshold scheme and kleptographic attack to construct the first ` out of n threshold kleptographic attack on discrete logarithm based digital signatures...

6] Daniel B. Karron. The \spiderweb" algorithm for surface construction in noisy volume data. The pattern of density readings created by the two curves in gure 11 are identical. Thus one cannot distinguish a double surface crossing (or any even number of crossings) between two adjacent sampling points from no crossing at all. The key point here is that there is no reason to interpolate an addit...

sink location is considered as a basic service in geographic routing in wireless sensor networks. obtaining the location of sink node by source node using an efficient method with low complexity has always been a challenging issue in research. in this paper, a sink location algorithm based on fano plane is proposed. the research challenge is how to ensure the intersection of two slq and sla rou...