Results 1  10
of
11
Traffic Analysis: Protocols, Attacks, Design Issues and Open Problems
 PROCEEDINGS OF INTERNATIONAL WORKSHOP ON DESIGN ISSUES IN ANONYMITY AND UNOBSERVABILITY
, 2001
"... We present the traffic analysis problem and expose the most important protocols, attacks and design issues. Afterwards, we propose directions for further research. As we are mostly interested in efficient and practical Internet based protocols, most of the emphasis is placed on mix based constructio ..."
Abstract

Cited by 125 (0 self)
 Add to MetaCart
We present the traffic analysis problem and expose the most important protocols, attacks and design issues. Afterwards, we propose directions for further research. As we are mostly interested in efficient and practical Internet based protocols, most of the emphasis is placed on mix based constructions. The presentation is informal in that no complex definitions and proofs are presented, the aim being more to give a thorough introduction than to present deep new insights.
A Generalized Birthday Problem
 In CRYPTO
, 2002
"... We study a kdimensional generalization of the birthday problem: given k lists of nbit values, nd some way to choose one element from each list so that the resulting k values xor to zero. For k = 2, this is just the extremely wellknown birthday problem, which has a squareroot time algorithm ..."
Abstract

Cited by 93 (0 self)
 Add to MetaCart
We study a kdimensional generalization of the birthday problem: given k lists of nbit values, nd some way to choose one element from each list so that the resulting k values xor to zero. For k = 2, this is just the extremely wellknown birthday problem, which has a squareroot time algorithm with many applications in cryptography.
Privacyenhancing technologies for the Internet
"... The increased use of the Internet for everyday activities is bringing new threats to personal privacy. This paper gives an overview of existing and potential privacyenhancing technologies for the Internet, as well as motivation and challenges for future work in this field. ..."
Abstract

Cited by 91 (5 self)
 Add to MetaCart
The increased use of the Internet for everyday activities is bringing new threats to personal privacy. This paper gives an overview of existing and potential privacyenhancing technologies for the Internet, as well as motivation and challenges for future work in this field.
PerformanceDriven Interconnect Design Based on Distributed RC Delay Model
 in Proc. Design Automation Conf
, 1993
"... In this paper, we study the interconnect design problem under a distributed RC delay model. We study the impact of technology factors on the interconnect designs and present general formulations of the interconnect topology design and wiresizing problems. We show that interconnect topology optimizat ..."
Abstract

Cited by 67 (21 self)
 Add to MetaCart
In this paper, we study the interconnect design problem under a distributed RC delay model. We study the impact of technology factors on the interconnect designs and present general formulations of the interconnect topology design and wiresizing problems. We show that interconnect topology optimization can be achieved by computing optimal generalized rectilinear Steiner arborescences and we present an efficient algorithm which yields optimal or nearoptimal solutions. We reveal several important properties of optimal wire width assignments and present a polynomial time optimal wiresizing algorithm. Extensive experimental results indicate that our approach significantly outperforms other routing methods for highperformance IC and MCM designs. Our interconnect designs reduce the interconnection delays by up to 66% as compared to those by the best known Steiner tree algorithm. 1 Introduction As the VLSI fabrication technology reaches submicron device dimension and gigahertz frequency, ...
Optimal Wiresizing Under the Distributed Elmore Delay Model
 in Proc. Int. Conf. on Computer Aided Design
, 1993
"... In this paper, we study the optimal wiresizing problem under the distributed Elmore delay model. We show that the optimal wiresizing solutions satisfy a number of interesting properties, including the separability, the monotone property, and the dominance property. Based on these properties, we deve ..."
Abstract

Cited by 53 (26 self)
 Add to MetaCart
In this paper, we study the optimal wiresizing problem under the distributed Elmore delay model. We show that the optimal wiresizing solutions satisfy a number of interesting properties, including the separability, the monotone property, and the dominance property. Based on these properties, we develop a polynomialtime optimal wiresizing algorithm for arbitrary interconnect structures under the distributed Elmore delay model. Extensive experimental results show that our wiresizing solution reduces interconnection delay by up to 51% when compared to the uniformwidth solution of the same routing topology. Furthermore, compared to the wiresizing solution based on a simpler RC delay model in [7], our wiresizing solution reduces the total wiring area by up to 28% while further reducing the interconnection delays to the timingcritical sinks by up to 12%. 1 Introduction As the VLSI fabrication technology reaches submicron device dimension and gigahertz frequency, interconnection delay has...
A Generalized Birthday Problem (extended abstract)
 In Advances in Cryptology – CRYPTO 2002
