Abstract
A protocol defines a structured conversation aimed at exchanging information between two or more parties. Complete confidentiality is virtually impossible so long as useful information needs to be transmitted. A more useful approach is to quantify the amount of information that is leaked. Traditionally, information flow in protocols has been analyzed using notions of entropy. We move to a discrete approach where information is measured in terms of propositional facts. We consider protocols involving agents holding numbered cards who exchange information to discover each others’ private hands. We define a transition system that searches the space of all possible announcement sequences made by such a set of agents and tries to identify a subset of announcements that constitutes an informative yet safe protocol.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Please check http://www.cmi.ac.in/~spsuresh/projects/russian-cards-z3/ for the full code.
References
Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Probability of error in information-hiding protocols. In: 20th IEEE Computer Security Foundations Symposium, CSF 2007, Venice, Italy, 6–8 July 2007, pp. 341–354. IEEE Computer Society (2007)
Clark, D., Hunt, S., Malacaria, P.: Quantitative information flow, relations and polymorphic types. J. Log. Comput. 15(2), 181–199 (2005)
Clark, D., Hunt, S., Malacaria, P.: A static analysis for quantifying information flow in a simple imperative language. J. Comput. Secur. 15(3), 321–371 (2007)
Clarkson, M.R., Myers, A.C., Schneider, F.B.: Belief in information flow. In: 18th IEEE Computer Security Foundations Workshop, (CSFW-18 2005), Aix-en-Provence, France, 20–22 June 2005, pp. 31–45. IEEE Computer Society (2005)
Fernández-Duque, D., Goranko, V.: Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy. Discrete Appl. Math. 198, 118–135 (2016)
Köpf, B., Basin, D.A.: An information-theoretic model for adaptive side-channel attacks. In: Ning, P., De Capitani di Vimercati, S., Syverson, P.F. (eds.) Proceedings of the 2007 ACM Conference on Computer and Communications Security, CCS 2007, Alexandria, Virginia, USA, 28–31 October 2007, pp. 286–296. ACM (2007)
Lowe, G.: Quantifying information flow. In: 15th IEEE Computer Security Foundations Workshop (CSFW-15 2002), Cape Breton, Nova Scotia, Canada, 24–26 June 2002, pp. 18–31 (2002)
Di Pierro, A., Hankin, C., Wiklicky, H.: Approximate non-interference. In: 15th IEEE Computer Security Foundations Workshop (CSFW-15 2002), Cape Breton, Nova Scotia, Canada, 24–26 June 2002, pp. 3–17 (2002)
van Ditmarsch, H.P., van der Hoek, W., van der Meyden, R., Ruan, J.: Model checking russian cards. Electr. Notes Theor. Comput. Sci. 149(2), 105–123 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Khadir, A.A., Mukund, M., Suresh, S.P. (2017). Knowledge Transfer and Information Leakage in Protocols. In: D'Souza, D., Narayan Kumar, K. (eds) Automated Technology for Verification and Analysis. ATVA 2017. Lecture Notes in Computer Science(), vol 10482. Springer, Cham. https://doi.org/10.1007/978-3-319-68167-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-68167-2_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68166-5
Online ISBN: 978-3-319-68167-2
eBook Packages: Computer ScienceComputer Science (R0)