Pub Date : 2013-07-29DOI: 10.5220/0004613006150621
H. Noura, Steven Martin, K. A. Agha
Sensor networks are widely used in various areas and applications, and the need for effective security systems is increasingly essential. But most security systems are based on complex algorithms that require a high complexity and energy consumption, thus have undesirable consequences. To reduce them, a new security system called E3SN is defined. It is based on an invertible and flexible key dependent matrix to mix the contents of the packets. Our proposal can achieve simultaneously the information's confidentiality, packet's integrity and source's authentication, with a minimum of computational complexity, communication overhead and memory consumption. This matrix is secret and only the transmitter and receiver can produce it in counter mode. We evaluate our system by comparing E3SN to AES algorithm, considered reliable and robust in several standards of sensor networks such as ZigBee, WirelessHART and ISA100.11a. The results show that the proposed technique is much more efficient than AES, with the same quality of cryptography.
{"title":"E3SN: Efficient security scheme for sensor networks","authors":"H. Noura, Steven Martin, K. A. Agha","doi":"10.5220/0004613006150621","DOIUrl":"https://doi.org/10.5220/0004613006150621","url":null,"abstract":"Sensor networks are widely used in various areas and applications, and the need for effective security systems is increasingly essential. But most security systems are based on complex algorithms that require a high complexity and energy consumption, thus have undesirable consequences. To reduce them, a new security system called E3SN is defined. It is based on an invertible and flexible key dependent matrix to mix the contents of the packets. Our proposal can achieve simultaneously the information's confidentiality, packet's integrity and source's authentication, with a minimum of computational complexity, communication overhead and memory consumption. This matrix is secret and only the transmitter and receiver can produce it in counter mode. We evaluate our system by comparing E3SN to AES algorithm, considered reliable and robust in several standards of sensor networks such as ZigBee, WirelessHART and ISA100.11a. The results show that the proposed technique is much more efficient than AES, with the same quality of cryptography.","PeriodicalId":174026,"journal":{"name":"2013 International Conference on Security and Cryptography (SECRYPT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130915150","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-07-29DOI: 10.5220/0004526405240530
L. Hanzlik, W. Wodo
The most valuable element of biometric security systems are the personal features of its users. Characteristics of individuals are unique and must be protected. We focus in this paper on methods of protection of user identity in systems based on keystroking. Our approach assumes giving minimal information to adversaries and the best responsiveness of the system regardless of user representation or possible usage. We consider keystroking not only in the context of keyboard, but also touch screen, pin pad and any other input device that could be used for typing. We present as results several complete security solutions that are applicable for software as well as hardware systems.
{"title":"Identity security in biometric systems based on keystroking","authors":"L. Hanzlik, W. Wodo","doi":"10.5220/0004526405240530","DOIUrl":"https://doi.org/10.5220/0004526405240530","url":null,"abstract":"The most valuable element of biometric security systems are the personal features of its users. Characteristics of individuals are unique and must be protected. We focus in this paper on methods of protection of user identity in systems based on keystroking. Our approach assumes giving minimal information to adversaries and the best responsiveness of the system regardless of user representation or possible usage. We consider keystroking not only in the context of keyboard, but also touch screen, pin pad and any other input device that could be used for typing. We present as results several complete security solutions that are applicable for software as well as hardware systems.","PeriodicalId":174026,"journal":{"name":"2013 International Conference on Security and Cryptography (SECRYPT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124203101","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-07-29DOI: 10.5220/0004529103790386
Clémentine Maurice, Stéphane Onno, C. Neumann, Olivier Heen, Aurélien Francillon
Fingerprinting 802.11 devices has been proposed to identify devices in order to mitigate IEEE 802.11 weaknesses. However, important limitations prevent any real deployment. On the first hand, fingerprinting has a low accuracy when the devices have similar hardware and software. On the second hand, attackers may forge signatures to impersonate devices. We propose Diversity, a cooperative fingerprinting approach that improves accuracy of existing fingerprinting methods while relying only on off-the-shelf hardware. Diversity improves fingerprinting up to the reliable individual identification of identical 802.11 devices. This approach modifies the signature of devices by modifying slightly their traffic attributes. We evaluate Diversity with both a simulation and an implementation, achieving a false positive rate of 0% with a dataset including identical devices. Finally, we complement Diversity by mechanisms for detecting attackers that try to forge signatures.
{"title":"Improving 802.11 fingerprinting of similar devices by cooperative fingerprinting","authors":"Clémentine Maurice, Stéphane Onno, C. Neumann, Olivier Heen, Aurélien Francillon","doi":"10.5220/0004529103790386","DOIUrl":"https://doi.org/10.5220/0004529103790386","url":null,"abstract":"Fingerprinting 802.11 devices has been proposed to identify devices in order to mitigate IEEE 802.11 weaknesses. However, important limitations prevent any real deployment. On the first hand, fingerprinting has a low accuracy when the devices have similar hardware and software. On the second hand, attackers may forge signatures to impersonate devices. We propose Diversity, a cooperative fingerprinting approach that improves accuracy of existing fingerprinting methods while relying only on off-the-shelf hardware. Diversity improves fingerprinting up to the reliable individual identification of identical 802.11 devices. This approach modifies the signature of devices by modifying slightly their traffic attributes. We evaluate Diversity with both a simulation and an implementation, achieving a false positive rate of 0% with a dataset including identical devices. Finally, we complement Diversity by mechanisms for detecting attackers that try to forge signatures.","PeriodicalId":174026,"journal":{"name":"2013 International Conference on Security and Cryptography (SECRYPT)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131897009","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-07-29DOI: 10.5220/0004610205860594
Hasan Kadhem
This paper presents a novel authentication scheme called MINHO, which protects users from unauthorized access even when their passwords have been stolen. At the same time, MINHO detects any tries for unauthorized access by attackers. Our idea is to use a mobile phone to send a request with specific parameters to the service provider before the actual authentication process, then, the service provider verifies the pre-authentication parameters during the authentication process. We propose many parameters that can be used with the pre-authentication service such as Authentication Ticket (AT), time, and location. MINHO is a practical scheme that can be used with the current systems, without (hardware/software) changes on the terminal side. It is a cost effective scheme, easy to use, and does not rely on a third party.
{"title":"MINHO: A novel authentication scheme based on pre-authentication service","authors":"Hasan Kadhem","doi":"10.5220/0004610205860594","DOIUrl":"https://doi.org/10.5220/0004610205860594","url":null,"abstract":"This paper presents a novel authentication scheme called MINHO, which protects users from unauthorized access even when their passwords have been stolen. At the same time, MINHO detects any tries for unauthorized access by attackers. Our idea is to use a mobile phone to send a request with specific parameters to the service provider before the actual authentication process, then, the service provider verifies the pre-authentication parameters during the authentication process. We propose many parameters that can be used with the pre-authentication service such as Authentication Ticket (AT), time, and location. MINHO is a practical scheme that can be used with the current systems, without (hardware/software) changes on the terminal side. It is a cost effective scheme, easy to use, and does not rely on a third party.","PeriodicalId":174026,"journal":{"name":"2013 International Conference on Security and Cryptography (SECRYPT)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121076211","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-07-29DOI: 10.5220/0004600205610567
H. Chabanne, G. Cohen, Alain Patey
At STOC 2010, Applebaum, Barak and Wigderson introduced three new public-key cryptosystems based on combinatorial assumptions. In their paper, only encryption of bits has been considered. In this paper, we focus on one of their schemes and adapt it to encrypt a constant number of bits in a single ciphertext without changing the size of the public key. We add wire-tap channel techniques to improve the security level of our scheme, thus reaching indistinguishability. We show that it is homomorphic for the XOR operation on bit strings. We also suggest concrete parameters for a first instantiation of our scheme.
{"title":"Public-key cryptography from different assumptions: A multi-bit version","authors":"H. Chabanne, G. Cohen, Alain Patey","doi":"10.5220/0004600205610567","DOIUrl":"https://doi.org/10.5220/0004600205610567","url":null,"abstract":"At STOC 2010, Applebaum, Barak and Wigderson introduced three new public-key cryptosystems based on combinatorial assumptions. In their paper, only encryption of bits has been considered. In this paper, we focus on one of their schemes and adapt it to encrypt a constant number of bits in a single ciphertext without changing the size of the public key. We add wire-tap channel techniques to improve the security level of our scheme, thus reaching indistinguishability. We show that it is homomorphic for the XOR operation on bit strings. We also suggest concrete parameters for a first instantiation of our scheme.","PeriodicalId":174026,"journal":{"name":"2013 International Conference on Security and Cryptography (SECRYPT)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117202384","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-07-29DOI: 10.5220/0004606105800585
Matthias Trojahn, Christian Schadewald, F. Ortmeier
This study investigates keystroke dynamics as biometric authentication on different smartphones. We analysed different sensors in the smartphones which affect the error rates of the authentication. We also evaluate the effectiveness of different features based on the error rates. In addition, a framework is presented for using one device as a base model to authenticate the same person on other devices. We conduct with an experiment with three devices and three different keywords to assess how well different devices can be used (error rates smaller than 3.5 %) and suitable combinations of devices. Moreover, our experiment results showed that passwords spread over the whole keyboard have lower error rates.
{"title":"Keystroke authentication with a capacitive display using different mobile devices","authors":"Matthias Trojahn, Christian Schadewald, F. Ortmeier","doi":"10.5220/0004606105800585","DOIUrl":"https://doi.org/10.5220/0004606105800585","url":null,"abstract":"This study investigates keystroke dynamics as biometric authentication on different smartphones. We analysed different sensors in the smartphones which affect the error rates of the authentication. We also evaluate the effectiveness of different features based on the error rates. In addition, a framework is presented for using one device as a base model to authenticate the same person on other devices. We conduct with an experiment with three devices and three different keywords to assess how well different devices can be used (error rates smaller than 3.5 %) and suitable combinations of devices. Moreover, our experiment results showed that passwords spread over the whole keyboard have lower error rates.","PeriodicalId":174026,"journal":{"name":"2013 International Conference on Security and Cryptography (SECRYPT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129065469","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-07-29DOI: 10.5220/0004521101110122
Yu Sasaki, Wataru Komatsubara, Yasuhide Sakai, Lei Wang, Mitsugu Iwamoto, K. Sakiyama, K. Ohta
In this paper, we revisit previous meet-in-the-middle preimage attacks on hash functions. We firstly present a technical improvement for the existing local-collision and initial-structure techniques. With applying some equivalent transformation, we can significantly reduce the memory requirement from the original proposals. We then revisit the previous preimage attacks on MD5 and HAVAL with recent techniques. Consequently, we can improve the memory complexity of the previous preimage attack on full MD5 from 245 to 213 and on full 4-pass HAVAL from 264 to 232. Moreover, we extend the preimage attack on 5-pass HAVAL from 151 steps to 158 steps, and present the first preimage attack with a single block message for 3-pass HAVAL.
{"title":"Meet-in-the-middle preimage attacks revisited new results on MD5 and HAVAL","authors":"Yu Sasaki, Wataru Komatsubara, Yasuhide Sakai, Lei Wang, Mitsugu Iwamoto, K. Sakiyama, K. Ohta","doi":"10.5220/0004521101110122","DOIUrl":"https://doi.org/10.5220/0004521101110122","url":null,"abstract":"In this paper, we revisit previous meet-in-the-middle preimage attacks on hash functions. We firstly present a technical improvement for the existing local-collision and initial-structure techniques. With applying some equivalent transformation, we can significantly reduce the memory requirement from the original proposals. We then revisit the previous preimage attacks on MD5 and HAVAL with recent techniques. Consequently, we can improve the memory complexity of the previous preimage attack on full MD5 from 245 to 213 and on full 4-pass HAVAL from 264 to 232. Moreover, we extend the preimage attack on 5-pass HAVAL from 151 steps to 158 steps, and present the first preimage attack with a single block message for 3-pass HAVAL.","PeriodicalId":174026,"journal":{"name":"2013 International Conference on Security and Cryptography (SECRYPT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128171362","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-07-29DOI: 10.5220/0004528105310536
Vinay S. Iyengar
Galois fields of characteristic 3, where the number of field elements is a power of 3, have a distinctive application in building high-security elliptic curve cryptosystems. However, they are not typically used because of their relative inefficiency in computing polynomial operations when compared to conventional prime or binary Galois fields. The purpose of this research was to design and implement characteristic 3 Galois field arithmetic algorithms with greater overall efficiency than those presented in current literature, and to evaluate their applicability to elliptic curve cryptography. The algorithms designed were tested in a C++ program and using a mapping of field element logarithms, were able to simplify the operations of polynomial multiplication, division, cubing, and modular reduction to that of basic integer operations. They thus significantly outperformed the best characteristic 3 algorithms presented in literature and showed a distinct applicability to elliptic curve cryptosystems. In conclusion, this research presents a novel method of optimizing the performance of characteristic 3 Galois fields and has major implications for the field of elliptic curve cryptography.
{"title":"Efficient characteristic 3 Galois field operations for elliptic curve cryptographic applications","authors":"Vinay S. Iyengar","doi":"10.5220/0004528105310536","DOIUrl":"https://doi.org/10.5220/0004528105310536","url":null,"abstract":"Galois fields of characteristic 3, where the number of field elements is a power of 3, have a distinctive application in building high-security elliptic curve cryptosystems. However, they are not typically used because of their relative inefficiency in computing polynomial operations when compared to conventional prime or binary Galois fields. The purpose of this research was to design and implement characteristic 3 Galois field arithmetic algorithms with greater overall efficiency than those presented in current literature, and to evaluate their applicability to elliptic curve cryptography. The algorithms designed were tested in a C++ program and using a mapping of field element logarithms, were able to simplify the operations of polynomial multiplication, division, cubing, and modular reduction to that of basic integer operations. They thus significantly outperformed the best characteristic 3 algorithms presented in literature and showed a distinct applicability to elliptic curve cryptosystems. In conclusion, this research presents a novel method of optimizing the performance of characteristic 3 Galois fields and has major implications for the field of elliptic curve cryptography.","PeriodicalId":174026,"journal":{"name":"2013 International Conference on Security and Cryptography (SECRYPT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130062052","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-07-29DOI: 10.5220/0004515100860097
S. Schindler, Bettina Schnor, Simon Kiertscher, T. Scheffler, Eldad Zack
This paper starts with the presentation of results from an IPv6-darknet experiment that we conducted during summer 2012. The experiment indicates that attackers are gaining interest in IPv6 networks and appropriate security tools need to be readied. Therefore, we propose HoneydV6, a low-interaction IPv6 honeypot that can simulate entire IPv6 networks and which may be utilized to detect and analyze IPv6 network attacks. Our implementation extends the well-known low-interaction honeypot Honeyd. To the best of our knowledge, this is the first low-interaction honeypot which is able to simulate entire IPv6 networks on a single host. The huge IPv6 address spaces requires new approaches and concepts in order to enable attackers to find and exploit a honeypot. We increase the chance for an attacker to find a target host in our IPv6 honeypot by reacting to the attacker's requests with the dynamic generation of new IPv6 host instances in the honeynet.
{"title":"HoneydV6: A low-interaction IPv6 honeypot","authors":"S. Schindler, Bettina Schnor, Simon Kiertscher, T. Scheffler, Eldad Zack","doi":"10.5220/0004515100860097","DOIUrl":"https://doi.org/10.5220/0004515100860097","url":null,"abstract":"This paper starts with the presentation of results from an IPv6-darknet experiment that we conducted during summer 2012. The experiment indicates that attackers are gaining interest in IPv6 networks and appropriate security tools need to be readied. Therefore, we propose HoneydV6, a low-interaction IPv6 honeypot that can simulate entire IPv6 networks and which may be utilized to detect and analyze IPv6 network attacks. Our implementation extends the well-known low-interaction honeypot Honeyd. To the best of our knowledge, this is the first low-interaction honeypot which is able to simulate entire IPv6 networks on a single host. The huge IPv6 address spaces requires new approaches and concepts in order to enable attackers to find and exploit a honeypot. We increase the chance for an attacker to find a target host in our IPv6 honeypot by reacting to the attacker's requests with the dynamic generation of new IPv6 host instances in the honeynet.","PeriodicalId":174026,"journal":{"name":"2013 International Conference on Security and Cryptography (SECRYPT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134444596","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-07-29DOI: 10.5220/0004516500980110
Miltiadis Kandias, L. Mitrou, V. Stavrou, D. Gritzalis
Social media and Web 2.0 have enabled internet users to contribute online content, which may be crawled and utilized for a variety of reasons, from personalized advertising to behaviour prediction/profiling. One negative case scenario is the political affiliation profiling. Our hypothesis is that this scenario is nowadays realistic, applicable to social media, and violates civil rights, privacy and freedom. To demonstrate this, we developed a horror story, i.e., a Panopticon method, in order to reveal this threat and contribute in raising the social awareness over it. The Panopticon relies on data/opinion mining techniques; hence it classifies comments, videos and playlists, collected from the popular social medium YouTube. Afterwards, it aggregates these classifications in order to decide over the users' political affiliation. The experimental test case of the Panopticon is an extensive Greek community of YouTube users. In order to demonstrate our case, we performed an extensive graph theoretical and content analysis of the collected dataset and show how and what kind of personal data (e.g. political attitude) can be derived via data mining on publicly available YouTube data. Then, we provide the reader with an analysis of the legal means that are available today, to a citizen or a society as a whole, so as to effectively be prevented from such a threat.
{"title":"Which side are you on? A new Panopticon vs. privacy","authors":"Miltiadis Kandias, L. Mitrou, V. Stavrou, D. Gritzalis","doi":"10.5220/0004516500980110","DOIUrl":"https://doi.org/10.5220/0004516500980110","url":null,"abstract":"Social media and Web 2.0 have enabled internet users to contribute online content, which may be crawled and utilized for a variety of reasons, from personalized advertising to behaviour prediction/profiling. One negative case scenario is the political affiliation profiling. Our hypothesis is that this scenario is nowadays realistic, applicable to social media, and violates civil rights, privacy and freedom. To demonstrate this, we developed a horror story, i.e., a Panopticon method, in order to reveal this threat and contribute in raising the social awareness over it. The Panopticon relies on data/opinion mining techniques; hence it classifies comments, videos and playlists, collected from the popular social medium YouTube. Afterwards, it aggregates these classifications in order to decide over the users' political affiliation. The experimental test case of the Panopticon is an extensive Greek community of YouTube users. In order to demonstrate our case, we performed an extensive graph theoretical and content analysis of the collected dataset and show how and what kind of personal data (e.g. political attitude) can be derived via data mining on publicly available YouTube data. Then, we provide the reader with an analysis of the legal means that are available today, to a citizen or a society as a whole, so as to effectively be prevented from such a threat.","PeriodicalId":174026,"journal":{"name":"2013 International Conference on Security and Cryptography (SECRYPT)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133338403","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
扫码关注我们
求助内容：
应助结果提醒方式：