Ponentes Invitados

Universidade Federal de Uberlândia,

Brasil

Title: On evaluation codes defined over the points of the extended norm-trace curve.

Abstract: In this talk, we want to present some data on evaluation codes defined over the points of the extended norm-trace curve. We will show how the determination of a certain Grobner basis for the vanishing ideal of those points allows one to find the exact parameters of what we called decreasing norm-trace codes. This is based on a joint work together with Hiram López and Gretchen Matthews.

The University of Melbourne,

Australia

Title: CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives

Abstract: Cryptography has been extensively used to protect digital information on a wide range of devices. Therefore, the correctness, efficiency, and portability of cryptographic software are of utmost importance. While relying on a compiler-based code generation achieves portability, the efficiency of the produced code usually underperforms compared to the code written directly in assembly. On the other hand, writing code manually achieves high performance while costing experts' time, particularly when the target platform has changed. Regardless, either approach may still produce incorrect code.

This talk presents CryptOpt, a verified compilation code generator that produces efficient code tailored to the architecture it runs on. On the optimization side, CryptOpt applies randomized search through the space of assembly program. On the formal-verification side, CryptOpt connects to the Fiat Cryptography framework and extends it with a new formally verified program-equivalence checker. The benchmark shows that CryptOpt produces fastest-known implementations of finite-field arithmetic for both Curve25519 and the Bitcoin elliptic curve secp256k1 for the relatively new Intel 12th and 13th generations.

Title: Private Information Retrieval: From theory to practice.

Abstract: Private Information Retrieval (PIR) schemes are very attractive ones as they solve a number of problem while preserving privacy for the users. In this talk, we will talk about state-of-the-art PIR schemes: how efficient they are, how they are defined, and what kind of concrete problems they solve. We will put emphasis on "FrodoPIR", which is a highly configurable, stateful, singleserver scheme that involves an offline phase that is completely client-independent. Coupled with small online overheads, it leads to much smaller amortized financial costs on the server-side than previous approaches. We will also talk about their security model and possibilities of formal verification. 

Cleveland State University, 

Ohio‎, Estados Unidos

Title: Recent results on the dual of an evaluation code.

Abstract: An evaluation code depends on sets of points and polynomials. We will see how the indicator functions of the points play an essential role in finding the dual. We then take advantage of the knowledge of the dual to introduce and study some applications of the Hermitian lifted, augmented, and multivariate Goppa codes.