Small Steps in Heuristics for the Russian Cards Problem Protocols

ESSLLI 2012 Student Session, A student session of the 24th European Summer School in Logic, Language and Information (ESSLLI 2012)

计算机科学;信息科学

Ignacio Herna´ndez-Anto´n

Others  :  http://ceur-ws.org/Vol-954/paper5.pdf
PID  :  29423

学科分类：计算机科学（综合）

来源: CEUR

【 摘 要 】

This work1 presents a couple of algorithmic techniques appli-ed to the Russian Cards Problem. This problem represent an idealized scenario where Dynamic Epistemic Logic [4, 5, 8] plays an important role in secure communications analysis. This logic is in a lower layer below the protocol desing tasks acting as a specification and verification formal tool. This work focusses not on the logical aspects but rather on the pro- tocol design/searching problem. It is important to have present the epis- temic formal notions of that logic to fully understand the epistemic func- tions developed here. Secure protocols found in this card game scenario may be a good starting point for developing some aspects towards uncon- ditional information security. Hill-Climbing and Genetic Algorithms are studied as searching techniques aimed to find optimal announcements that can be part of a secure communication protocol. Some problems as the dimension and complexity of the search space are pointed out.