Latincrypt 2017 Invited Speakers

Phillip Rogaway

University of California Davis, USA

Title: An Obsession with Definitions

 Many people seem to think that cryptography is only about the creation and analysis of cryptographic schemes.  This view ignores the
centrality of definitions in shaping the problems we collectively work on, and the way in which we address them. More than schemes or their
analysis, it is definitions that I myself have obsessed on. In this talk I’ll try to explain why, and talk about a few of these definitions:
authenticated key exchange, garbling schemes, online AE, and onion encryption.

Learn more

Nadia Heninger

University of Pennsylvania, USA

Learn more

Adi Shamir

Weizmann Institute of Science, Israel

Title: Towards Quantitative Analysis of Cyber Security

 Cyber security had become an extremely hot topic in the last few years, but almost all the research results published so far had been qualitative in nature: they do not formulate a precise mathematical model of the problem, do not numerically compare alternatives, and do not  try to find optimal solutions for cyber security problems. In this paper I will describe some initial attempts (developed jointly with Bar-On Dinur Dunkelman Hod Keller and Ronen)  to create such a quantitative theory of some particular subproblems in cyber security. In particular, I will consider the problem of how to protect a computer system against cyber and ransomware attacks by choosing an optimal backup scheme using k storage devices. While in standard backup schemes it is beneficial to backup as frequently as possible, in the case of sophisticated cyber attacks any attempt to connect a backup device to an already infected computer is likely to stealthily corrupt its data and thus make it unusable when the actual attack happens. Our formalization of the problem casts it as a special case of an online/offline optimization problem, in which the defender tries to minimize the maximal extra cost caused by his lack of knowledge about the time of the infection, and the strategies he can use resemble a pebbling game with k tokens which can be placed anywhere along the timeline. However, the optimal solution of this simple pebbling game is surprisingly complicated: concrete provably optimal backup strategies are known only for k<10, and only asymptotically optimal strategies are known for larger k.

Learn more

Our mission

Latin America has a long tradition of excellent research in related fields but has relatively
few researchers in cryptology per se. Fifth International Conference on Cryptology and Information
Security in Latin America aims to convey the excitement of working in cryptology, helping
encourage and build cryptologic research capacity in the region, and improving connectivity to
the broader international community. This year provides a unique opportunity to reach out to
Cuba (which has historically been isolated through travel limitations and export controls), and
can be expected to draw many attendees both locally and from Latin America more broadly, as
well as interested people from the United States and around the world.

Our Sponsors & Organizers