21324 search results - page 475 / 4265 » Making the case for computing |
184
click to vote
EUROCRYPT
2010
Springer
15 years 12 months ago
2010
Springer
We analyze the relation between induction, co-induction and the presence of encryption cycles in the context of computationally sound symbolic equivalence of cryptographic express...
168
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...
185
click to vote
COLT
2000
Springer
15 years 11 months ago
2000
Springer
Haussler, Kearns, Seung and Tishby introduced the notion of a shell decomposition of the union bound as a means of understanding certain empirical phenomena in learning curves suc...
137
click to vote
ECOOPW
1998
Springer
15 years 11 months ago
1998
Springer
We develop generic parallel algorithms as extensible modules that encapsulate related classes and parallel methods. Extensible modules define common parallel structures, such as m...
164
click to vote
APN
2009
Springer
15 years 11 months ago
2009
Springer
We present a symbolic method for p-semiflow computation, based on zero-suppressed decision diagrams. Both the traditional explicit methods and our new symbolic method rely on Farka...