Zama was founded by Pascal Paillier, a pioneer in FHE, and Ra
nd Hindi, a serial privacy entrepreneur, and has a team of veteran cryptographers, including Nigel Smart, Marc Joye, Ilaria Chillotti and others.
As part of our efforts bringing privacy to web3, we are building a homomorphic blockchain protocol that enables private smart contracts, where computation happens on-chain on encrypted shared states.
We’re looking for a Protocol Cryptographer with a strong background in cryptography and blockchain, capable of designing and implementing complex cryptographic protocols that combines FHE, ZK and blockchain. You will be working alongside a team of cryptographers, blockchain engineers and full-stack engineers to design, implement and launch Zama’s homomorphic blockchain.
Your job as a Protocol Cryptographer will be to:
– Design, validate and prototype the overall protocol of the Zama blockchain
– Build security proofs of the protocol
– Improve the security and design of the protocol according to product directions
– Publish papers and documentation to guide developers and researchers in our ecosystem
He / She / They should have:
– Strong experience working on blockchain protocols that implement smart contracts
– Knowledge of homomorphic encryption
– Knowledge of zero-knowledge proofs
– A passion for open source and blockchain
– a friendly team player spirit
– an obsession with making things that actually work for users
Bonus points if you have:
– A PhD in Computer Science or equivalent
– Participated in the creation of a new protocol from scratch
We are a full remote company but you should ideally be in an European time zone.
Our process is described in detail here: https://www.zama.ai/post/how-we-hire-at-zama
Zama values and promotes diversity. We give everyone a fair chance to be evaluated on their mix of professional, academic, and personal skills. Our aim is to make the hiring process as pleasant, stress-free, and friendly as possible, even if the process is longer and more involved than you might find elsewhere.