2020.7.6 / Report
GossipSub: Attack-resilient message propagation in the Filecoin and ETH2.0 networks
Permissionless blockchain environments necessitate the use of a fast and attack-resilient message propagation protocol for Block and Transaction messages to keep nodes synchronised and avoid forks. We present GossipSub, a gossip-based pubsub protocol, which, in contrast to past pubsub protocols, incorporates resilience against a wide spectrum of attacks.
Dimitris Vyzovitis, Yusef Napora, Dirk McCormick, David Dias , Yiannis Psaras
2020.6.12 / Conference paper
Automating QUIC interoperability testing
We present QuicInteropRunner [1,2], a test framework for automated and on-demand interoperability testing between implementations of the QUIC protocol [3]. We describe the key constraints and insights that defined our work, the recent innovations that made the framework possible, a high-level overview of our design, and a few exemplary tests.
ACM SIGCOMM 2020 Workshop on Evolution, Performance, and Interoperability of QUIC / 2020.08.14
Marten Seemann , Jana Iyengar
2020.4.18 / Report
Gossipsub-v1.1 evaluation report
Permissionless blockchain environments necessitate the use of a fast and attack-resilient message propagation protocol for Block and Transaction messages to keep nodes synchronised and avoid forks. We present GossipSub, a gossip-based pubsub protocol, which, in contrast to past pubsub protocols, incorporates resilience against a wide spectrum of attacks.
Dimitris Vyzovitis, Yusef Napora, Dirk McCormick, David Dias , Yiannis Psaras
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 / 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.
Theory and Practice of Blockchains 2020 / 2020.07.01
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
2020.1.6 / Conference paper
DClaims: A censorship resistant web annotations system using IPFS and Ethereum
The proliferation of unreliable and biased information is a significant problem on the Internet. To assess the credibility of the information retrieved from news websites and other sources, users often resort to social platforms looking for confirmation with trustworthy parties.
ACM/SIGAPP Symposium On Applied Computing (to appear) / 2020.04.30 / Brno, Czech Republic
João Santos, Nuno Santos, David Dias
2019.11.20 / Report
Exploring connections between active learning and model extraction
Machine learning is being increasingly used by individuals, research institutions, and corporations. This has resulted in the surge of Machine Learning-as-a-Service (MLaaS) - cloud services that provide (a) tools and resources to learn the model, and (b) a user-friendly query interface to access the model.
Varun Chandrasekaran, Kamalika Chaudhuri, Irene Giacomelli , Somesh Jha, Songbai Yan
2019.9.5 / Poster
A dual-process approach for automated knowledge creation
Scientific knowledge growth combines elements of existing theories into new proposed models, which is combinatorially intractable. Inspired by dual-system psychological theories, we conceptualize a knowledge creation process in two stages. Stage One narrows the space of existing computational elements based on contextual queues, supplying components from which a new model will be proposed.
Metascience Symposium / 2019.09.05 / Stanford, CA, USA
2019.9.5 / Conference paper
Dioptics: A common generalization of open games and gradient-based learners
Compositional semantics have been shown for machine-learning algorithms [FST18] and open games [Hed18]; at SYCO 1, remarks were made noting the high degree of overlap in character and analogy between the constructions, and that there is known to be a monoidal embedding from the category of learners to the category of games, but it remained unclear exactly what kind of structure they both are.
Fifth Symposium on Compositional Structures (SYCO) / 2019.09.05 / Birmingham, UK
2019.9.3 / Report
U.S. energy policy and market design
The U.S. bulk power system has an enormous number of actors: regulatory agencies (local, state, and federal), utilities (investor-owned, municipal, cooperatives, and power marketing administrations), operators (ISOs and RTOs), and customers.
2019.8.24 / Conference paper
PLONK: Permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge
zk-SNARK constructions that utilize an updatable universal structured reference string remove one of the main obstacles in deploying zk-SNARKs[GKM + ]. The important work of Maller et al. [MBKM19] presented Sonic-the first potentially practical zk-SNARK with fully succinct verification for general arithmetic circuits with such an SRS.
Stanford Blockchain Conference / 2020.02.19 / Stanford, CA, USA
Ariel Gabizon , Zachary J Williamson, Oana Ciobotaru
2019.7.9 /
A computable multilayer system stack for future-proof interoperability
The future decarbonized power grid will make increasing use of distributed energy resources (DERs) controlled using data collected at an extremely granular level compared to today’s coarse bulk power system models.
IEEE PES Transactive Energy Systems Conference (TESC) / 2019.07.09 / Minneapolis, MN
Alan Ransil , Edwin Fonkwe Fongang, Michael Hammersley , Ivan Celanovic, Francis O’Sullivan
2019.5.29 / Report
AuroraLight: Improved prover efficiency and SRS size in a Sonic-like system
Using ideas from the recent Aurora zk-STARK of Ben-Sasson et al. [BCR + 19], we present a zk-SNARK with a universal and updatable SRS similar to the recent construction of Maller et al.
2018.10.15 / Report
Scaling proof-of-replication for Filecoin mining
A proof-of-replication (PoRep) is a proof system that a server can use to demonstrate to a network in a publicly verifiable way that it is dedicating unique resources to storing one or more replicas of a data file.
2018.7.14 / Report
PoReps: Proofs of space on useful data
A proof-of-replication (PoRep) is an interactive proof system in which a prover defends a publicly verifiable claim that it is dedicating unique resources to storing one or more retrievable replicas of a data file.
2017.8.31 / Thesis
Decentralized infrastructure for file storage
How might we incentivize a peer-to-peer network to store users’ files? The purpose of this research is to combine ideas from existing peer-to-peer file sharing systems, blockchain technology and Proofs-of-Storage to create an incentivized decentralized storage network, where every participant can earn a reward for storing and serving files or pay the network to store or retrieve their own.
2017.7.27 / Report
Power fault tolerance
Byzantine Fault Tolerance (BFT) accounts for faults as the number of faulty nodes and is thus cumbersome to apply to many modern decentralized systems. We introduce the Power Fault Tolerance (PFT) model, which reframes BFT in terms of participants’ influence over the outcome of a protocol, instead of the number of nodes.
2017.7.27 / Report
Proof of replication
We introduce Proof-of-Replication (PoRep), a new kind of Proof-of-Storage, that can be used to prove that some data D has been replicated to its own uniquely dedicated physical storage. Enforcing unique physical copies enables a verifier to check that a prover is not deduplicating multiple copies of D into the same storage space.
2017.7.19 / Report
Filecoin: A decentralized storage network
The internet is in the middle of a revolution: centralized proprietary services are being replaced with decentralized open ones; trusted parties replaced with verifiable computation; brittle location addresses replaced with resilient content addresses; inefficient monolithic services replaced with peer-to-peer algo-rithmic markets.
2016.5.25 / Tutorial
Distributed web applications with IPFS
The contents of this document describe the tutorial session delivered at ICWE 2016, focused on Building Distributed Web Applications with IPFS. IPFS, the InterPlanetary File System, is the distributed and permanent Web, a protocol to make the Web faster, more secure and open.
16th International Conference on Web Engineering (ICWE) / 2016.05.25 / Lugano, Switzerland
2014.7.15 / Report
Filecoin: A cryptocurrency operated file storage network
Filecoin is a distributed electronic currency similar to Bitcoin. Unlike Bitcoin’s computation-only proof-of-work, Filecoin’s proof-of-work function includes a proof-of-retrievability component, which requires nodes to prove they store a particular file. The Filecoin network forms an entirely distributed file storage system, whose nodes are incentivized to store as much of the entire network’s data as they can.
2014.7.14 / Report
IPFS - Content addressed, versioned, P2P file system
The InterPlanetary File System (IPFS) is a peer-to-peer distributed file system that seeks to connect all computing devices with the same system of files. In some ways, IPFS is similar to the Web, but IPFS could be seen as a single BitTorrent swarm, exchanging objects within one Git repository.