Viet Tung Hoang

Orcid: 0000-0003-3092-6405

According to our database1, Viet Tung Hoang authored at least 36 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Robust AE With Committing Security.
IACR Cryptol. ePrint Arch., 2024

Succinctly-Committing Authenticated Encryption.
IACR Cryptol. ePrint Arch., 2024

2022
Faster Yet Safer: Logging System Via Fixed-Key Blockcipher.
IACR Cryptol. ePrint Arch., 2022

Efficient Schemes for Committing Authenticated Encryption.
IACR Cryptol. ePrint Arch., 2022

2021
Efficient Algorithms for Encrypted All-gather Operation.
Proceedings of the 35th IEEE International Parallel and Distributed Processing Symposium, 2021

2020
Security of Streaming Encryption in Google's Tink Library.
IACR Cryptol. ePrint Arch., 2020

Security Analysis of NIST CTR-DRBG.
IACR Cryptol. ePrint Arch., 2020

CryptMPI: A Fast Encrypted MPI Library.
CoRR, 2020

Performance Evaluation and Modeling of Cryptographic Libraries for MPI Communications.
CoRR, 2020

2019
Attacks Only Get Better: How to Break FF3 on Large Domains.
IACR Cryptol. ePrint Arch., 2019

An Empirical Study of Cryptographic Libraries for MPI Communications.
Proceedings of the 2019 IEEE International Conference on Cluster Computing, 2019

2018
The Multi-user Security of GCM, Revisited: Tight Bounds for Nonce Randomization.
IACR Cryptol. ePrint Arch., 2018

The Curse of Small Domains: New Attacks on Format-Preserving Encryption.
IACR Cryptol. ePrint Arch., 2018

Revisiting AES-GCM-SIV: Multi-user Security, Faster Key Derivation, and Better Bounds.
IACR Cryptol. ePrint Arch., 2018

2017
The Multi-User Security of Double Encryption.
IACR Cryptol. ePrint Arch., 2017

Information-theoretic Indistinguishability via the Chi-squared Method.
IACR Cryptol. ePrint Arch., 2017

Identity-Based Format-Preserving Encryption.
IACR Cryptol. ePrint Arch., 2017

2016
Key-alternating Ciphers and Key-length Extension: Exact Bounds and Multi-user Security.
IACR Cryptol. ePrint Arch., 2016

Selective-Opening Security in the Presence of Randomness Failures.
IACR Cryptol. ePrint Arch., 2016

Message-recovery attacks on Feistel-based Format Preserving Encryption.
IACR Cryptol. ePrint Arch., 2016

2015
Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance.
IACR Cryptol. ePrint Arch., 2015

Automated Analysis and Synthesis of Authenticated Encryption Schemes.
IACR Cryptol. ePrint Arch., 2015

Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014
Robust Authenticated-Encryption: AEZ and the Problem that it Solves.
IACR Cryptol. ePrint Arch., 2014

Cryptography from Compression Functions: The UCE Bridge to the ROM.
IACR Cryptol. ePrint Arch., 2014

UCE+LTDFs: Efficient, Subversion-Resistant PKE in the Standard Model.
IACR Cryptol. ePrint Arch., 2014

2013
Efficient Garbling from a Fixed-Key Blockcipher.
IACR Cryptol. ePrint Arch., 2013

Instantiating Random Oracles via UCEs.
IACR Cryptol. ePrint Arch., 2013

Adaptive Witness Encryption and Asymmetric Password-based Cryptography.
IACR Cryptol. ePrint Arch., 2013

2012
Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing.
IACR Cryptol. ePrint Arch., 2012

Garbling Schemes.
IACR Cryptol. ePrint Arch., 2012

An Enciphering Scheme Based on a Card Shuffle.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Foundations of garbled circuits.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011
Improved Algorithms for Maximum Agreement and Compatible Supertrees.
Algorithmica, 2011

2010
On generalized Feistel networks.
IACR Cryptol. ePrint Arch., 2010

2008
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees.
Proceedings of the STACS 2008, 2008


  Loading...