Cyril Naves Samuel

Cyril Naves Samuel


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 April 2024 in Future Internet
Verified
Journal Article
Open access
PDF file
CSCyril Naves Samuel
Cyril Naves Samuel
FVFrançois Verdier
François Verdier
SGSeverine Glock
Severine Glock
PGPatricia Guitton-Ouhamou
Patricia Guitton-Ouhamou
This work presents a private consortium blockchain-based automotive data monetization architecture implementation using the Substrate blockchain framework. Architecture is decentralized where crowd-sourced data from vehicles are collectively auctioned ensuring data privacy and security. Smart Contracts and OffChain worker interactions built along with the blockchain make it interoperable with external systems to send or receive data. The work is deployed in a Kubernetes cloud platform and evaluated on different parameters like throughput, hybrid consensus algorithms AuRa and BABE, along with GRANDPA performance in terms of forks and scalability for increasing node participants. The hybrid consensus algorithms are studied in depth to understand the difference and performance in the separation of block creation by AuRa and BABE followed by chain finalization through the GRANDPA protocol.



9 April 2024 in HAL
Verified
Preprint
Open access
PDF file
CSCyril Naves Samuel
Cyril Naves Samuel
FVFrançois Verdier
François Verdier
SGSeverine Glock
Severine Glock
GPGuitton-Ouhamou Patricia
Guitton-Ouhamou Patricia
Byzantine Fault Tolerant (BFT) Algorithms have been utilized in distributed systems or blockchains for solving consensus problemsby being reliable, consistent, and ensuring availability. However, in the case of consortium blockchains where the network is moreaccountable with limited participation, there is a need to modify the BFT algorithms while ensuring the existing advantages butimproving upon its scalability and fault tolerance. So in this scenario, we analyze the BFT consensus algorithms performance froma mobility consortium blockchain perspective for data certification and data monetization use cases. We identify the challenges ofmessage complexity and security in the algorithm through this implementation and propose an improved algorithm CUBA (CompetitiveUtilitarian Byzantine Agreement). It achieves better scalability compared to PBFT, IBFT, and QBFT algorithm variants of BFT andremains comparable to Clique. CUBA uses parallelization, reduced communication complexity through quorums, utilitarian actionmeasures, and network evolution to render the system secure and performant. It is analyzed from a performance and a security pointof view to test its resilience against benign or non-benign failures.