CySeP '17 Technical Program
To be announced.
Talks
Day 1, June 19, 2017, Talk 1 (9:00-10:30)
Speaker: Bart Preneel (KU Leuven)
Title: Bitcoin and Blockchain
Abstract: This lecture explores the technological innovations created by cryptocurrencies such as Bitcoin. We discuss the principles of distributed currencies and discuss their strengths and weaknesses. We also explain how the blockchain mechanism interacts with the other features to create a complex ecosystem. We also touch on the issues of stability and incentive compatibility and we discuss which properties of blockchains are relevant for the key use cases.
Day 1, June 19, 2017, Talk 2 (11:00-12:30)
Speaker: Ueli Maurer (ETH Zurich)
Title: Constructive Cryptography
Abstract: Constructive cryptography is a methodology for defining the security of cryptographic schemes and for designing and proving the security of protocols making use of such schemes. Such a cryptographic scheme can be seen (and defined) as constructing a certain resource (e.g. a channel or a key) with certain security properties from another (weaker) such resource. For example, a secure symmetric encryption scheme constructs a secure channel from an authenticated channel and a secret key, and the Diffie-Hellman protocol can be used to construct a secret key from two authenticated channels, one in each direction.
In this talk we give an introduction to constructive cryptography suitable for a non-specialist audience and present some recent new insights.
Day 1, June 19, 2017, Talk 3 (13:30-15:00)
Speaker: Pierangela Samarati (Univ. of Milano)
Title: TBA
Abstract: TBA
Day 1, June 19, 2017, Talk 4 (15:30-17:00)
Speaker: Virgil Gligor (Carnegie Mellon University)
Title: Establishing and Maintaining Root of Trust on Commodity Computer Systems
Abstract: Suppose that a trustworthy program must be booted on a commodity system that may contain persistent malware. For example, a formally verified micro-kernel, micro-hypervisor, or a subsystem obtained from a trustworthy provider must be booted on a computer system that runs Windows, Linux, or Android. Establishing root of trust assures the user that either the system is in a malware-free state in which the trustworthy-program boot takes place or the presence of malware is discovered, with high probability. Obtaining such an assurance is challenging because malware can survive in system states across repeated secure- and trusted-boot operations; e.g., these operations do not always have malware-unmediated access to device controllers’ processors and memories. To date, concrete assurance for root-of-trust establishment has not been obtained on more complex systems than tablets or smartphones. I this presentation, I will illustrate both the theoretical and practical challenges of root-of-trust establishment unconditionally; i.e., without secrets, privileged modules (e.g., TPMs), or adversary bounds.
Establishing root of trust is important because makes all persistent malware ephemeral and forces the adversary to repeat the malware-insertion attack, perhaps at some added cost. Nevertheless, some malware-controlled software can always be assumed to exist in commodity operating systems and applications. The inherent size and complexity of their components (aka the “giants”) render them vulnerable to successful attacks. In contrast, small and simple software components with rather limited function and high-assurance layered security properties (aka the “wimps”) can, in principle, be resistant to all attacks.
Maintaining root of trust assures a user that a commodity computer’s wimps are isolated from, and safely co-exist with, adversary-controlled giants. However, regardless how secure program isolation may be (e.g., based on Intel’s SGX), I/O channel isolation must also be achieved despite the pitfalls of commodity architectures that encourage I/O hardware sharing, not isolation. In this presentation I will illustrate the challenges of I/O channel isolation and present and approach that enables the co-existence secure wimps with insecure giants, via two examples of experimental systems; i.e., on-demand isolated I/O channels and a trusted display service, which were designed and implemented at CMU’s CyLab.
Day 2, Talk 1 (9:00-10:30)
Speaker: Fred Schneider (Cornell University)
Title: Tagging Security
Abstract: Reference monitors generally restrict operation invocation. We discuss an alternative approach to security — enforcing restrictions on how data is used. A new class of expressive tags is required. These RIF tags will be explained, with an eye towards static and run-time enforcement. We also discuss applications to privacy enforcement.
Day 2, Talk 2 (11:00-12:30)
Speaker: Ruby Lee (Princeton University)
Title: TBA
Abstract: TBA
Day 2, Talk 3 (13:30-15:00)
Speaker: Herbert Lin (Stanford University)
Title: TBA
Abstract: TBA
Day 2, Talk 4 (15:30-17:00)
Speaker: Robin Blokker (FRA)
Title: Live hacking
Abstract: A live hacking demonstration.
Day 3, Talk 1 (in two parts) (9:00-10:30 and 11:00-12:30)
Speaker: Jan Camenisch (IBM Research Zurich)
Title: How to build privacy-preserving cryptographic protocols
Abstract: This talk aims to give some insights into how one can construct privacy-preserving cryptographic protocols from cryptographic primitives such as signatures, commitment, and encryption scheme by combining them suitably with zero-knowledge proofs. To this end, we will first discusses these cryptographic primitives, give an suitable example realisation for each of them so that can efficiently be combined. We also give a brief overview of alternative realisations of such a primitive framework. We then show how they can be combined to obtain a few example high-level cryptographic protocols and briefly discuss how the security of such solution can be proved.
Day 3, Talk 2 (14:00-15:00)
Speaker: Gene Tsudik (UC Irvine)
Title: Security in Personal Genomics: Lest We Forget
Abstract: Genomic privacy has attracted much attention from the research community, mainly since its risks are unique and breaches can lead to terrifying leakage of most personal and sensitive information. The much less explored topic of genomic security needs to mitigate threats of the digitized genome being altered by its owner or an outside party, which can have dire consequences, especially, in medical or legal settings. At the same time, many anticipated genomic applications (with varying degrees of trust) require only small amounts of genomic data. Supporting such applications requires a careful balance between security and privacy. Furthermore, genome’s size raises performance concerns.
We argue that genomic security must be taken seriously and explored as a research topic in its own right. To this end, we discuss the problem space, identify the stakeholders, discuss assumptions about them, and outline several simple approaches based on common cryptographic techniques, including signature variants and authenticated data structures. We also present some extensions and identify opportunities for future research. The main goal of this work is to highlight the importance of genomic security as a research topic in its own right.
Day 4, Talk 1 (9:00-10:30)
Speaker: Wenke Lee (Georgia Tech University)
Title: TBA
Abstract: TBA
Day 4, Talk 2 (11:00-12:30)
Speaker: Steve Bellovin (Columbia University)
Title: Authentication Revisited
Abstract: We all know about authentication -- passwords, two factors, biometrics, and more. But what are the real underlying properties of these different types? Are passwords as bad as portrayed? Why? What are the failure modes of other types of authentication? How should they be used? Is there an underlying framework we can use, for today's and tomorrow's authentication schemes?
Day 4, Talk 3 (13:30-15:00)
Speaker: Herbert Lin (Stanford University)
Title: TBA
Abstract: TBA
Day 4, Talk 4 (15:30-17:00)
Speaker: Amit Sahai (UC Los Angeles)
Title: Mathematical Software Obfuscation
Abstract: The goal of general-purpose software obfuscation is to make an arbitrary computer program “unintelligible” while preserving its functionality. Obfuscation allows us to achieve a powerful capability: software that can keep a secret. This talk will cover recent advances in obfuscation research, yielding constructions of general-purpose obfuscation mechanisms based on mathematical structures.
