Name
Abstract | ||
|---|---|---|
This paper provides one more step towards bridging the gap between the formal and computational approaches to the verification of cryptographic protocols. We extend the well-known Abadi-Rogaway logic with probabilistic hashes and we give a precise semantic interpretation to it using Canetti's oracle hashes. These are probabilistic polynomialtime hashes that hide all partial information. Finally, we show that this interpretation is computationally sound. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11908739_3 | IWSEC |
Keywords | Field | DocType |
oracle hash,computationally sound,sound computational interpretation,probabilistic hash,partial information,symbolic hash,cryptographic protocol,probabilistic polynomialtime hash,well-known abadi-rogaway logic,standard model,precise semantic interpretation,computational approach,semantic interpretation,satisfiability,security protocol,polynomial time,probabilistic algorithm | Cryptographic protocol,Computer science,Algorithm,Oracle,Semantic interpretation,Random oracle,Theoretical computer science,Hash function,Formal methods,Probabilistic logic,Security parameter | Conference |
Volume | ISSN | ISBN |
4266 | 0302-9743 | 3-540-47699-7 |
Citations | PageRank | References |
6 | 0.42 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Flavio D. Garcia | 1 | 438 | 33.08 |
| Peter Van Rossum | 2 | 427 | 27.10 |