Our mission urges us to consider problems across multiple subject areas, both applied and theoretical. We pursue these problems in the open and share our results in recorded talks and published papers.

Research Groups

The purpose of CryptoLab is to develop and apply new cryptographic tools to secure computation and communication systems. Much of the past and current work includes designing, proving, and improving the building blocks enabling Filecoin: a decentralized storage network.

The mission of the Resilient Networks Lab is to build resilient distributed systems, by creating and operating a platform where researchers can collaborate openly and asynchronously on deep technical work.

Research Areas

We aim to use learnings from previous efforts, growth in available data, and ambitions of qualitatively novel capabilities to facilitate the discovery, linking, and processing of knowledge. This work primarily consists of support for The Underlay, a project intending to build a global, distributed graph of public knowledge.

A long-term goal for the IPFS ecosystem is to merge distributed apps and local apps into a single paradigm: fundamentally rethinking the UNIX programming model for a content-addressable platform. As a component of this, we aspire to make the best use of state-of-the-art advances in programming language design and implementation, such as substructural types, modal types, and algebraic effects.

Category theory (CT) originated as a subdiscipline of pure mathematics, with a historical strength in unifying disparate mathematical areas to transport proofs and constructions between them. CT can also be viewed as an upgraded foundation for all of math, taking the place traditionally occupied by first-order logic and set theory, and is commonly used in theoretical computer science (especially type theory), and as a foundation for computational theorem-proving.

Distributed systems are, broadly speaking, networked systems whose components are located in different nodes that communicate and coordinate to achieve the system’s purpose. Distributed systems are at the very core of what we do and our interests extend across the entire field.

Modern cryptography plays an integral role in every aspect of online and electronic security, including providing evidence you’re speaking to the intended party and hindering spying on the subsequent communication. Cutting-edge cryptography tools will allow the creation of incredibly strong evidence that general information processing has been performed in a privacy-preserving and trustless way.

Our electricity system is undergoing a monumental transition from a centralized design based on fossil fuels to a distributed architecture based on renewable energy. Successfully navigating this requires reconceiving the grid as a distributed system, able to coordinate diverse resources and influence the deployment of capital by setting up appropriate incentive structures.

Recent Talks

View all talks

Recent Publications

View all publications
2020.4.8 / Conference paper
MonZa: Fast Maliciously Secure Two Party Computation on Z_{2^k}
In this paper we present a new 2-party protocol for secure computation over rings of the form Z2k. As many recent efficient MPC protocols supporting dishonest majority, our protocol consists of a heavier (input-independent) pre-processing phase and a very efficient online stage.
IACR International Conference on Practice and Theory of Public-Key Cryptography (PKC) / 2020.05.04 / Edinburgh, Scotland
Dario Catalano, Mario Di Raimondo, Dario Fiore, Irene Giacomelli
2020.3.3 / Conference paper
SoK: Tools for Game Theoretic Models of Security for Cryptocurrencies
Cryptocurrencies have garnered much attention in recent years, both from the academic community and industry. One interesting aspect of cryptocurrencies is their explicit consideration of incentives at the protocol level, which has motivated a large body of work, yet many open problems still exist and current systems rarely deal with incentive related problems well.
Cryptoeconomic Systems (to appear) / 2020.03.07 / Cambridge, MA, USA
Sarah Azouvi , Alexander Hicks
2020.2.17 / Report
Vector Commitment Techniques and Applications to Verifiable Decentralized Storage
Vector commitments with subvector openings (SVC) [Lai-Malavolta and Boneh-Bunz-Fisch, CRYPTO'19] allow one to open a committed vector at a set of positions with an opening of size independent of both the vector’s length and the number of opened positions.
Matteo Campanelli, Dario Fiore, Nicola Greco , Dimitris Kolonelos, Luca Nizzardo
2020.1.15 / Report
Single Secret Leader Election
In a Single Secret Leader Election (SSLE), a group of participants aim to randomly choose exactly one leader from the group with the restriction that the identity of the leader will be known to the chosen leader and nobody else.
Dan Boneh, Saba Eskandarian, Lucjan Hanzlik, Nicola Greco