3552 search results - page 362 / 711 » Proof theory in the abstract |
160
click to vote
CRYPTO
2000
Springer
16 years 1 days ago
2000
Springer
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...
209
Voted
CRYPTO
1999
Springer
16 years 3 hour ago
1999
Springer
Abstract. We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-s...
203
click to vote
EKAW
1999
Springer
15 years 12 months ago
1999
Springer
Abstract. In this paper we study dynamic properties of knowledge-based systems. We argue the importance of such dynamic properties for the construction and analysis of knowledge-ba...
166
click to vote
RSP
1999
IEEE
15 years 12 months ago
1999
IEEE
Formal methods are a nice idea, but the size and complexity of real systems means that they are impractical. We propose that a reasonable alternative to attempting to specify and ...
225
Voted
LPAR
1999
Springer
15 years 12 months ago
1999
Springer
Abstract. Walther’s estimation calculus was designed to prove the termination of functional programs, and can also be used to solve the similar problem of proving the well-founde...