Sciweavers

1813 search results - page 332 / 363
» Instance Pruning Techniques
Sort
View
POPL
2008
ACM
15 years 10 months ago
Cryptographically sound implementations for typed information-flow security
In language-based security, confidentiality and integrity policies conveniently specify the permitted flows of information between different parts of a program with diverse levels...
Cédric Fournet, Tamara Rezk
POPL
2001
ACM
15 years 10 months ago
Mobile values, new names, and secure communication
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
Cédric Fournet, Martín Abadi
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
15 years 10 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
15 years 10 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
STOC
2003
ACM
174views Algorithms» more  STOC 2003»
15 years 10 months ago
Adiabatic quantum state generation and statistical zero knowledge
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
Dorit Aharonov, Amnon Ta-Shma