Abstract | ||
---|---|---|
We investigate the application of concurrency theory notions as simulation relations and compositional proof rules for verifying digital stream signature protocols. In particular, we formally prove the integrity of the Gennaro-Rohatgi protocols in [7]. As a peculiarity, our technique is able to check a protocol with an unbounded number of parallel processes. We argue also that our approach may be applied to a wider class of stream signature protocols. |
Year | DOI | Venue |
---|---|---|
2003 | 10.1109/CSD.2003.1207708 | ACSD |
Keywords | Field | DocType |
compositional verification,parallel process,digital stream signature protocols,wider class,simulation relation,gennaro-rohatgi protocol,stream signature protocol,compositional proof rule,digital stream signature protocol,unbounded number,concurrency theory notion,cryptography,information security,formal verification,parallel processing,set theory,concurrent computing,formal languages,videoconference,terminology,digital video broadcasting,protocols,data integrity,cryptographic protocols | Set theory,Formal language,Cryptographic protocol,Concurrency,Cryptography,Computer science,Theoretical computer science,Data integrity,Concurrent computing,Formal verification | Conference |
ISBN | Citations | PageRank |
0-7695-1887-7 | 5 | 0.43 |
References | Authors | |
10 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Roberto Gorrieri | 1 | 2297 | 184.63 |
Fabio Martinelli | 2 | 212 | 21.91 |
Marinella Petrocchi | 3 | 362 | 44.01 |
Anna Vaccarelli | 4 | 122 | 10.40 |