5084 search results - page 183 / 1017 » Proving Possibility Properties |
183
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using ˜O(log n) rounds of interaction. The number of rounds in our protocol is optimal,...
180
click to vote
LOPSTR
2001
Springer
15 years 10 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
176
click to vote
CSFW
1998
IEEE
15 years 10 months ago
1998
IEEE
In security protocol analysis, it is important to learn general principles that limit the abilities of an attacker, and that can be applied repeatedly to a variety of protocols. W...
158
click to vote
SAFECOMP
1999
Springer
15 years 10 months ago
1999
Springer
During the last decade, the synchronous approach has proved to meet industrial needs concerning the development of Distributed Control Systems (DCS): as an example, Schneider Elect...
165
click to vote
CADE
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We present a theorem proving environment for the development of reliable and efficient group communication systems. Our approach makes methods of automated deduction appl...