M. Strauss

Publications
Influence

Divertible Protocols and Atomic Proxy Cryptography

M. Blaze, G. Bleumer, M. Strauss
Computer Science
EUROCRYPT
31 May 1998

We introduce the notion of protocol divertibility as a protocol property as opposed to the existing notion as a language property (see Okamoto, Ohta [OO90]). Expand

1,243
111
PDF

REFEREE: Trust Management for Web Applications

Y. Chu, J. Feigenbaum, Brian A. LaMacchia, P. Resnick, M. Strauss
Computer Science
Comput. Networks
1 June 1997

This paper describes the REFEREE trust management system for Web applications; we provide both a general policy-evaluation mechanism for programs and servers and a language for specifying trust policies. Expand

Near-optimal sparse fourier representations via sampling

A. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, M. Strauss
Mathematics, Computer Science
STOC '02
19 May 2002

We give an algorithm for finding a Fourier representation for a given discrete signal signal <b>A</b> of length <i>N</i>, such that $\|\signal-\repn_\opt\|_2^2$ is within the factor (1 +ε) of best possible. Expand

Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries

A. Gilbert, Y. Kotidis, S. Muthukrishnan, M. Strauss
Computer Science
VLDB
11 September 2001

We present general “sketch” based methods for capturing various linear projections of the data and use them to provide pointwise and rangesum estimation of data streams. Expand

Compliance Checking in the PolicyMaker Trust Management System

M. Blaze, J. Feigenbaum, M. Strauss
Computer Science
Financial Cryptography
23 February 1998

PolicyMaker is a trust management system for electronic commerce services that uses public-key cryptography on a mass-market scale, and it can be used to solve the authorization question in a variety of ways. Expand

Secure Multiparty Computation of Approximations

J. Feigenbaum, Y. Ishai, T. Malkin, Kobbi Nissim, M. Strauss, R. Wright
Computer Science
ICALP
8 July 2001

We present definitions of secure multiparty approximate computations that retain the privacy of a secure computation of f and an efficient private approximation of the permanent. Expand

Measure on small complexity classes, with applications for BPP

E. Allender, M. Strauss
Computer Science, Mathematics
Proceedings 35th Annual Symposium on Foundations…
20 November 1994

We present a notion of resource-bounded measure for P and other subexponential-time classes that overcomes the limitations that cause Lutz's definitions to apply only to classes at least as large as E. Expand

An Approximate Lp Difference Algorithm for Massive Data Streams

J. Fong, M. Strauss
Mathematics, Computer Science
Discret. Math. Theor. Comput. Sci.
17 October 1999

We show how to approximate the L^p-difference ∑ _i|a_i-b_i|^p between two functions, when the function values a_i and b_i are given in a data stream, and their order is chosen by an adversary. Expand

One-Pass Wavelet Decompositions of Data Streams

A. Gilbert, Y. Kotidis, S. Muthukrishnan, M. Strauss
Computer Science
IEEE Trans. Knowl. Data Eng.
1 March 2003

We present general "sketch"-based methods for capturing various linear projections and use them to provide pointwise and rangesum estimation of data streams. Expand

Optimal and approximate computation of summary statistics for range aggregates

A. Gilbert, Y. Kotidis, S. Muthukrishnan, M. Strauss
Mathematics, Computer Science
PODS '01
1 May 2001

We present two sets of results for range aggregate queries, which are amongst the most common queries. Expand

Recommended Authors