5084 search results - page 889 / 1017 » Proving Possibility Properties |
152
click to vote
CRYPTO
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
209
click to vote
FOSSACS
2001
Springer
15 years 10 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
137
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
165
click to vote
ATAL
2000
Springer
15 years 10 months ago
2000
Springer
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
164
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. While there is a great deal of sophistication in modern cryptology, simple (and simplistic) explanations of cryptography remain useful and perhaps necessary. Many of the ...