3071 search results - page 472 / 615 » Explanatory Design Theory |
167
click to vote
ESOP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
174
click to vote
EUROCRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Password-based protocols for authenticated key exchange (AKE) are designed to work despite the use of passwords drawn from a space so small that an adversary might well enumerate, ...
159
click to vote
PKC
2000
Springer
15 years 10 months ago
2000
Springer
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
188
click to vote
ZUM
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The notion of agents has provided a way of imbuing traditional computing systems with an extra degree of flexibility that allows them to be more resilient and robust in t...
170
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
The goal of incremental cryptography is to design cryptographic algorithms with the property that having applied the algorithm to a document, it is possible to quickly update the ...