Learn More
This paper examines the compression beneets that can be obtained by reordering the bands of a multispectral image. In particular, we consider a model of lossless image compression in which each band of a multispectral image is coded using a prediction function involving values from a previously coded band of the compression. Clearly, the ordering of the(More)
Intrusion detection systems (IDS) are responsible for monitoring and analyzing host or network activity to detect intrusions in order to protect information from unauthorized access or manipulation. There are two main approaches for intrusion detection: signature-based and anomaly-based. Signature-based detection employs pattern matching to match attack(More)
Searching for a goal is a central and extensively studied problem in computer science. In classical searching problems, the cost of a search function is simply the number of queries made to an oracle that knows the position of the goal. In many robotics problems, as well as in problems from other areas, we want to charge a cost proportional to the distance(More)
—We consider the problem of keeping sensitive data and algorithms contained in a mobile agent from discovery and exploitation by a malicious host. The focus in this paper is on rigorous techniques based on cryptographic protocols. Algesheimer, Cachin, Camenisch, and Karjoth (IEEE Security and Privacy, 2001) devised a secure agent protocol in such a setting,(More)
Direct anonymous attestation (DAA) is an anonymous au-thentication scheme adopted by the Trusted Computing Group in its specifications for trusted computing platforms. This paper presents an efficient construction that implements all anonymous authentication features specified in DAA, including authentication with total anonymity, authentication with(More)
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits (of bounded fan-in) for integer division (finding reciprocals) that have size <italic>&Ogr;</italic>(<italic>M</italic>(<italic>n</italic>)) and depth <italic>&Ogr;</italic>(log<italic>n</italic>log log<italic>n</italic>), where(More)
This paper presents SAgent, a general-purpose mobile agent security framework that is designed to protect the computations of mobile agent applications in potentially hostile environments. SAgent works with the JADE (Java Agent DEvelopment) platform [6], a FIPA-compliant multi-agent environment. SAgent supports modular and mostly orthogonal development of(More)
In this paper, we examine the problem of incrementally evaluating algebraic functions. In particular, if f(x 1 , x 2 , …, x n) = (y 1 , y 2 , …, y m) is an algebraic problem, we consider answering on-line requests of the form ―change input x i to value v'' or ―what is the value of output y j ?'' We first present lower bounds for some simply stated algebraic(More)
We propose an efficient digital signature scheme, which is proved secure under the strong RSA assumption, and can operate in an online/offline manner, doing most of its work in the offline precomputation phase. The online phase, which is performed after the message to be signed is known, is very efficient, requiring only a single modular multiplication.(More)