My research focuses on privacy-preserving computation using lattice-based cryptography, a type of post-quantum cryptography.


Privacy-preserving computing: exploring cryptographic primitives to support general computation with input/output privacy
(Sunscreen, 2021 - present)

Privacy-preserving smart contracts: using fully homomorphic encryption (FHE) + zero-knowledge proofs (ZKPs) to hide the inputs/outputs of smart contracts
(NuCypher, 2019 - 2021)

Anonymous reputation systems: using lattice-based group signatures to review products anonymously
(Oxford, 2017 - 2018)


  • Privacy-Preserving Smart Contracts from FHE, CrossFyre '21
  • Future of Privacy Coins (panelist), Privacy and Security Conference hosted by Light Node Media
  • Beating the Flash Boys with FHE and ZKPs, Scaling Ethereum '21 & Zero Knowledge Summit '20
  • The Marriage of FHE and Blockchain, short talk at IEEE Security & Privacy '20
  • The Future of Privacy-Preserving Smart Contracts, Devcon '19 & Zero Knowledge Summit '19
  • A Lattice-Based Anonymous Reputation System, Oxford viva
  • Riemann Mapping Theorem by Steepest Descent, Berkeley Graduate Student Partial Differential Equations Seminar '14
  • Publications

  • Almashaqbeh G and Solomon R. SoK: Privacy-Preserving Computing in the Blockchain Era. Preprint.
  • Solomon R and Almashaqbeh G. smartFHE: Privacy-Preserving Smart Contracts from Fully Homomorphic Encryption. Preprint.
  • El Kaafarani A, Katsumata S, and Solomon R. Anonymous Reputation Systems Achieving Fully Dynamicity from Lattices. In Financial Cryptography and Data Security 2018.
  • Technical Writing

  • (Why) Bringing Privacy to Smart Contracts is Non-trivial, NuCypher, December 2020
  • An Intro to Fully Homomorphic Encryption for Engineers, NuCypher, July 2020