Tieming Geng

Dr. Tieming Geng

orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
26 September 2024 in Network
Verified
Journal Article
Open access
PDF file
MSMatthew Sharp
Matthew Sharp
LNLaurent Njilla
Laurent Njilla
Chin-tser HuangChin-tser Huang
Chin-tser Huang
TGTieming Geng
Tieming Geng
Advancements in blockchain technology and network technology are bringing in a new era in electronic voting systems. These systems are characterized by enhanced security, efficiency, and accessibility. In this paper, we compose a comparative analysis of blockchain-based electronic voting (e-voting) systems using blockchain technology, cryptographic techniques, counting methods, and security requirements. The core of the analysis involves a detailed examination of blockchain-based electronic voting systems, focusing on the variations in architecture, cryptographic techniques, vote counting methods, and security. We also introduce a novel blockchain-based e-voting system, which integrates advanced methodologies, including the Borda count and Condorcet method, into e-voting systems for improved accuracy and representation in vote tallying. The system’s design features a flexible and amendable blockchain structure, ensuring robustness and security. Practical implementation on a Raspberry Pi 3 Model B+ demonstrates the system’s feasibility and adaptability in diverse environments. Our study of the evolution of e-voting systems and the incorporation of blockchain technology contributes to the development of secure, transparent, and efficient solutions for modern democratic governance.

25 January 2022 in Network
Verified
Journal Article
Open access
PDF file
TGTieming Geng
Tieming Geng
LNLaurent Njilla
Laurent Njilla
Chin-tser HuangChin-tser Huang
Chin-tser Huang
With the rapid advancement and wide application of blockchain technology, blockchain consensus protocols, which are the core part of blockchain systems, along with the privacy issues, have drawn much attention from researchers. A key aspect of privacy in the blockchain is the sensitive content of transactions in the permissionless blockchain. Meanwhile, some blockchain applications, such as cryptocurrencies, are based on low-efficiency and high-cost consensus protocols, which may not be practical and feasible for other blockchain applications. In this paper, we propose an efficient and privacy-preserving consensus protocol, called Delegated Proof of Secret Sharing (DPoSS), which is inspired by secure multiparty computation. Specifically, DPoSS first uses polynomial interpolation to select a dealer group from many nodes to maintain the consensus of the blockchain system, in which the dealers in the dealer group take turns to pack the new block. In addition, since the content of transactions is sensitive, our proposed design utilizes verifiable secret sharing to protect the privacy of transmission and defend against the malicious attacks. Extensive experiments show that the proposed consensus protocol achieves fairness during the process of reaching consensus.

24 April 2018 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
RXRuofan Xia
Ruofan Xia
YLYu Lin
Yu Lin
JZJun Zhou
Jun Zhou
TGTieming Geng
Tieming Geng
BFBing Feng
Bing Feng
JTJijun Tang
Jijun Tang
Cancer is known for its heterogeneity and is regarded as an evolutionary process driven by somatic mutations and clonal expansions. This evolutionary process can be modeled by a phylogenetic tree and phylogenetic analysis of multiple subclones of cancer cells can facilitate the study of the tumor variants progression. Copy-number aberration occurs frequently in many types of tumors in terms of segmental amplifications and deletions. In this paper, we developed a distance-based method for reconstructing phylogenies from copy-number profiles of cancer cells. We demonstrate the importance of distance correction from the edit (minimum) distance to the estimated actual number of events. Experimental results show that our approaches provide accurate and scalable results in estimating the actual number of evolutionary events between copy number profiles and in reconstructing phylogenies.