, 2002
"... We study a kdimensional generalization of the birthday problem: given k lists of nbit values, and some way to choose one element from each list so that the resulting k values xor to zero. For k = 2, this is just the extremely wellknown birthday problem, which has a squareroot time algorithm with ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We study a kdimensional generalization of the birthday problem: given k lists of nbit values, and some way to choose one element from each list so that the resulting k values xor to zero. For k = 2, this is just the extremely wellknown birthday problem, which has a squareroot time algorithm with many applications in cryptography. In this paper, we show new algorithms for the case k > 2: we show a cuberoot time algorithm for the case of k = 4 lists, and we give an algorithm with subexponential running time when k is unrestricted.
Lyapunov Method for the Stability of Fluid Networks
 Operations Research Letters
, 2000
"... One of the primary tools in establishing the stability of a fluid network is to construct a Lyapunov function. In this paper, we establish the sufficiency in the use of a Lyapunov function. Specifically, we show that a necessary and sufficient condition for the stability of a generic fluid network ( ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
One of the primary tools in establishing the stability of a fluid network is to construct a Lyapunov function. In this paper, we establish the sufficiency in the use of a Lyapunov function. Specifically, we show that a necessary and sufficient condition for the stability of a generic fluid network (GFN) is the existence of a Lyapunov function for its fluid level process. Then by applying this result to various specific fluid networks, including a fluid network under all workconserving service disciplines, a fluid network under a priority service discipline, and a fluid network under a FIFO service discipline, we establish the existence of a Lyapunov function for their fluid level processes is a necessary and sufficient condition for their stabilities. The result is also applied to various fluid limit models and a linear Skorohod problem.
SemiConjugate Direction Methods for Real Positive Definite Systems
, 2003
"... In this preliminary work, left and right conjugate direction vectors are defined for nonsymmetric, nonsingular matrices A and some properties of these vectors are studied. A left conjugate direction (LCD) method for solving general systems of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this preliminary work, left and right conjugate direction vectors are defined for nonsymmetric, nonsingular matrices A and some properties of these vectors are studied. A left conjugate direction (LCD) method for solving general systems of
On the Construction of Optimal or NearOptimal Rectilinear Steiner Arborescence
, 1994
"... Given a set of nodes N lying on the first quadrant of the Euclidean Plane E 2 , the Rectilinear Minimum Steiner Arborescence (RMSA) problem is to find a shortestpath tree of the minimum length rooted at the origin, containing all nodes in N , and composed solely of horizontal and vertical arcs or ..."
Abstract
 Add to MetaCart
Given a set of nodes N lying on the first quadrant of the Euclidean Plane E 2 , the Rectilinear Minimum Steiner Arborescence (RMSA) problem is to find a shortestpath tree of the minimum length rooted at the origin, containing all nodes in N , and composed solely of horizontal and vertical arcs oriented only from left to right or from bottom to top [1]. In this paper, we propose an efficient algorithm for constructing optimal or nearoptimal arborescences, and present a constructive method for finding a lower bound of the length of the optimal arborescence. Experimental results indicate that the arborescences constructed by our algorithm are optimal in 71% of the cases tested, and the average tree length is within 1% from optimal. We also present an application of the RMSA formulation in the performancedriven interconnect design for the highspeed VLSI circuits. Extensive experimental results show that our approach significantly outperforms other conventional routing methods for hig...
SemiConjugate Direction Methods for Nonsymmetric Systems
"... In this preliminary work, left and right conjugate vectors are defined for nonsymmetric, nonsingular matrices A and some properties of these vectors are studied. A left conjugate direction (LCD) method for solving nonsymmetric systems of linear equations is proposed. The method reduces to the usual ..."
Abstract
 Add to MetaCart
In this preliminary work, left and right conjugate vectors are defined for nonsymmetric, nonsingular matrices A and some properties of these vectors are studied. A left conjugate direction (LCD) method for solving nonsymmetric systems of linear equations is proposed. The method reduces to the usual conjugate gradient method when A is symmetric positive definite. A finite termination property of the semiconjugate direction method is shown, providing a new simple proof of the finite termination property of conjugate gradient methods. The new method is well defined for all nonsingular Mmatrices. Some techniques for overcoming breakdown are suggested for general nonsymmetric A. The connection between the semiconjugate direction method and LU decomposition is established. The semiconjugate direction method is successfully applied to solve some sample linear