Events & News
Colloquium
| Category | Lecture |
| Date | Tuesday, August 14, 2012 |
| Time | 11:00 am |
| Concludes | 12:00 pm |
| Location | Gould-Simpson 906 |
| Speaker | Zhiwei Li |
| Title | PhD Candidate |
| Affiliation | University of North Carolina |
Reasoning About Recognizability in Security Protocol Analysis
Although verifying a message has long been recognized as an important concept in security protocol analysis, there is no consensus on its exact meaning. Such a lack of formal treatment of the concept makes it extremely difficult to evaluate the vulnerability of security protocols. This talk addresses the question: what is meant by saying that a message can be verified? The core technical innovation is a third notion of knowledge in security protocols -- recognizability. It can be considered as intermediate between deduction and static equivalence, two classical knowledge notions in security protocols. I will then give several examples to show how recognizability shed important lights on the study of security protocols.
Biography
Zhiwei Li is a Ph.D. candidate in Department of Software & Information Systems at the University of North Carolina at Charlotte. He got his B.S. degrees on Electrical Engineering from Southeast University, China, in 2003. He also received a MS degree in Software Engineering from San Yat-sen University, China, in 2006. His research interests include security, formal methods, and knowledge reasoning.