• Publications
  • Influence
Divertible Protocols and Atomic Proxy Cryptography
TLDR
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
TLDR
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
  • 367
  • 22
  • PDF
Near-optimal sparse fourier representations via sampling
TLDR
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
  • 270
  • 18
  • PDF
Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries
TLDR
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
  • 454
  • 17
  • PDF
Compliance Checking in the PolicyMaker Trust Management System
TLDR
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
  • 294
  • 16
  • PDF
Secure Multiparty Computation of Approximations
TLDR
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
  • 108
  • 14
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
TLDR
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
  • 75
  • 10
  • PDF
An Approximate Lp Difference Algorithm for Massive Data Streams
  • J. Fong, M. Strauss
  • Mathematics, Computer Science
  • Discret. Math. Theor. Comput. Sci.
  • 17 October 1999
TLDR
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
  • 171
  • 7
  • PDF
One-Pass Wavelet Decompositions of Data Streams
TLDR
We present general "sketch"-based methods for capturing various linear projections and use them to provide pointwise and rangesum estimation of data streams. Expand
  • 135
  • 7
  • PDF
Optimal and approximate computation of summary statistics for range aggregates
TLDR
We present two sets of results for range aggregate queries, which are amongst the most common queries. Expand
  • 62
  • 7
  • PDF