Pub Date : 2010-08-01DOI: 10.4108/CHINACOM.2010.11
X. Yin, Junhe Zhou, Byung-Jae Kwak, H. Chung
In this contribution, we investigate the applicability of using multiple propagation paths to estimate the temporal auto-correlation function and the coherence time of wireless propagation channels. The Space-Alternating Generalized Expectation-maximization (SAGE) algorithm is applied for extracting the paths from measurement data. It is found that the channel auto-correlation function and coherence time computed based on the path parameters are biased. A simple method is proposed for correction of the biases. Experimental investigations are conducted to evaluate the effectiveness of the method.
{"title":"Estimation of channel temporal auto-correlation and coherence time based on propagation paths","authors":"X. Yin, Junhe Zhou, Byung-Jae Kwak, H. Chung","doi":"10.4108/CHINACOM.2010.11","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.11","url":null,"abstract":"In this contribution, we investigate the applicability of using multiple propagation paths to estimate the temporal auto-correlation function and the coherence time of wireless propagation channels. The Space-Alternating Generalized Expectation-maximization (SAGE) algorithm is applied for extracting the paths from measurement data. It is found that the channel auto-correlation function and coherence time computed based on the path parameters are biased. A simple method is proposed for correction of the biases. Experimental investigations are conducted to evaluate the effectiveness of the method.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"151 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115186198","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.140
Yinglei Teng, Mei Song, Yong Zhang, Yuanyuan Liu, Junde Song
The two user cooperative transmission context coincides with symmetric feature of network coding (NC), which makes it possible to perform distributed random coding, thus exploring both the cooperative diversity and the network coding diversity. In this paper, we provide performance analysis of network coding based two-user cooperation under an OFDMA based orthogonal physical layer channel, in terms of the channel capacity and outage probability. Expressions for exact capacity are devised and closed form of outage probability with lower bound is presented. Compared with the conventional user cooperation transmission, the NC_based two-user cooperation brings 11.8% higher capacity and 50% lower outage probability.
{"title":"Capacity and outage probability analysis of network coding based user cooperation transmission","authors":"Yinglei Teng, Mei Song, Yong Zhang, Yuanyuan Liu, Junde Song","doi":"10.4108/CHINACOM.2010.140","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.140","url":null,"abstract":"The two user cooperative transmission context coincides with symmetric feature of network coding (NC), which makes it possible to perform distributed random coding, thus exploring both the cooperative diversity and the network coding diversity. In this paper, we provide performance analysis of network coding based two-user cooperation under an OFDMA based orthogonal physical layer channel, in terms of the channel capacity and outage probability. Expressions for exact capacity are devised and closed form of outage probability with lower bound is presented. Compared with the conventional user cooperation transmission, the NC_based two-user cooperation brings 11.8% higher capacity and 50% lower outage probability.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114575676","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}
In this paper, we sought to understand the reasons causing failures and delays of message delivery in Delay Tolerant Networks (DTN), and to use this understanding for improving the network. By studying two real-world datasets, we found that node isolation is prevalent, which largely accounts for the inefficiencies in DTN's message delivery. In addition, by analyzing nodes' contact-location relationship, we found that individual and system-wide key locations exist and their existence suggests potential improvements. Motivated by our observations, we designed a location aware routing scheme for DTN networks. With simulation-based experiments, we compared our proposal with other representative DTN routing schemes, and showed that with the awareness of the location information, our solution can deliver more messages within shorter delays, therefore improves the network intensively.
{"title":"Location-aware routing for Delay Tolerant Networks","authors":"Ye Tian, Jiang Li","doi":"10.4108/CHINACOM.2010.4","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.4","url":null,"abstract":"In this paper, we sought to understand the reasons causing failures and delays of message delivery in Delay Tolerant Networks (DTN), and to use this understanding for improving the network. By studying two real-world datasets, we found that node isolation is prevalent, which largely accounts for the inefficiencies in DTN's message delivery. In addition, by analyzing nodes' contact-location relationship, we found that individual and system-wide key locations exist and their existence suggests potential improvements. Motivated by our observations, we designed a location aware routing scheme for DTN networks. With simulation-based experiments, we compared our proposal with other representative DTN routing schemes, and showed that with the awareness of the location information, our solution can deliver more messages within shorter delays, therefore improves the network intensively.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129572658","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.35
Chuan Liu, Xiang Chen, Xiujun Zhang, Ming Zhao, Shidong Zhou, Jing Wang
Software Radio (SR) is an emerging paradigm of the wireless communication system design due to its flexibility and adaptability. However, the implementation of SR platform is always challenging, especially for high date rate transmission such as up to 1Gbps. Although general-purpose processor(GPP) based SR platform can take full advantages of Software Radio, the performance is often limited due to the lack of real-time processing capacity for high-throughput radio systems, especially for high-throughput channel decoding. Therefore, hardware accelerating units(HAU) are usually also involved in the SR platform, such as field programmable gate arrays(FPGAs) and embedded digital signal processors(DSPs). As HAUs and GPPs have their own advantages for different applications in SR, the scalability of interface is a bottleneck in the implementation of SR platform. In this paper, a Gigabit Ethernet(GE) switch based programmable platform for Gbps wireless communications is presented. By means of the good scalability and flexibility of GE interface, the new structure based on GE data-switch combines the real-time computing performance of HAUs with the adaptability and programmability of GPPs, which can provide a radio platform with great scalability for the development of future wireless communication technologies. As a demonstration, a MIMO-OFDM radio system has been designed and implemented on this platform, which can achieve a throughput up to 1Gbps.
{"title":"A gigabit ethternet switch based Software Radio platform for Gbps wireless communications","authors":"Chuan Liu, Xiang Chen, Xiujun Zhang, Ming Zhao, Shidong Zhou, Jing Wang","doi":"10.4108/CHINACOM.2010.35","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.35","url":null,"abstract":"Software Radio (SR) is an emerging paradigm of the wireless communication system design due to its flexibility and adaptability. However, the implementation of SR platform is always challenging, especially for high date rate transmission such as up to 1Gbps. Although general-purpose processor(GPP) based SR platform can take full advantages of Software Radio, the performance is often limited due to the lack of real-time processing capacity for high-throughput radio systems, especially for high-throughput channel decoding. Therefore, hardware accelerating units(HAU) are usually also involved in the SR platform, such as field programmable gate arrays(FPGAs) and embedded digital signal processors(DSPs). As HAUs and GPPs have their own advantages for different applications in SR, the scalability of interface is a bottleneck in the implementation of SR platform. In this paper, a Gigabit Ethernet(GE) switch based programmable platform for Gbps wireless communications is presented. By means of the good scalability and flexibility of GE interface, the new structure based on GE data-switch combines the real-time computing performance of HAUs with the adaptability and programmability of GPPs, which can provide a radio platform with great scalability for the development of future wireless communication technologies. As a demonstration, a MIMO-OFDM radio system has been designed and implemented on this platform, which can achieve a throughput up to 1Gbps.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128748017","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.126
Xianbin Wang, Hao Li, S. Primak, Viet-Ha Pham
Due to the widespread deployment of OFDM and recent advent of cognitive radio communications, robust and simple spectrum sensing techniques for OFDM signals receive significant research interest. In this paper, a time domain pilot correlation (TDPC) technique, which overcomes the complexity of FFT-based pilot sensing methods, is proposed. The TDPC technique provides an efficient and simple spectrum sensing scheme for OFDM signals using frequency domain in-band pilots. The proposed technique is based on the cyclic correlation between the complex conjugate product of adjacent OFDM signal segments and two orthogonal local references deriving from the time domain pilot sequence. Interference mitigation techniques, including periodic segmentation of the received OFDM signal, complex conjugate multiplication-based phase rotation locking, and magnitude-based correlation ratio, are adopted in this algorithm to improve the sensing performance. It is validated by simulations that the TDPC scheme achieves satisfactory sensing reliability at low SNR and is robust to both timing and frequency offsets.
{"title":"A low complexity time domain spectrum sensing technique for OFDM","authors":"Xianbin Wang, Hao Li, S. Primak, Viet-Ha Pham","doi":"10.4108/CHINACOM.2010.126","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.126","url":null,"abstract":"Due to the widespread deployment of OFDM and recent advent of cognitive radio communications, robust and simple spectrum sensing techniques for OFDM signals receive significant research interest. In this paper, a time domain pilot correlation (TDPC) technique, which overcomes the complexity of FFT-based pilot sensing methods, is proposed. The TDPC technique provides an efficient and simple spectrum sensing scheme for OFDM signals using frequency domain in-band pilots. The proposed technique is based on the cyclic correlation between the complex conjugate product of adjacent OFDM signal segments and two orthogonal local references deriving from the time domain pilot sequence. Interference mitigation techniques, including periodic segmentation of the received OFDM signal, complex conjugate multiplication-based phase rotation locking, and magnitude-based correlation ratio, are adopted in this algorithm to improve the sensing performance. It is validated by simulations that the TDPC scheme achieves satisfactory sensing reliability at low SNR and is robust to both timing and frequency offsets.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128246504","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}
This paper focuses on one vital aspect in propagation characteristics inside subway tunnels: near shadowing phenomenon in a practical environment. In order to characterize this effect, an accurate measurement has been made at 2.4 GHz in a real environment in Madrid subway. By analyzing the numerical results in this measurement, the characteristic of near shadowing phenomenon in propagation process has been revealed and corresponding engineering suggestions have been given in order to compensate the near shadowing effect. Finally, statistical model including the depth, duration and length of near shadowing, fast fading and attenuation inside wide tunnel and narrow tunnel has been built and simulated.
{"title":"Measurement and modeling of subway near shadowing phenomenon","authors":"K. Guan, Z. Zhong, B. Ai, C. Briso-Rodríguez","doi":"10.4108/IWONCMM.2010.6","DOIUrl":"https://doi.org/10.4108/IWONCMM.2010.6","url":null,"abstract":"This paper focuses on one vital aspect in propagation characteristics inside subway tunnels: near shadowing phenomenon in a practical environment. In order to characterize this effect, an accurate measurement has been made at 2.4 GHz in a real environment in Madrid subway. By analyzing the numerical results in this measurement, the characteristic of near shadowing phenomenon in propagation process has been revealed and corresponding engineering suggestions have been given in order to compensate the near shadowing effect. Finally, statistical model including the depth, duration and length of near shadowing, fast fading and attenuation inside wide tunnel and narrow tunnel has been built and simulated.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"15 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130602824","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.112
Shengli Zhang, S. Liew, Lu Lu, Hui Wang
This paper studies the interference reduction, which is one the most important issue to increase the network throughput, improve the energy efficiency (green communication) and so on. In doing so, we first induce the system model consisting of one interfering node, based on several network examples. After that, the impact of time asynchrony between the interfering signal and the target signal is investigated. Interestingly, we show that the interference asynchrony can actually improve the BER performance, compared with the situation in which symbols of all signals are aligned. In particular, it is shown that symbol misalignment can decrease the “effective interference power” and change the distribution of the interfering signals, in a way that results in lower BER (or higher SINR equivalently). To ensure that symbol misalignment can be consistently attained, we propose a simple scheme that introduces time-varying symbol offsets to obtain an “average” performance of random symbol misalignment. Notably, our schemes do not change the simple receiver design structure; only the transmitters are modified in a minor way.
{"title":"Suppress interference by symbol-misalignment","authors":"Shengli Zhang, S. Liew, Lu Lu, Hui Wang","doi":"10.4108/CHINACOM.2010.112","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.112","url":null,"abstract":"This paper studies the interference reduction, which is one the most important issue to increase the network throughput, improve the energy efficiency (green communication) and so on. In doing so, we first induce the system model consisting of one interfering node, based on several network examples. After that, the impact of time asynchrony between the interfering signal and the target signal is investigated. Interestingly, we show that the interference asynchrony can actually improve the BER performance, compared with the situation in which symbols of all signals are aligned. In particular, it is shown that symbol misalignment can decrease the “effective interference power” and change the distribution of the interfering signals, in a way that results in lower BER (or higher SINR equivalently). To ensure that symbol misalignment can be consistently attained, we propose a simple scheme that introduces time-varying symbol offsets to obtain an “average” performance of random symbol misalignment. Notably, our schemes do not change the simple receiver design structure; only the transmitters are modified in a minor way.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123968391","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}
Zhiwen Wu, Jian-hua Zhang, Xin Nie, Chengxiang Huang
This paper presents a multiple-input multiple-output (MIMO) relay channel model based on the International Telecommunication Union (ITU) generic channel model for the test evaluation of radio interface technologies (RITs). Each link is modeled by the conventional point-to-point channel model with specific parameter set. A MIMO relay measurement in a typical urban micro-cell environment at 2.35GHz with bandwidth up to 50MHz was performed, and the collected data are compared with the derived model. Capacity values in amplify-and-forward (AF) and decode-and-forward (DF) relay modes are selected to be the comparing metrics. Furthermore, another relay channel model with channel characteristics following Rayleigh or Rice distribution is provided as a baseline for comparison. It turns out that the proposed ITU generic channel model shows good comparison to the measurement data in this specific environment, for the capacity of modeled channel is quite similar to that of the measurement channel in both AF and DF modes.
{"title":"A novel relay channel modeling method with validation of micro-cell MIMO relay measurement results at 2.35GHz","authors":"Zhiwen Wu, Jian-hua Zhang, Xin Nie, Chengxiang Huang","doi":"10.4108/IWONCMM.2010.1","DOIUrl":"https://doi.org/10.4108/IWONCMM.2010.1","url":null,"abstract":"This paper presents a multiple-input multiple-output (MIMO) relay channel model based on the International Telecommunication Union (ITU) generic channel model for the test evaluation of radio interface technologies (RITs). Each link is modeled by the conventional point-to-point channel model with specific parameter set. A MIMO relay measurement in a typical urban micro-cell environment at 2.35GHz with bandwidth up to 50MHz was performed, and the collected data are compared with the derived model. Capacity values in amplify-and-forward (AF) and decode-and-forward (DF) relay modes are selected to be the comparing metrics. Furthermore, another relay channel model with channel characteristics following Rayleigh or Rice distribution is provided as a baseline for comparison. It turns out that the proposed ITU generic channel model shows good comparison to the measurement data in this specific environment, for the capacity of modeled channel is quite similar to that of the measurement channel in both AF and DF modes.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126298611","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.18
Kai Sun, W. Huang, Yong Tie, Yong Zhang
A cross-layer resource allocation and scheduling scheme in the downlink of MIMO-OFDMA systems is proposed to provide quality of service (QoS) guarantees to real-time traffics and non-real-time traffics in case of heavy-traffic. The proposed algorithm aims to maximize the efficient system throughput with the constraints of packet error rate, delay, packets dropping rate and buffer size. At the medium access control (MAC) layer, the proposed algorithm dynamically assigns subcarriers to the highest priority user based on the channel state information (CSI) and the queue state information (QSI). After initial subcarrier assignment, the subcarrier re-assignment is applied to approve the system performance. At the physical (PHY) layer, a low complexity rate-and-power adaptation scheme is used to the predetermined subcarriers. It is demonstrated in the numerical results that the proposed algorithm significantly improves the system performance in terms of system throughput and packet loss rate.
{"title":"Resource allocation and scheduling in MIMO-OFDMA with time-varying channel and bursty arrivals","authors":"Kai Sun, W. Huang, Yong Tie, Yong Zhang","doi":"10.4108/CHINACOM.2010.18","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.18","url":null,"abstract":"A cross-layer resource allocation and scheduling scheme in the downlink of MIMO-OFDMA systems is proposed to provide quality of service (QoS) guarantees to real-time traffics and non-real-time traffics in case of heavy-traffic. The proposed algorithm aims to maximize the efficient system throughput with the constraints of packet error rate, delay, packets dropping rate and buffer size. At the medium access control (MAC) layer, the proposed algorithm dynamically assigns subcarriers to the highest priority user based on the channel state information (CSI) and the queue state information (QSI). After initial subcarrier assignment, the subcarrier re-assignment is applied to approve the system performance. At the physical (PHY) layer, a low complexity rate-and-power adaptation scheme is used to the predetermined subcarriers. It is demonstrated in the numerical results that the proposed algorithm significantly improves the system performance in terms of system throughput and packet loss rate.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125642405","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 : 2010-08-01DOI: 10.4108/CHINACOM.2010.138
F. Bao
Digital signature is very critical and useful for achieving security features such as authentication, certification, integrity and non-repudiation etc. In digital signature schemes, private keys play the most fundamental role of security and trust. Once a private key is compromised, the key owner loses all of the protection to himself so that he can be impersonated. Hence it is crucial for a private key owner to know whether his key has been stolen. The first study toward detecting private key disclosure is [4], where the schemes based on the time-division and private key updating are presented. The approach is similar to the forward-secure signature in the key-update style. In this paper we propose a completely different approach for a user to detect whether his private key for signing digital signatures is compromised. The solution satisfies the four attractive properties: 1) the user need not possess another cryptographic key and what he has are his private key and a memorable password; 2) the signature schemes are not in the update of the private key in time-divided manner and our method can be applied to the existing signature schemes; 3) although a trusted party (TP) is required in our method, the user and the TP need not share any secret; and 4) the user is stateless, i.e., he does not need to record all the messages and the signatures he has signed before.
{"title":"A generic method of detecting private key disclosure in digital signature schemes","authors":"F. Bao","doi":"10.4108/CHINACOM.2010.138","DOIUrl":"https://doi.org/10.4108/CHINACOM.2010.138","url":null,"abstract":"Digital signature is very critical and useful for achieving security features such as authentication, certification, integrity and non-repudiation etc. In digital signature schemes, private keys play the most fundamental role of security and trust. Once a private key is compromised, the key owner loses all of the protection to himself so that he can be impersonated. Hence it is crucial for a private key owner to know whether his key has been stolen. The first study toward detecting private key disclosure is [4], where the schemes based on the time-division and private key updating are presented. The approach is similar to the forward-secure signature in the key-update style. In this paper we propose a completely different approach for a user to detect whether his private key for signing digital signatures is compromised. The solution satisfies the four attractive properties: 1) the user need not possess another cryptographic key and what he has are his private key and a memorable password; 2) the signature schemes are not in the update of the private key in time-divided manner and our method can be applied to the existing signature schemes; 3) although a trusted party (TP) is required in our method, the user and the TP need not share any secret; and 4) the user is stateless, i.e., he does not need to record all the messages and the signatures he has signed before.","PeriodicalId":422191,"journal":{"name":"2010 5th International ICST Conference on Communications and Networking in China","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125705243","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
扫码关注我们
求助内容：
应助结果提醒方式：