Name
Abstract | ||
|---|---|---|
Trace anonymity is an extension of the formulation of anonymity by Schneider and Sidiropoulos. To prove the trace anonymity of infinite-state or unbounded systems, we have introduced proof techniques in which we find a binary relation called an anonymous simulation. There are two sorts of anonymous simulation methods a forward-style method and a backward-style method. In our previous work, we discussed a proof technique for the anonymity of real-time systems, and the approach was based on the forward-style method. In this study, we concentrate on the backward-style method, and we discuss how to prove the timed anonymity. |
Year | Venue | Field |
|---|---|---|
2016 | 2016 IEEE 5TH GLOBAL CONFERENCE ON CONSUMER ELECTRONICS | Cryptographic protocol,Binary relation,Computer security,Computer science,Automaton,Anonymity |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kawabe, Y. | 1 | 1 | 1.79 |
| Nobuhiro Ito | 2 | 6 | 2.40 |