{"title":"A Multi-Strategy Adversarial Attack Method for Deep Learning Based Malware Detectors","authors":"Wang Yang, Fan Yin","doi":"10.1109/CSP58884.2023.00018","DOIUrl":"https://doi.org/10.1109/CSP58884.2023.00018","url":null,"abstract":"Deep learning allows building high-accuracy malware detectors without complicated feature engineering. However, research shows that the deep learning model is vulnerable and can be deceived if attackers add perturbation to input samples to craft adversarial examples deliberately. By altering the pixel values of the images, attackers have been able to generate adversarial examples that can fool state-of-the-art deep learning based image classifiers. However, Windows malware is a structured binary program file. Therefore, arbitrarily altering its contents will often break the program's functionality. In order to solve this problem, a standard but inefficient method is to run the sample in the sandbox to verify whether its functionality is preserved. This paper proposes a multi-strategy adversarial attack method, which can generate malware adversarial examples with functionality-preserving. Our method manipulates the redundant or extended space in the Windows malware binary, so it will not break functionality. Experiments show that our method has a high attack success rate and efficiency.","PeriodicalId":255083,"journal":{"name":"2023 7th International Conference on Cryptography, Security and Privacy (CSP)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128854595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Efficient Privacy-Preserving Data Aggregation for Lightweight Secure Model Training in Federated Learning","authors":"Cong Hu, Shuang Wang, Cuiling Liu, T. Zhang","doi":"10.1109/CSP58884.2023.00026","DOIUrl":"https://doi.org/10.1109/CSP58884.2023.00026","url":null,"abstract":"Federated learning has been widely adopted in every aspect of our daily life to well protect the dataset privacy, since the model parameters are trained locally and aggregated to global one, but the data themselves are not required to be sent to servers as traditional machine learning. In State Grid, different power companies tend to cooperate to train a global model to predict the risk of the grid or the trustworthiness of the customers in the future. The datasets belonging to each power company should be protected against another corporation, sector or other unauthorized entities, since they are closely related to users' privacy. On the other hand, it is widely reported even the local mode parameters can also be exploited to launch several attacks such as membership inference. Most existing work to realize privacy-preserving model aggregation relies on computationally intensive public key homomorphic encryption(HE) such as Paillier's cryptosystem, which loads intolerably high complexity on resource-constrained local users. To address this challenging issue, in this paper, a lightweight privacy-preserving data aggregation scheme is proposed without utilizing public-key homomorphic encryption. First, an efficient privacy-preserving data aggregation protocol PPDA is proposed based on any one-way trapdoor permutation in the multiple user setting. Then, based on PPDA, a lightweight secure model training scheme LSMT in federated learning is designed. Finally, security analysis and extensive simulations show that our proposed PPDA and LSMT well protect the sensitive data of power enterprises from collusion attacks, guarantees the security of aggregated results, and outperforms existing ones in terms of computational and communication overhead.","PeriodicalId":255083,"journal":{"name":"2023 7th International Conference on Cryptography, Security and Privacy (CSP)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126556633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Computation on Jacobians of Hyperelliptic Curves of Genus 3","authors":"Zhili Dong, Minzhong Luo, Chang Lv","doi":"10.1109/CSP58884.2023.00032","DOIUrl":"https://doi.org/10.1109/CSP58884.2023.00032","url":null,"abstract":"In this article, we give an easy method to distinguish different cases of additions on Jacobians of hyperelliptic curves of genus 3. In addition, we give an advanced algorithm for group laws on Jacobian of hyperelliptic curves of genus 3. By this method, our algorithm can handle all kinds of inputs without recalling a generic algorithm. Our method is mainly based on Harley's algorithm. However, we use linear algebra over finite fields, instead of Chinese Reminder Theorem over function fields. Moreover, We did $2times 10^{8}$ experiments in the finite field $mathbb{F}_{2^{61}-1}$, our algorithm runs 0.033% faster than previous works in general addition.","PeriodicalId":255083,"journal":{"name":"2023 7th International Conference on Cryptography, Security and Privacy (CSP)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134410518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Secure Multiparty Computation with Identifiable Abort and Fairness","authors":"Long Nie, ShaoWen Yao, J. Liu","doi":"10.1109/CSP58884.2023.00023","DOIUrl":"https://doi.org/10.1109/CSP58884.2023.00023","url":null,"abstract":"Dishonest majority considered in the SPDZ(the nickname of the protocol of Damgard et al. from Crypto 2012) protocols implies the impossibility of fairness(which means that corrupted parties can prevent the honest parties from learning output). The corrupted parties can learn the outputs of the honest parties and abort the protocol. Settling for the second best, there are many works focusing on the detection of the cheaters. We construct a SPDZ-like protocol which achieves fairness when at most $n/2$ parties behave maliciously and supports identifiable abort for dishonest majority. We suggest a sharing stage after the parties finish their computation. The parties share the returns of the computation in this stage. The correctness of the sharing is guaranteed by verifiable secret sharing and homomorphic signature. The honest parties can reconstruct the outputs of the cheaters in the setting of an honest majority. We can't prevent the corrupted parties from learning the outputs and aborting the protocol for dishonest majority. Therefore, the sharing stage does not harm to the honest parties. Instead, we provide the honest parties with the identities of all cheaters in this case.","PeriodicalId":255083,"journal":{"name":"2023 7th International Conference on Cryptography, Security and Privacy (CSP)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128087859","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Classification and Application of Long-duration Flows Based on Flow Behavior","authors":"Zihao Chen, Wei Ding, Weijian Sun, Liang Xu","doi":"10.1109/CSP58884.2023.00009","DOIUrl":"https://doi.org/10.1109/CSP58884.2023.00009","url":null,"abstract":"Long-duration flows are extended network flows in the Internet that result from various network activities such as file transfers, persistent connections, and control command transmissions. These flows are utilized by a broad range of applications in the Internet, both benign and malicious, and their management and security are crucial for the functioning of the Internet. In this study, we categorize long-duration flows into three types: control flows, mixed flows, and information flows, based on their purpose for existence. Subsequently, features are extracted based on three characteristics: flow, time series, and packet length. The selected features are used to construct a dataset for training a classification model. The empirical analysis of real-world traffic data from high-speed network boundaries demonstrates that the classification model is capable of accurately identifying control flows in long-duration flows and determining specific applications within them.","PeriodicalId":255083,"journal":{"name":"2023 7th International Conference on Cryptography, Security and Privacy (CSP)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127172209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wei Zheng, Ning Tian, Kejie Zhao, Hong Lei, Zhiwei Liu
{"title":"A Survey on Cross-Chain Data Transfer","authors":"Wei Zheng, Ning Tian, Kejie Zhao, Hong Lei, Zhiwei Liu","doi":"10.1109/CSP58884.2023.00017","DOIUrl":"https://doi.org/10.1109/CSP58884.2023.00017","url":null,"abstract":"Blockchain technology is moving towards multichain interconnection, i.e., various blockchains sharing data, assets and functions to collaborate. To enable different blockchains to work together, Cross-chain Data Transfer technology is significant and developing rapidly, attracting the attention of both industry and academia. This paper defines Cross-chain Data Transfer (CDT) at the level of technical goals, explains the unique importance of CDT and discuss schemes for designing CDT approaches. We collect the latest approaches that have been applied in the field and analyze their advantages and disadvantages. Moreover, we discuss future challenges and research directions, show the broad research prospects in the field of CDT technology.","PeriodicalId":255083,"journal":{"name":"2023 7th International Conference on Cryptography, Security and Privacy (CSP)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133262887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A New Research on Verifiable and Searchable Encryption Scheme Based on Blockchain","authors":"Zhong Kang, Maoning Wang","doi":"10.1109/CSP58884.2023.00037","DOIUrl":"https://doi.org/10.1109/CSP58884.2023.00037","url":null,"abstract":"Cloud storage attracts more and more individuals and enterprises to outsource and store data on cloud servers due to its advantages of high efficiency, speed, low economic cost and on-demand access. Due to privacy requirements, data files need to be uploaded after being encrypted. Current searchable encryption technology enables retrieval of encrypted data, but lacks verification of searched results. In response to the above problem, this paper proposes a new searchable encryption scheme based on blockchain, which supports multi-keyword ranked search together with verification of searched results. Concretely, the scheme first encrypts the data and uploads it to the cloud server, then builds the index via blockchain. By calling the smart contracts to execute the search algorithm, the search result is returned to the user and the hash value is verified, which ensures the integrity and accuracy of the searched result. Secondly, by combining the vector space model and BM25 model to construct the index and query of encrypted data, the ranked search for multiple keywords is realized, in which the keyword balanced binary tree index is established to improve the retrieval efficiency. Experimental results show that the improved scheme has higher search accuracy while ensuring retrieval efficiency.","PeriodicalId":255083,"journal":{"name":"2023 7th International Conference on Cryptography, Security and Privacy (CSP)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131071902","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Improved Key Mismatch Attack on Kyber","authors":"Yaru Wang, Haodong Jiang, Zhi Ma","doi":"10.1109/CSP58884.2023.00030","DOIUrl":"https://doi.org/10.1109/CSP58884.2023.00030","url":null,"abstract":"Recently, American National Institute of Standards and Technology (NIST) announced Kyber as the first KEM candidate to be standardized. The security of Kyber is based on the modular learning with errors (MLWE) problem, which achieves excellent efficiency and size. This work proposes an improved key mismatch on Kyber, which can reduce the number of queries required to recover the secret key. We first transform the problem of finding a certain parameter of ciphertexts into a quantum ordered search problem. Then we give the procedure of finding the value of a parameter in the ciphertexts by the quantum method. Finally, we instantiate this attack method on Kyber512, Kyber768 and Kyber1024. Compared with the existing attack algorithm, our improved attack reduces the number of queries for Kyber512, Kyber768 and Kyber1024 by 63%, 59% and 45%, respectively.","PeriodicalId":255083,"journal":{"name":"2023 7th International Conference on Cryptography, Security and Privacy (CSP)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121470631","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Generating t-Closed Partitions of Datasets with Multiple Sensitive Attributes","authors":"Vikas Thammanna Gowda, R. Bagai","doi":"10.1109/CSP58884.2023.00024","DOIUrl":"https://doi.org/10.1109/CSP58884.2023.00024","url":null,"abstract":"The popular t-closeness privacy model requires the “distance” between the distribution of sensitive attribute values in any given raw dataset and their distribution in every equivalence class created to not exceed some privacy threshold t. While most existing methods for achieving t-closeness handle data with just a single sensitive attribute, datasets with multiple sensitive attributes are very common in the real world. Here we demonstrate a technique for creating equivalence classes from a dataset containing multiple sensitive attributes. The equivalence classes generated by our method satisfy t-closeness without taking any $t$ values as input. While generalization of quasi-identifier attributes leads to information loss, the size of generated classes is roughly identical and differs by at most one, which results in a lower information loss. Generating classes with minimum information loss for a given value of $t$ is NP-hard, the equivalence classes generated by our method takes O(r log r) time.","PeriodicalId":255083,"journal":{"name":"2023 7th International Conference on Cryptography, Security and Privacy (CSP)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125049901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Improved DEFAULT-like Cipher via Dynamic Secret S-Boxes Against Differential Fault Attack","authors":"Linyang Yan, Huijiao Wang, Yongzhuang Wei","doi":"10.1109/CSP58884.2023.00035","DOIUrl":"https://doi.org/10.1109/CSP58884.2023.00035","url":null,"abstract":"DEFAULT block cipher presented at ASIACRYPT 2021 was specially designed against differential fault attack (DFA). However, the security of DEFAULT against Information Combining Differential Fault Attack (IC-DFA) was further checked at EUROCRYPT 2022. It is illustrated that IC-DFA can recover the secret key of DEFAULT with less than 100 faults and negligible computational complexity. In this article, a variant cipher based on linear structure and dynamic secret S-box (called DEFAULT-DS) is proposed. More precisely, DEFAULT-DS introduces 15 secret S-boxes, where the selection of these S-boxes is determined by using the round subkey. Moreover, the experimental results show that DEFAULT-DS achieves better security level and stronger resistance against DFA compared with original DEFAULT. In particular, DEFAULT-DS can resist to both the classical DFA and IC-DFA. Furthermore, the software implementation complexity of DEFAULT-DS is similar as DEFAULT.","PeriodicalId":255083,"journal":{"name":"2023 7th International Conference on Cryptography, Security and Privacy (CSP)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126040805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}