6274 search results - page 337 / 1255 » Proofs, Programs, Processes |
162
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
168
click to vote
CSL
2007
Springer
16 years 25 days ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
160
click to vote
ICALP
2007
Springer
16 years 24 days ago
2007
Springer
Abstract. We provide a new characterization of certain zero-knowledge protocols as non-interactive instance-dependent commitment-schemes (NIC). To obtain this result we consider th...
195
click to vote
TCC
2004
Springer
16 years 4 hour ago
2004
Springer
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
211
click to vote
CCS
2003
ACM
15 years 12 months ago
2003
ACM
This paper continues the program initiated in [5], towards a derivation system for security protocols. The general idea is that complex protocols can be formally derived, starting...