Victor Youdom Kemmoe

Victor Youdom Kemmoe

Auto-generated profile, based on publicly available information

Victor Youdom Kemmoe

Brown University, Providence, Rhode Island, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
25 June 2020 in IEEE Access
Verified
Journal Article
Open access
VKVictor Youdom Kemmoe
Victor Youdom Kemmoe
WSWilliam Stone
William Stone
JKJeehyeong Kim
Jeehyeong Kim
DKDaeyoung Kim
Daeyoung Kim
Junggab SonJunggab Son
Junggab Son
Smart contracts, as an added functionality to blockchain, have received increased attention recently. They are executable programs whose instance and state are stored in blockchain. Hence, smart contracts and blockchain enable a trustable, trackable, and irreversible protocol without the need for trusted third parties which generally constitute a single point of failure. If a user creates and distributes a smart contract, others will be able to interact with it while the underlying blockchain ensures a trustable execution. In this paper, we aim to introduce state-of-the-art technologies of the smart contract protocol. We firstly introduce the history of blockchain and smart contracts followed by their step-by-step operations. Then, we introduce the survey results which are classified into four categories based on their purposes: cryptography, access management, social application, and smart contract structure. By presenting the most recent knowledge, this paper will contribute to the advances and proliferation of smart contracts.

2 December 2024
Verified
Conference Paper
Open access
VKVictor Youdom Kemmoe
Victor Youdom Kemmoe
ALAnna Lysyanskaya
Anna Lysyanskaya
A cryptographic accumulator is a compact data structure for representing a set of elements coming from some domain. It allows for a compact proof of membership and, in the case of a universal accumulator, non-membership of an element x in the data structure. A dynamic accumulator, furthermore, allows elements to be added to and deleted from the accumulator. Previously known RSA-based dynamic accumulators were too slow in practice because they required that an element in the domain be represented as a prime number. Accumulators based on settings other than RSA had other drawbacks such as requiring a prohibitively large common reference string or a trapdoor, or not permitting deletions. In this paper, we construct an RSA-based dynamic accumulator that does not require that the accumulated elements be represented as primes and show how it can be extended into a universal accumulator. We also show how to aggregate membership and non-membership witnesses and batch additions and deletions. We demonstrate that, for 112-bit, 128-bit, and 192-bit security, the efficiency gains compared to previously known RSA-based accumulators are substantial, and, for the first time, make cryptographic accumulators a viable candidate for a certificate revocation mechanism as part of a WebPKI-type system. To achieve an efficient verification time for aggregated witnesses, we introduce a variant of Wesolowski's proof of exponentiation (Journal of Cryptology 2020) that does not require hashing into primes.

12 July 2022 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Open access
VKVictor Youdom Kemmoe
Victor Youdom Kemmoe
YKYongseok Kwon
Yongseok Kwon
RHRasheed Hussain
Rasheed Hussain
Sunghyun ChoSunghyun Cho
Sunghyun Cho
Junggab SonJunggab Son
Junggab Son
Group Key Exchange (GKE) is an important tool to develop secure multi-user applications such as group text messages, ad-hoc networks, and so on. Most of the currently deployed GKE schemes are synchronous, i.e., they require all the participants to be online during their execution. However, with more battery-powered devices being used in such applications, the synchronicity requirement is challenging to fulfill. To fill the gaps, asynchronous GKE schemes have been introduced in the literature. Nevertheless, the currently available asynchronous and synchronous GKE schemes rely on Trusted Third Parties (TTPs) for key establishment and management. To this end, reliance on TTPs is a serious shortcoming since TTPs are well known to be the single point of failure. Furthermore, the existing GKE schemes require participants to perform all computations, which can degrade the performance of resource-constrained devices such as Internet of Things (IoT) devices. To solve these problems, in this paper, we propose an asynchronous GKE scheme that uses blockchain and smart contracts to store the security keys-related material and reduce the computational load of the participants. Furthermore, our proposed scheme provides Perfect Forward Secrecy (PFS) and Post-Compromised Security (PCS). Our implementation on Ethereum shows that the proposed scheme can scale to more than 100 participants when combined with a distributed storage system.

13 October 2020 in IEEE Access
Verified
Journal Article
Open access
WSWilliam Stone
William Stone
DKDaeyoung Kim
Daeyoung Kim
VKVictor Youdom Kemmoe
Victor Youdom Kemmoe
MKMingon Kang
Mingon Kang
Junggab SonJunggab Son
Junggab Son
One critical vulnerability of stream ciphers is the reuse of an encryption key. Since most stream ciphers consist of only a key scheduling algorithm and an Exclusive OR (XOR) operation, an adversary may break the cipher by XORing two captured ciphertexts generated under the same key. Various cryptanalysis techniques based on this property have been introduced in order to recover plaintexts or encryption keys; in contrast, this research reinterprets the vulnerability as a method of detecting stream ciphers from the ciphertexts it generates. Patterns found in the values (characters) expressed across the bytes of a ciphertext make the ciphertext distinguishable from random and are unique to each combination of ciphers and encryption keys. We propose a scheme that uses these patterns as a fingerprint, which is capable of detecting all ciphertexts of a given length generated by an encryption pair. The scheme can be utilized to detect a specific type of malware that exploits a stream cipher with a stored key such as the DarkComet Remote Access Trojan (RAT). We show that our scheme achieves 100% accuracy for messages longer than 13 bytes in about 17 μsec, providing a fast and highly accurate tool to aid in encrypted malware detection.


7 November 2026
Verified
Book Chapter
Closed access
PDF file
VKVictor Youdom Kemmoe
Victor Youdom Kemmoe
ALAnna Lysyanskaya
Anna Lysyanskaya
NNNgoc Khanh Nguyen
Ngoc Khanh Nguyen