Name
Abstract | ||
|---|---|---|
In ongoing work, we are investigating the design of secure distributed implementations of high-level process calculi (in particular, of the join-calculus). We formulate implementations as translations to lower-level languages with cryptographic primitives. Cryptographic protocols are essential components of those translations. In this paper we discuss basic cryptographic protocols for transmitting a single datum from one site to another. We explain some sufficient correctness conditions for these protocols. As an example, we present a simple protocol and a proof of its correctness. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/3-540-46691-6_10 | FSTTCS |
Keywords | Field | DocType |
cryptographic primitive,simple protocol,cryptographic protocol,top-down look,lower-level language,basic cryptographic protocol,single datum,secure message,sufficient correctness condition,ongoing work,essential component,high-level process calculus,top down,process calculi | Cryptographic protocol,Cryptography,Computer science,Correctness,Information protection policy,Communication complexity,Theoretical computer science,Cryptographic primitive,Information privacy,Process calculus,Distributed computing | Conference |
ISBN | Citations | PageRank |
3-540-66836-5 | 4 | 0.85 |
References | Authors | |
23 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martín Abadi | 1 | 12074 | 1324.31 |
| Cédric Fournet | 2 | 3698 | 213.79 |
| Georges Gonthier | 3 | 2275 | 195.06 |