activity
20082025
most citedFixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees

5 citations · 12 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CR2025★ 3 cited

Rethinking Tamper-Evident Logging: A High-Performance, Co-Designed Auditing System

Rui Zhao, Muhammad Shoaib, Viet Tung Hoang +1

Existing tamper-evident logging systems suffer from high overhead and severe data loss in high-load settings, yet only provide coarse-grained tamper detection. Moreover, installing…

cs.DC2020★ 4 cited

CryptMPI: A Fast Encrypted MPI Library

Abu Naser, Cong Wu, Mehran Sadeghi Lahijani +4

The cloud infrastructure must provide security for High-Performance Computing (HPC) applications of sensitive data to execute in such an environment. However, supporting security i…

cs.DC2020

Performance Evaluation and Modeling of Cryptographic Libraries for MPI Communications

Abu Naser, Mehran Sadeghi Lahijani, Cong Wu +4

In order for High-Performance Computing (HPC) applications with data security requirements to execute in the public cloud, the cloud infrastructure must ensure the privacy and inte…

cs.CR2012

An Enciphering Scheme Based on a Card Shuffle

Viet Tung Hoang, Ben Morris, Phillip Rogaway

We introduce the swap-or-not shuffle and show that the technique gives rise to a new method to convert a pseudorandom function (PRF) into a pseudorandom permutation (PRP) (or, alte…

cs.DS2008★ 5 cited

Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees

Viet Tung Hoang, Wing-Kin Sung

Consider a set of labels and a set of trees ${\mathcal T} = \{{\mathcal T}^{(1), {\mathcal T}^{(2), ..., {\mathcal T}^{(k) \$ where each tree ${\mathcal T}^{(i)$ is distinctly…