Keyboard acoustic side channel attacks exploit audio leakage from typing to deduce typed words with a certain level of accuracy. Researchers have been improving the accuracy of these attacks through various techniques of feature extraction and classification. They also apply machine learning methods and deep learning techniques to enhance the accuracy of their results. At the same time, defense mechanisms against these attacks have not kept up with the increasing precision of the attacks. In this study, we introduce a practical defense strategy against keyboard acoustic attacks during password and text typing. We evaluate its effectiveness against multiple attack vectors. Our defense strategy involves generating unique background sounds using GANs to mask sensitive audio leaks from the keyboard, thwarting side channel attacks from extracting usable information about typed content. The background sounds are produced by the device used for text input. We assess the usability of our approach for short and prolonged usage durations, demonstrating that the addition of background sounds does not impede users’ ability to enter passwords or perform computer tasks effectively.
In the vector operation system, each data operation will only increase or decrease the same number for each component of the vector, that is to say, the vector is regarded as a data object on the whole, and each operation is carried out on the whole. For example, translation, scaling and other operations in computer graphics. Such computing systems are currently widely used in graphics, machine learning, mathematical modeling and other fields. When the data in the vector computing system is homomorphic encrypted and uploaded to the cloud server, the problem of low vector coding efficiency and polynomial coefficient expansion caused by a large number of polynomial operations is generated. The existing SIMD coding algorithm encodes an n-dimensional vector integer into a polynomial. The number of calculations increases exponentially with the increase of n, and the coding efficiency of the vector is very low. For typical FHE schemes such as BGV, BFV and CKKS, the main performance bottleneck comes from a large number of polynomial algorithms. Specifically, encrypted data is typically composed of a pair of polynomials with coefficients of hundreds or thousands of bits, requiring expensive multiword arithmetic. In addition, large polynomial lengths increase the computational complexity. Therefore, in this paper, a vector compression coding algorithm based on SIMD(VCABSIMD) is proposed to solve the performance problem when the data in the vector computing system is homomorphically encrypted and uploaded to the cloud server for calculation. The vector coding efficiency and polynomial calculation are deeply optimized.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.