Other formats:
BibTeX
LaTeX
RIS
@misc{807691,
author = {Šprojcar, Josef},
address = {Brno},
keywords = {anonymity; security foundations; semiformal modelling; dining cryptographers; quantum cryptography},
language = {eng},
location = {Brno},
note = {PhD thesis},
publisher = {Fakulta Informatiky},
title = {Proposal of semiformal model of anonymity based cryptographic tasks and protocols and their analyses},
year = {2008}
}
TY - GEN
ID - 807691
AU - Šprojcar, Josef
PY - 2008
TI - Proposal of semiformal model of anonymity based cryptographic tasks and protocols and their analyses
PB - Fakulta Informatiky
CY - Brno
N1 - PhD thesis
KW - anonymity
KW - security foundations
KW - semiformal modelling
KW - dining cryptographers
KW - quantum cryptography
N2 - The thesis investigates a broad area of cryptography dealing with anonymity. We proposed a semi-formal model of anonymous channels (protocols for anonymous communication). Our model is able to capture many aspects of wide range of types of anonymous communication, however, we concentrate mostly on sender anonymity, receiver anonymity and relationship anonymity. These are the most basic types of anonymity and many others can be either derived from them or only slight modifications are required to include them into our model. Our model is based on protocol graphs (graphs describing communication patterns). Security properties are based on comparing these protocol graphs. If certain properties hold we can speak about anonymity achieved by a protocol. Our model also includes a novel idea of "friends" - participants who are allowed to know identity of some anonymous participant. Several anonymous channels together with their dining cryptographers based protocols are also presented in the thesis. These include protocols for the most basic anonymous channels (these are private bipartite channels) as well as for several complex channels. We also present information-theoretically secure protocols that make use of quantum resources. We were able to build a quantum protocol for an anonymous channel for which no classical protocol is known to exist (in the same cryptographic settings). Based on these anonymous channels and their protocols we also scratched surface of resource based reduction between cryptographic protocols. Because of complexity of all the areas of our research the thesis is written in semi-formal language. The main reason is flexibility and feasibility of working with the model. We use the well known language that is often used in IT security.
ER -
ŠPROJCAR, Josef. \textit{Proposal of semiformal model of anonymity based cryptographic tasks and protocols and their analyses (Proposal of semiformal model of anonymity based cryptographic tasks and protocols and their analyse)}. Brno: Fakulta Informatiky, 2008.
|
