Henry F. Korth
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Henry F. Korth has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Anwitaman Datta
College of Computing and Data Science, Nanyang Technological University, Singapore
1 shared publication - Benjamin Aulenbach
Macguyver Tech, USA
1 shared publication - Bretislav Hajek
National University of Singapore, Singapore
1 shared publication - Caleb Geren
Dept. of Computer Science and Eng., Lehigh University, USA
1 shared publication - Daniël Reijsbergen
Singapore University of Technology and Design
1 shared publication - Depaul Miller
Lehigh University, Bethlehem, PA, United States
1 shared publication
Latest Publications
- Open Access
- 5 November 2024
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
CroCoDai : A Stablecoin for Cross-Chain Commerce
Decentralized Finance (DeFi), in which digital assets are exchanged without trusted intermediaries, has grown rapidly in value in recent years. Stablecoins , which are pegged to a non-volatile asset such as the US dollar, are a prominent feature of DeFi as they mitigate the risk associated with price fluctuations. However, existing stablecoin systems are tied to individual blockchain platforms, and trusted parties or complex protocols are needed to exchange stablecoin tokens between blockchains. Our goal is to design a practical stablecoin system for cross-chain commerce, and to do so we must overcome two main challenges. The first is to support a large and growing number of blockchains efficiently. The second is for the stablecoin to be resilient to blockchain platform failures and to price fluctuations that affect its collateral. We present CroCoDai to address these challenges. We demonstrate CroCoDai 's efficiency by comparing the performance of a prototype implementation to related baselines, and its resilience through an empirical analysis of historical token price data.
- 5 November 2024
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
Open AccessCroCoDai : A Stablecoin for Cross-Chain Commerce
Decentralized Finance (DeFi), in which digital assets are exchanged without trusted intermediaries, has grown rapidly in value in recent years. Stablecoins , which are pegged to a non-volatile asset such as the US dollar, are a prominent feature of DeFi as they mitigate the risk associated with price fluctuations. However, existing stablecoin systems are tied to individual blockchain platforms, and trusted parties or complex protocols are needed to exchange stablecoin tokens between blockchains. Our goal is to design a practical stablecoin system for cross-chain commerce, and to do so we must overcome two main challenges. The first is to support a large and growing number of blockchains efficiently. The second is for the stablecoin to be resilient to blockchain platform failures and to price fluctuations that affect its collateral. We present CroCoDai to address these challenges. We demonstrate CroCoDai 's efficiency by comparing the performance of a prototype implementation to related baselines, and its resilience through an empirical analysis of historical token price data.
- Open Access
- 20 February 2024
- Published by Association for Computing Machinery (ACM)
- p. 463-465
POSTER: OCToPus: Semantic-aware Concurrency Control for Blockchain Transactions
Many blockchain implementations offer APIs to send and receive money between accounts exclusively. In this paper, we introduce OCToPus, a deterministic concurrency control scheme that uses a semantic-aware fast path and a GPU-accelerated directed acyclic graph-based fallback path to parallelize the execution of a block aggressively.
- 20 February 2024
- Published by Association for Computing Machinery (ACM)
- p. 463-465
Open AccessPOSTER: OCToPus: Semantic-aware Concurrency Control for Blockchain Transactions
Many blockchain implementations offer APIs to send and receive money between accounts exclusively. In this paper, we introduce OCToPus, a deterministic concurrency control scheme that uses a semantic-aware fast path and a GPU-accelerated directed acyclic graph-based fallback path to parallelize the execution of a block aggressively.
- Open Access
- 23 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 10-18
BBSF: Blockchain Benchmarking Standardized Framework
- 23 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 10-18
Open AccessBBSF: Blockchain Benchmarking Standardized Framework
- Open Access
- 23 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Scaling Zero-Knowledge to Verifiable Databases
Zero-Knowledge proofs are a cryptographic technique to reveal knowledge of information without revealing the information itself, thus enabling systems optimally to mix privacy and transparency, and, where needed, regulatability. Application domains include health and other enterprise data, financial systems such as central-bank digital currencies, and performance enhancement in blockchain systems. The challenge of zero-knowledge proofs is that, although they are computationally easy to verify, they are computationally hard to produce. This paper examines the scalability limits of leading zero-knowledge algorithms and addresses the use of parallel architectures to meet performance demands of applications.
- 23 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessScaling Zero-Knowledge to Verifiable Databases
Zero-Knowledge proofs are a cryptographic technique to reveal knowledge of information without revealing the information itself, thus enabling systems optimally to mix privacy and transparency, and, where needed, regulatability. Application domains include health and other enterprise data, financial systems such as central-bank digital currencies, and performance enhancement in blockchain systems. The challenge of zero-knowledge proofs is that, although they are computationally easy to verify, they are computationally hard to produce. This paper examines the scalability limits of leading zero-knowledge algorithms and addresses the use of parallel architectures to meet performance demands of applications.