1401 search results - page 79 / 281 » Randomness in Interactive Proofs |
100
click to vote
CRYPTO
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. We present a lower bound on the number of rounds required by Concurrent Zero-Knowledge proofs for languages in NP. It is shown that in the context of Concurrent Zero-Know...
LICS
1994
IEEE
15 years 1 months ago
1994
IEEE
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...
107
click to vote
TYPES
1995
Springer
15 years 1 months ago
1995
Springer
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
ASM
2008
ASM
14 years 11 months ago
2008
ASM
The ingredients of typical model based development via refinement are re-examined, and some well known frameworks are reviewed in that light, drawing out commonalities and differen...
DCC
2010
IEEE
14 years 10 months ago
2010
IEEE
We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. We look at both noninteractive message authentication ...