Blockchain related talks
- The Red Belly Blockchain, MIT, Cambridge, USA - Facebook, Menlo Park, USA - Visa Research, Palo Alto, USA.
- BFT is back but is it the same?, BTT at DISC 2018, Vienna, Austria.
- The Danger of Private Blockchain, DCCL, Chicago, USA, INRIA, U. Rennes, France and UNSW, Australia.
The Red Belly Blockchain
The Red Belly Blockchain (RBBC) is an unforkable blockchain able to commit more than 600K transactions per second with a latency of few seconds. As opposed to mainstream public blockchains, it is not subject to double spending - when an individual successfully spends their money more than once - because its chain of blocks never forks. As opposed to consortium blockchains, it does not bottleneck when numerous clients issue transactions at the same time, thanks to its leaderless consensus algorithm.
Blockchain related publications
-
Concurrency and Computation, Practice and ExperienceOct 2019John Wiley & Sons
-
Internet of ThingsAug 2019Elsevier (DOI:10.1016/j.iot.2019.100087)
-
IEEE Communications Standards MagazineSep 20182 (3) p.16-21 (DOI:10.1109/MCOMSTD.2018.1800022)
-
Future Generation of Computer SystemsSep 2017Elsevier (DOI:10.1016/j.future.2017.09.023)
-
Proceedings of the 18th IEEE International Symposium on Network Computing and Applications (NCA'19)Sep 2019
Offchain protocols aim at bypassing the scalability and privacy limitations of classic blockchains by allowing a subset of participants to execute multiple transactions outside the blockchain. While existing solutions like payment networks and factories depend on a complex routing protocol, other solutions simply require participants to build a emph{childchain}, a secondary blockchain where their transactions are privately executed. Unfortunately, all childchain solutions assume either synchrony or a trusted execution environment. In this paper we present Platypus, an offchain protocol that requires neither synchony nor a trusted execution environment. Relieving the need for a trusted execution environment allows Platypus to ensure privacy without trusting a central authority, like Intel, that manufactures dedicated hardware chipset, like SGX. Relieving the need for synchrony means that no attacker can steal coins by leveraging clock drifts or message delays to lure timelocks. In order to prove our algorithm correct, we formalize the chilchain problem as a Byzantine variant of the classic Atomic Commit problem, where closing an offchain protocol is equivalent to committing the whole set of payments previously recorded on the childchain "atomically" on the main chain. Platypus is resilience optimal and we explain how to generalize it to crosschain payments.
-
International Conference on Blockchain, Economics, Security and Protocols (Tokenomics'19)2019
-
Community Ethereum Development Conference (EDCON'19)2019
-
Proceedings of the 17th IEEE International Symposium on Network Computing and Applications (NCA'18)2018IEEE
-
Proceedings of the 37th IEEE International Symposium on Reliable Distributed Systems (SRDS'18)Oct 2018
-
Proceedings of the IEEE International Conference on Blockchain (Blockchain'18)Jul 2018
-
Proceedings of the 9th IFIP International Conference on New Technologies, Mobility and Security (NTMS'18)Feb 2018
-
Proceedings of the 36th International Symposium on Reliable Distributed Systems (SRDS'17)Sep 2017IEEE p.64-73
-
Proceedings of the 47th IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'17)Jun 2017IEEE p.579-590
-
Proceedings of the 15th IEEE International Symposium on Network Computing and Applications (NCA'16)Oct 2016IEEE p.310-317
-
Proceedings of the 13th Working IEEE/IFIP Conference on Software Architecture (WICSA'16)Apr 2016IEEE p.182-191
-
Workshop on Distributed Cryptocurrencies and Consensus Ledgers (DCCL'16)2016
-
19ème rencontres francophones sur les aspects algorithmiques de télécommunications (AlgoTel'17)2017