Block Ciphers, Homomorphically, And Then Some

Following up on our recent post, Block Ciphers, Homomorphically, we have some new results. In our previous post, we reported on two experiments: a single block-at-a-time evaluation of SIMON 64/128 computed with the HElib homomorphic encryption library, and a parallel, 1800 block-at-a-time evaluation of the same cipher. Our results on the latter have not changed: 1800 […]

Read More

Tech Talk: Making GHC work for you

abstract: GHC is a state-of-the-art optimizing compiler that is constantly being improved. But despite all of the hard work by the developers, you occasionally find yourself in need of a feature that GHC does not (yet) support. Luckily for us, GHC does have multiple extension points built into the standard compilation pipeline, in addition to […]

Read More

Block Ciphers, Homomorphically

by Brent Carmer and David W. Archer, PhD Our team at Galois, Inc. is interested in making secure computation practical. Much of our secure computation work has focused on linear secret sharing (LSS, a form of multi-party computation) and the platform we’ve built on that technology. However, we’ve also done a fair bit of comparison […]

Read More

Hacking Internet Voting via Ballot Tampering

Dan Zimmerman and Joe Kiniry Election Day was this week.  If you took advantage of early voting, or you live overseas, you probably used a paper ballot you received in the mail a few weeks ago.  A digital alternative, being considered across the USA, is voting-by-email. To vote using email (Fig. 1), you download and […]

Read More

Innovation Week: Experiments, prototypes and new skills

During the first week of October, Galois held “Innovation Week,” a time for everybody to explore new ideas, recharge our creativity, have fun and share what we’ve learned and done with each other. Throughout the week, Galwegians worked on a diverse set of side projects: running experiments, building prototypes, solving puzzles and acquiring new skills.

Read More

Tech talk by Philip Wadler

abstract: We present four calculi for gradual typing: λB, based on the blame calculus of Wadler and Findler (2009); λC, based on the coercion calculus of Henglein (1994); and λT and λW, based on the three- some calculi with and without blame of Siek and Wadler (2010). We define translations from λB to λC, from […]

Read More