391 search results - page 49 / 79 » On-Line Secret Sharing |
COCO
1993
Springer
13 years 11 months ago
1993
Springer
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We develop a variant of Gordon and Hankin's concurrent object calculus with support for flexible access control on methods. We investigate safe administration and ac...
DCC
2010
IEEE
13 years 7 months ago
2010
IEEE
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
SP
2002
IEEE
13 years 7 months ago
2002
IEEE
Despite our best efforts, any sufficiently complex computer system has vulnerabilities. It is safe to assume that such vulnerabilities can be exploited by attackers who will be ab...
IANDC
2008
13 years 6 months ago
2008
We show how to design secure authentication protocols for a non-standard class of scenarios. In these authentication is not bootstrapped from a PKI, shared secrets or trusted thir...