#### Filter Results:

- Full text PDF available (59)

#### Publication Year

1987

2017

- This year (1)
- Last 5 years (7)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- John H. Reif, Stephen R. Tate
- SIAM J. Comput.
- 1987

A Threshold Circuit consists of an acyclic digraph of unbounded fanin, where each node computes a threshold function or its negation. This paper investigates the computational power of Threshold Circuits. A surprising relationship is uncovered between Threshold Circuits and another class of unbounded fanin circuits which are denoted Finite Field ZP (n)… (More)

- Stephen R. Tate
- Data Compression Conference
- 1994

In this paper, 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, and examine how the ordering of the bands affects the achievable compression. We present an efficient algorithm for computing the optimal band… (More)

- He Ge, Stephen R. Tate
- Public Key Cryptography
- 2007

Direct anonymous attestation (DAA) is an anonymous authentication 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)

- John H. Reif, Stephen R. Tate
- J. Algorithms
- 1997

In this paper, we examine the problem of incrementally evaluating algebraic functions. In particular, if f(x1, x2, ..., xn) = (y1, y2, ..., ym) is an algebraic problem, we consider answering on-line requests of the form ―change input xi to value v‘‘ or ―what is the value of output yj?‘‘ We first present lower bounds for some simply stated algebraic problems… (More)

- Ming-Yang Kao, John H. Reif, Stephen R. Tate
- Inf. Comput.
- 1993

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)

- Brenton Chapin, Stephen R. Tate
- Data Compression Conference
- 1998

We show that the ordering used in the sorting stage of the Burrows-Wheeler transform, an aspect hitherto ignored, can have a significant impact on the size of the compressed data. We present experimental results showing smaller compressed output achieved with two modifications to the sorting: using a better alphabet ordering and reflecting the sorted… (More)

- Sachin P. Joglekar, Stephen R. Tate
- International Conference on Information…
- 2004

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)

- John H. Reif, Stephen R. Tate
- ICALP
- 1993

The r t

- Stephen R. Tate, Ke Xu
- International Conference on Internet Computing
- 2003

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)

- Victor Y. Pan, John H. Reif, Stephen R. Tate
- FOCS
- 1992