2026/06/09
6/29(一) 專題演講 - Cryptographic Shuffling for Enhancing Relational Database Security
演講題目： Cryptographic Shuffling for Enhancing Relational Database Security
時間：2026/06/29(一) 上午10:30 ~ 12:00
地點：大仁樓200301教室
講者：Dr. Chin-Tser Huang, Professor, Department of Computer Science and Engineering, University of South Carolina (南卡羅萊納大學 黃金澤教授)
演講摘要：
Database security holds paramount importance as it safeguards an organization’s most valuable assets: data. In an age marked by escalating cyber threats, protecting sensitive information stored in databases is essential to preserve trust, prevent financial losses, and maintain legal compliance. In this talk, we introduce a paradigm of cryptographic secure shuffling algorithm designed to enhance relational database security. Encryption algorithms have long served as a means of safeguarding sensitive and proprietary data. However, our shuffling algorithm offers distinct advantages over the encryption methods: Firstly, the shuffling algorithm preserves the original data form and introduces deception, reducing the time to detect the data leak. Secondly, shuffling can complement encryption, offering an additional layer of data protection. We also talk about the pathway on improving the effectiveness and efficiency of the shuffling algorithm including the improvement on shuffling algorithm, and the adoption of hardware acceleration. The comprehensive security analyses have demonstrated the cryptographic robustness of the proposed shuffling algorithm with acceptable performance overhead.
Database security holds paramount importance as it safeguards an organization’s most valuable assets: data. In an age marked by escalating cyber threats, protecting sensitive information stored in databases is essential to preserve trust, prevent financial losses, and maintain legal compliance. In this talk, we introduce a paradigm of cryptographic secure shuffling algorithm designed to enhance relational database security. Encryption algorithms have long served as a means of safeguarding sensitive and proprietary data. However, our shuffling algorithm offers distinct advantages over the encryption methods: Firstly, the shuffling algorithm preserves the original data form and introduces deception, reducing the time to detect the data leak. Secondly, shuffling can complement encryption, offering an additional layer of data protection. We also talk about the pathway on improving the effectiveness and efficiency of the shuffling algorithm including the improvement on shuffling algorithm, and the adoption of hardware acceleration. The comprehensive security analyses have demonstrated the cryptographic robustness of the proposed shuffling algorithm with acceptable performance overhead.
講者簡介：
Dr. Chin-Tser Huang is a Professor in the Department of Computer Science and Engineering at the University of South Carolina at Columbia. He received the B.S. degree in Computer Science and Information Engineering from National Taiwan University, Taipei, Taiwan, in 1993, and the M.S. and Ph.D. degrees in Computer Sciences from The University of Texas at Austin in 1998 and 2003, respectively. His research interests include network security, network protocol design and verification, and distributed systems. He is the director of the Secure Protocol Implementation and Development (SPID) Laboratory at the University of South Carolina. He is the author (along with Mohamed Gouda) of the book “Hop Integrity in the Internet,” published by Springer in 2005. His research has been funded by DARPA, AFOSR, AFRL, NSF, NEH, and USDOT. He is an NRC Research Associate in 2020, and a recipient of the USAF Summer Faculty Fellowship Award and of the AFRL Visiting Faculty Research Program Award in 2008-2024. He is a Senior Member of IEEE and ACM.