Pub Date : 2015-06-04DOI: 10.1109/ISCISC.2013.6767352
Nematollah Zarmehi, Morteza Banagar, M. Akhaee
In this paper, we investigate an additive video watermarking method in H.264 standard in presence of the Laplacian noise. In some applications, due to the loss of some pixels or a region of a frame, we resort to Laplacian noise rather than Gaussian one. The embedding is performed in the transform domain; while an optimum and a sub-optimum decoder are derived for the proposed Laplacian model. Simulation results show that the proposed watermarking scheme has suitable performance with enough transparency required for watermarking applications.
{"title":"Optimum decoder for an additive video watermarking with Laplacian noise in H.264","authors":"Nematollah Zarmehi, Morteza Banagar, M. Akhaee","doi":"10.1109/ISCISC.2013.6767352","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767352","url":null,"abstract":"In this paper, we investigate an additive video watermarking method in H.264 standard in presence of the Laplacian noise. In some applications, due to the loss of some pixels or a region of a frame, we resort to Laplacian noise rather than Gaussian one. The embedding is performed in the transform domain; while an optimum and a sub-optimum decoder are derived for the proposed Laplacian model. Simulation results show that the proposed watermarking scheme has suitable performance with enough transparency required for watermarking applications.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121499584","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}
Pub Date : 2013-08-01DOI: 10.1109/ISCISC.2013.6767323
Soodeh Bakhshandeh, F. Bakhshande, M. Aliyari
In this paper, a new steganalysis method based on Cellular Automata Transform (CAT) is presented. CAT is used for feature extraction from stego and clean images. For that purpose, three levels CAT is applied on images and 12 sub-bands are generated for feature extraction. With adding the original image, 13 sub-bands are be used in feature extraction phase. In the next step, three moments of characteristic function (CF) are used as feature vector for every image (stego or clean image). At the end, Neural Network (NN) is applied as classifier. This supervised learning method uses these features for classifying the input image into either stego-image or clean-image. The performance of this algorithm is verified using some test samples. The results of our empirical tests show that detection accuracy of our method reaches to 93% for breaking MB2 and 91% for breaking LSB. Therefore the proposed method is a blind steganalysis method that can be used for broking some steganography methods.
{"title":"Steganalysis algorithm based on Cellular Automata Transform and Neural Network","authors":"Soodeh Bakhshandeh, F. Bakhshande, M. Aliyari","doi":"10.1109/ISCISC.2013.6767323","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767323","url":null,"abstract":"In this paper, a new steganalysis method based on Cellular Automata Transform (CAT) is presented. CAT is used for feature extraction from stego and clean images. For that purpose, three levels CAT is applied on images and 12 sub-bands are generated for feature extraction. With adding the original image, 13 sub-bands are be used in feature extraction phase. In the next step, three moments of characteristic function (CF) are used as feature vector for every image (stego or clean image). At the end, Neural Network (NN) is applied as classifier. This supervised learning method uses these features for classifying the input image into either stego-image or clean-image. The performance of this algorithm is verified using some test samples. The results of our empirical tests show that detection accuracy of our method reaches to 93% for breaking MB2 and 91% for breaking LSB. Therefore the proposed method is a blind steganalysis method that can be used for broking some steganography methods.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117177921","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}
Pub Date : 2013-08-01DOI: 10.1109/ISCISC.2013.6767325
Fatemeh Barani, S. Gerami
The main goal of one-class classification is to classify one class from remaining feature space. One-class SVM is a kernel based approach which is very fast and precise and therefore is used in different fields such as image processing, protein classification and anomaly detection for statistical learning. There are some approaches suggested for anomaly detection in MANETs that most of them are static and use a predefined model. Due to the dynamic characteristics of MANETs, they cannot be applied to these networks well. In this paper we have proposed a one-class SVM for dynamic anomaly detection in mobile ad-hoc networks with AODV routing protocol, called ManetSVM. The efficiency of ManetSVM for detection of flooding, blackhole, neighbour, rushing, and wormhole attacks has been evaluated. Simulation results show that ManetSVM is able to achieve a better balance between Detection Rate and False alarm Rate in comparison with other dynamic anomaly detection approaches.
{"title":"ManetSVM: Dynamic anomaly detection using one-class support vector machine in MANETs","authors":"Fatemeh Barani, S. Gerami","doi":"10.1109/ISCISC.2013.6767325","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767325","url":null,"abstract":"The main goal of one-class classification is to classify one class from remaining feature space. One-class SVM is a kernel based approach which is very fast and precise and therefore is used in different fields such as image processing, protein classification and anomaly detection for statistical learning. There are some approaches suggested for anomaly detection in MANETs that most of them are static and use a predefined model. Due to the dynamic characteristics of MANETs, they cannot be applied to these networks well. In this paper we have proposed a one-class SVM for dynamic anomaly detection in mobile ad-hoc networks with AODV routing protocol, called ManetSVM. The efficiency of ManetSVM for detection of flooding, blackhole, neighbour, rushing, and wormhole attacks has been evaluated. Simulation results show that ManetSVM is able to achieve a better balance between Detection Rate and False alarm Rate in comparison with other dynamic anomaly detection approaches.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129924857","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}
Pub Date : 2013-08-01DOI: 10.1109/ISCISC.2013.6767329
Ehsan Shakeri, S. Ghaemmaghami
We propose an effective blind image steganalysis based on contourlet transform and Zernike moments that improves the detection accuracy of universal image steganalysis methods. The proposed method examines randomness in the test image to distinguish between the stego and non-stego images. The suspicious image is decomposed by contourlet transform, and then the absolute Zernike moments of contourlet subbands coefficients of the image and linear prediction error of each contourlet subband are extracted as features for steganalysis. These features are fed to a nonlinear SVM classifier with an RBF kernel to distinguish between cover and stego images. Experimental results show that the proposed features are highly sensitive to the change made by the embedding process to the statistical characteristics of the image. These results also reveal advantage of the proposed method over its counterpart stegan-alyzers, in cases of four popular jpeg steganography techniques. This improvement is mostly due to the greater noise sensitivity achieved using the Zernike moments that yield at least 3.5%-5% higher stego detection accuracy, relating to that of two baseline steganalyzers.
{"title":"An efficient feature extraction methodology for blind image steganalysis using contourlet transform and Zernike moments","authors":"Ehsan Shakeri, S. Ghaemmaghami","doi":"10.1109/ISCISC.2013.6767329","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767329","url":null,"abstract":"We propose an effective blind image steganalysis based on contourlet transform and Zernike moments that improves the detection accuracy of universal image steganalysis methods. The proposed method examines randomness in the test image to distinguish between the stego and non-stego images. The suspicious image is decomposed by contourlet transform, and then the absolute Zernike moments of contourlet subbands coefficients of the image and linear prediction error of each contourlet subband are extracted as features for steganalysis. These features are fed to a nonlinear SVM classifier with an RBF kernel to distinguish between cover and stego images. Experimental results show that the proposed features are highly sensitive to the change made by the embedding process to the statistical characteristics of the image. These results also reveal advantage of the proposed method over its counterpart stegan-alyzers, in cases of four popular jpeg steganography techniques. This improvement is mostly due to the greater noise sensitivity achieved using the Zernike moments that yield at least 3.5%-5% higher stego detection accuracy, relating to that of two baseline steganalyzers.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126538912","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}
Pub Date : 2013-08-01DOI: 10.1109/ISCISC.2013.6767333
M. A. Alavianmehr, M. Rezaei, M. Helfroush, A. Tashk
This paper proposes a lossless data hiding (LDH) scheme on uncompressed video data based on a multi-level histogram shifting mechanism in integer wavelet transform (IWT) domain. The proposed method enables the exact recovery of the original host signal upon extracting the embedded information, if the watermarked image is not affected by any other process. In the proposed scheme, the approximation subband image of the luminance component of a video frame is computed. Then, it is divided into non overlapping blocks. In each block, the differences between the neighboring elements are computed and a histogram is made on the difference values. The secret data are embedded into the blocks based on a multi-level shifting mechanism of the histogram. Experimental results show that proposed scheme can hide a large amount of information within a video frame with a high degree of robustness against H.264/AVC encoding.
{"title":"A reversible data hiding scheme for video robust against H.264/AVC compression","authors":"M. A. Alavianmehr, M. Rezaei, M. Helfroush, A. Tashk","doi":"10.1109/ISCISC.2013.6767333","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767333","url":null,"abstract":"This paper proposes a lossless data hiding (LDH) scheme on uncompressed video data based on a multi-level histogram shifting mechanism in integer wavelet transform (IWT) domain. The proposed method enables the exact recovery of the original host signal upon extracting the embedded information, if the watermarked image is not affected by any other process. In the proposed scheme, the approximation subband image of the luminance component of a video frame is computed. Then, it is divided into non overlapping blocks. In each block, the differences between the neighboring elements are computed and a histogram is made on the difference values. The secret data are embedded into the blocks based on a multi-level shifting mechanism of the histogram. Experimental results show that proposed scheme can hide a large amount of information within a video frame with a high degree of robustness against H.264/AVC encoding.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130798198","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}
Pub Date : 2013-08-01DOI: 10.1109/ISCISC.2013.6767328
H. Shakeri, A. G. Bafghi
In a trust management system, it is useful to have a measure of confidence in the estimated value of trust. Considering the concept of confidence, results in more accurate estimation of trust. In this paper we introduce a computational framework for confidence-aware trust estimation, CATEF. In this framework, for an atomic trust opinion, the reliability of the opinion is estimated and considered as the confidence value. CATEF also suggests novel operators for aggregation and propagation of confidence-aware trust opinions. These operators take into account the number and consistency level of the aggregated opinions and the length of the propagation chain. The results of experiments carried out on the well-known dataset of Epinions, show that our approach increases the accuracy of trust inference comparing to the existing methods.
{"title":"CATEF: Confidence-aware trust estimation framework","authors":"H. Shakeri, A. G. Bafghi","doi":"10.1109/ISCISC.2013.6767328","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767328","url":null,"abstract":"In a trust management system, it is useful to have a measure of confidence in the estimated value of trust. Considering the concept of confidence, results in more accurate estimation of trust. In this paper we introduce a computational framework for confidence-aware trust estimation, CATEF. In this framework, for an atomic trust opinion, the reliability of the opinion is estimated and considered as the confidence value. CATEF also suggests novel operators for aggregation and propagation of confidence-aware trust opinions. These operators take into account the number and consistency level of the aggregated opinions and the length of the propagation chain. The results of experiments carried out on the well-known dataset of Epinions, show that our approach increases the accuracy of trust inference comparing to the existing methods.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123443738","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}
Universal Re-encryption Cryptosystems do not require the knowledge of the recipient's public key for re-encrypting a ciphertext whereas conventional Re-encryption Cryptosystems need that knowledge. In this paper, we present the first Identity-based Universal Re-encryption Cryptosystem scheme whose re-encryption algorithm does not need to have the knowledge of the recipient's identity. By generalizing the definition of Universal Semantic Security to Identity Based Universal Cryptosystems, we prove the security of our scheme. There are some applications for universal re-encryption cryptosystems which cannot be made using conventional cryptosystems. One significant application of these cryptosystems is in mix networks with several recipients, such as anonymous communication networks.
{"title":"Identity based universal re-encryption for mix nets","authors":"H. Yajam, J. Mohajeri, M. Salmasizadeh","doi":"10.1002/sec.1226","DOIUrl":"https://doi.org/10.1002/sec.1226","url":null,"abstract":"Universal Re-encryption Cryptosystems do not require the knowledge of the recipient's public key for re-encrypting a ciphertext whereas conventional Re-encryption Cryptosystems need that knowledge. In this paper, we present the first Identity-based Universal Re-encryption Cryptosystem scheme whose re-encryption algorithm does not need to have the knowledge of the recipient's identity. By generalizing the definition of Universal Semantic Security to Identity Based Universal Cryptosystems, we prove the security of our scheme. There are some applications for universal re-encryption cryptosystems which cannot be made using conventional cryptosystems. One significant application of these cryptosystems is in mix networks with several recipients, such as anonymous communication networks.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132866787","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}
Pub Date : 2013-08-01DOI: 10.1109/ISCISC.2013.6767346
A. Mohajer, Maryam Bavaghar, Rashin Saboor, A. Payandeh
Mobile ad-hoc networks (MANETs) face a number of challenges, in particular due to its dynamic network topology. A self organizing framework can overcome the problems associated with changing topology and dynamic behavior of mobile nodes thus routing has become a great challenge to these types of networks. Such a framework can be created by using connected dominating set (CDS). But the choice of misbehaving node as CDS will inversely affect the network performance. A misbehaving node may disturb the network by denying packet forwarding. In this paper we propose a new reputation based routing protocol using CDS (Connected Dominating Set). The proposed weight heuristic is applied to each node in network for selecting CDS based on uses the reputation value in order to selective forwarders detection. Reputation refers to the opinion of one node about another node. Hence only well behaving and good quality nodes are selected as a dominant node for CDS construction. Through simulation results proves that the proposed method performs well compared to MPR selection approach in OLSR.
{"title":"Secure dominating set-based routing protocol in MANET: Using reputation","authors":"A. Mohajer, Maryam Bavaghar, Rashin Saboor, A. Payandeh","doi":"10.1109/ISCISC.2013.6767346","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767346","url":null,"abstract":"Mobile ad-hoc networks (MANETs) face a number of challenges, in particular due to its dynamic network topology. A self organizing framework can overcome the problems associated with changing topology and dynamic behavior of mobile nodes thus routing has become a great challenge to these types of networks. Such a framework can be created by using connected dominating set (CDS). But the choice of misbehaving node as CDS will inversely affect the network performance. A misbehaving node may disturb the network by denying packet forwarding. In this paper we propose a new reputation based routing protocol using CDS (Connected Dominating Set). The proposed weight heuristic is applied to each node in network for selecting CDS based on uses the reputation value in order to selective forwarders detection. Reputation refers to the opinion of one node about another node. Hence only well behaving and good quality nodes are selected as a dominant node for CDS construction. Through simulation results proves that the proposed method performs well compared to MPR selection approach in OLSR.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129189929","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}
Pub Date : 2013-08-01DOI: 10.1109/ISCISC.2013.6767350
Taha Yasin Rezapour, M. S. Abolghasemi, Reza Ebrahimi Atani
Wireless sensor networks have many applications in the areas of commercial, military and environmental requirements. These networks face a lot of security challenges for reasons such as insecure communications and wireless communications. How to manage the cryptographic keys between sensor nodes deployed in the network in order to make maximum security with minimum cost as a basic approach in securing these networks has attracted attention of researchers. Therefore, in this paper by using the position of the sensor nodes as part of their identity, a novel method for key management in heterogeneous sensor networks have been proposed.
{"title":"A position-based key management scheme for heterogeneous sensor networks","authors":"Taha Yasin Rezapour, M. S. Abolghasemi, Reza Ebrahimi Atani","doi":"10.1109/ISCISC.2013.6767350","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767350","url":null,"abstract":"Wireless sensor networks have many applications in the areas of commercial, military and environmental requirements. These networks face a lot of security challenges for reasons such as insecure communications and wireless communications. How to manage the cryptographic keys between sensor nodes deployed in the network in order to make maximum security with minimum cost as a basic approach in securing these networks has attracted attention of researchers. Therefore, in this paper by using the position of the sensor nodes as part of their identity, a novel method for key management in heterogeneous sensor networks have been proposed.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115612780","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}
Pub Date : 2013-08-01DOI: 10.1109/ISCISC.2013.6767324
Sajad Pourmohseni, Hassan Asgharian, A. Akbari
Nowadays mainstream of evolution towards next generation networks extends SIP application as a simple and efficient protocol for management of multimedia communications. Simplicity of SIP increases security concerns for service providers about various kinds of misuse including Denial of Service (DoS) attacks. The target of DoS attacks in SIP can be bandwidth, memory or CPU. In this paper we proposed a user profile based anomaly detection method to identify CPU-based DOS attacks that misuse authentication mechanism of SIP. We validated and evaluated our proposed solution in real test-bed based on the well-known open-source tools. The simulation results report the effectiveness of our approach in detection of this specific type of attacks.
{"title":"Detecting authentication misuse attacks against SIP entities","authors":"Sajad Pourmohseni, Hassan Asgharian, A. Akbari","doi":"10.1109/ISCISC.2013.6767324","DOIUrl":"https://doi.org/10.1109/ISCISC.2013.6767324","url":null,"abstract":"Nowadays mainstream of evolution towards next generation networks extends SIP application as a simple and efficient protocol for management of multimedia communications. Simplicity of SIP increases security concerns for service providers about various kinds of misuse including Denial of Service (DoS) attacks. The target of DoS attacks in SIP can be bandwidth, memory or CPU. In this paper we proposed a user profile based anomaly detection method to identify CPU-based DOS attacks that misuse authentication mechanism of SIP. We validated and evaluated our proposed solution in real test-bed based on the well-known open-source tools. The simulation results report the effectiveness of our approach in detection of this specific type of attacks.","PeriodicalId":265985,"journal":{"name":"2013 10th International ISC Conference on Information Security and Cryptology (ISCISC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129920072","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：