2853176
Loop Fusion via Retiming for DSP Applications
17091320
Universal routing in distributed networks
We show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. We show that from a routing perspective the fat-stack is efficient and is suitable for use as a baseline distributed network We prove that the fat-stack is universal by routing efficiency. A requirement for the fat-stack to be universal is that link capacities double up the levels of the network. We use methods developed in the areas of VLSI and processor interconnect for much of our analysis. Our universality proof shows that a fat-stack of area /spl Theta/(A) can simulate any competing network of area A with O(log/sup 3/2/ A) overhead independently of wire delay. The universality result implies that the fat-stack of a given size is nearly the best routing network of that size. The fat-stack is also the minimal universal network for an O(log/sup 3/2/ A) overhead in terms of number of links.
875545
Multiplex Encryption: A Practical Approach to Encrypting Multi-recipient Emails
Efficiently protecting the privacy of multi-recipient emails is not as trivial as it seems. The approach proposed by S/MIME is to concatenate all ciphertexts. However, it suffers from poor scalability due to its linear computation and communication cost. In this paper, we propose a new practical and secure scheme, called multiplex encryption. By combining the ideas of identity-based mediated RSA and re-encryption mix network, our framework only requires constant computation and communication cost to encrypt a multi-recipient email.
29590146
Multi-proxy Signature and Proxy Multi-signature Schemes from Bilinear Pairings
In electronic world, proxy signature is a solution of delegation of signing capabilities. Proxy signatures can combine other special signatures to obtain some new types of proxy signatures. Due to the various applications of the bilinear pairings in cryptography, many pairing-based signature schemes have been proposed. In this paper, we propose a multi-proxy signature scheme and a proxy multi-signature scheme from bilinear pairings. We also show that both of them satisfy all the security properties required by proxy signatures.
41230139
Comments on an access control model in semantic grid
In this note, we show that there are some significant design weaknesses in the access control model that proposed to address the convergence and consistence problems in semantic grid by Bu and Xu in a recent paper.
195349585
Identity Based Conference Key Distribution Scheme from Parings
A conference key distribution system can provide a session key of a conference with more than three participants via network. In this paper,we propose an ID-based conference key distribution scheme from pairings. The proposed scheme provides user anonymity. At the same time, we also show that the proposed scheme is secure against replaying attacks and conspiratorial impersonation attacks.
18013503
An Efficient Asynchronous Proactive RSA Scheme
In this paper, we present an efficient asynchronous proactive RSA scheme. This paper has three contributions. Firstly, we present an asynchronous verifiable secret sharing protocol. Secondly, we propose an efficient asynchronous threshold RSA signature generation protocol. Thirdly, we propose an efficient asynchronous share refreshing protocol