Cyril Naves Samuel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Cyril Naves Samuel has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- François Verdier
Université Côte d’Azur, LEAT/CNRS UMR 7248
4 shared publications - Severine Glock
Renault Software Factory
4 shared publications - Patricia Guitton-Ouhamou
Renault Software Factory
3 shared publications - Guitton-Ouhamou Patricia1 shared publication
Latest Publications
- Open Access
- 30 April 2024
- Published by MDPI AG in Future Internet
- Vol. 16 (5) , 156
A Fair Crowd-Sourced Automotive Data Monetization Approach Using Substrate Hybrid Consensus Blockchain
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.
- 30 April 2024
- Published by MDPI AG in Future Internet
- Vol. 16 (5) , 156
Open AccessA Fair Crowd-Sourced Automotive Data Monetization Approach Using Substrate Hybrid Consensus Blockchain
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.
- Open Access
Can Byzantine Fault Tolerant Consensus Agreement be Utilitarian, Scalable and Resilient? An Algorithm Proposition from a Consortium Blockchain Perspective: CUBA
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.
Open AccessCan Byzantine Fault Tolerant Consensus Agreement be Utilitarian, Scalable and Resilient? An Algorithm Proposition from a Consortium Blockchain Perspective: CUBA
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.
- 15 November 2023
- Published by Springer Nature
- p. 164-174
Virtuous Data Monetisation Cycle: A Hybrid Consensus Substrate Automotive Consortium Blockchain Solution
- 15 November 2023
- Published by Springer Nature
- p. 164-174
Virtuous Data Monetisation Cycle: A Hybrid Consensus Substrate Automotive Consortium Blockchain Solution
- 21 July 2023
- Published by Springer Nature
- p. 31-43
CUBA: An Evolutionary Consortium Oriented Distributed Ledger Byzantine Consensus Algorithm
- 21 July 2023
- Published by Springer Nature
- p. 31-43
CUBA: An Evolutionary Consortium Oriented Distributed Ledger Byzantine Consensus Algorithm