6527 search results - page 376 / 1306 » On Typing Information Flow |
144
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
198
click to vote
CRYPTO
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...
214
click to vote
ISMB
2007
15 years 9 months ago
2007
Motivation: A few years ago, FlyBase undertook to design a new database schema to store Drosophila data. It would fully integrate genomic sequence and annotation data with bibliog...
187
click to vote
IPCO
2010
15 years 8 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
173
Voted
AAAI
1994
15 years 8 months ago
1994
In this paper, we study the problem of achieving efficient interaction in a distributed scheduling system whose scheduling agents may borrow resources from one another. Specifical...