Pub Date : 2005-05-22DOI: 10.1109/EIT.2005.1627030
Chi-Chao Chang, T. Hwang
As the Internet becomes omnipresent, people nowadays depend heavily on the on-line services for their shopping and banking transactions. However, users register for on-line services may not like their activities being logged and analyzed by the service providers. Anonymity is essential in the protection of users' privacy, especially now when the Internet is a treacherous place full of embezzlers trying to collect information of others. In 2001, Rivest et al. introduced and formalized the ring signature in which the verifier is convinced that the message must be signed by one of the ring members but is unable to determine which one. Ring signature is very useful for proving membership anonymously. With a ring signature scheme, a paid customer can prove his membership by involving other legitimate users' identity without help from the manager. In this paper, we propose a ring signature scheme based on the El Gamal digital signature scheme that is provably secure against adaptively chosen ciphertext attack
{"title":"Anonymous proof of membership with ring signature","authors":"Chi-Chao Chang, T. Hwang","doi":"10.1109/EIT.2005.1627030","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627030","url":null,"abstract":"As the Internet becomes omnipresent, people nowadays depend heavily on the on-line services for their shopping and banking transactions. However, users register for on-line services may not like their activities being logged and analyzed by the service providers. Anonymity is essential in the protection of users' privacy, especially now when the Internet is a treacherous place full of embezzlers trying to collect information of others. In 2001, Rivest et al. introduced and formalized the ring signature in which the verifier is convinced that the message must be signed by one of the ring members but is unable to determine which one. Ring signature is very useful for proving membership anonymously. With a ring signature scheme, a paid customer can prove his membership by involving other legitimate users' identity without help from the manager. In this paper, we propose a ring signature scheme based on the El Gamal digital signature scheme that is provably secure against adaptively chosen ciphertext attack","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115643409","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 : 2005-05-22DOI: 10.1109/EIT.2005.1626961
Celia Li, Cungang Yang
Anonymity is increasingly important for networked applications amidst concerns over censorship and privacy. Even though strong anonymity and privacy guarantees are critical for many applications, current Internet networking protocols provide no support for masking the identity of communication endpoints. In this paper, we proposed an enhanced IPSec protocol (EIPSec). It supports secure and anonymous communication on the Internet. In addition, the anonymity Internet communication provides high resistance against various attacks.
{"title":"An Enhanced IPSec for Anonymous Internet Communication","authors":"Celia Li, Cungang Yang","doi":"10.1109/EIT.2005.1626961","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626961","url":null,"abstract":"Anonymity is increasingly important for networked applications amidst concerns over censorship and privacy. Even though strong anonymity and privacy guarantees are critical for many applications, current Internet networking protocols provide no support for masking the identity of communication endpoints. In this paper, we proposed an enhanced IPSec protocol (EIPSec). It supports secure and anonymous communication on the Internet. In addition, the anonymity Internet communication provides high resistance against various attacks.","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125572104","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 : 2005-05-22DOI: 10.1109/EIT.2005.1626985
A. Krings, Jean-Louis Roch, S. Jafar
This research addresses certification of large distributed applications executing in hostile environments, where tasks or the results they produce may have been corrupted due to benign or malicious act. We extend recent results addressing applications with task dependencies and introduce new probabilistic certification algorithms that establish whether the computations have been massively attacked. The probabilistic approach does not make any assumptions about task behavior as the result of an attack and certification errors are only due to unlucky random choices. Bounds associated with certification are provided for general graphs and for out-trees found in medical image analysis applications of the French ragtime project
{"title":"Certification of large distributed computations with task dependencies in hostile environments","authors":"A. Krings, Jean-Louis Roch, S. Jafar","doi":"10.1109/EIT.2005.1626985","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626985","url":null,"abstract":"This research addresses certification of large distributed applications executing in hostile environments, where tasks or the results they produce may have been corrupted due to benign or malicious act. We extend recent results addressing applications with task dependencies and introduce new probabilistic certification algorithms that establish whether the computations have been massively attacked. The probabilistic approach does not make any assumptions about task behavior as the result of an attack and certification errors are only due to unlucky random choices. Bounds associated with certification are provided for general graphs and for out-trees found in medical image analysis applications of the French ragtime project","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134034521","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 : 2005-05-22DOI: 10.1109/EIT.2005.1626959
Guoping Wang
Computer arithmetic operations based on the binary sign-digit (BSD) numbers and carry-save addition (CSA) representation systems provide them with high-speed computations due to carry-propagation free features. However, in the previous researches, these two representations are treated respectively. In this paper, the algorithms and implementation structures are proposed for the conversion between them, thus, the arithmetic developed for one representation can be easily adapted to the other. The conversion overheads in the area and speed are also studied
{"title":"Carry-save and binary sign-digit representations conversion","authors":"Guoping Wang","doi":"10.1109/EIT.2005.1626959","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626959","url":null,"abstract":"Computer arithmetic operations based on the binary sign-digit (BSD) numbers and carry-save addition (CSA) representation systems provide them with high-speed computations due to carry-propagation free features. However, in the previous researches, these two representations are treated respectively. In this paper, the algorithms and implementation structures are proposed for the conversion between them, thus, the arithmetic developed for one representation can be easily adapted to the other. The conversion overheads in the area and speed are also studied","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"96 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114026558","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627031
Honglin Li, S. Aahlt
The omnipresent multimedia data calls for efficient and flexible methodologies to annotate, organize, store, and access video resources. Video annotation data, or video meta-data, plays an important role in the future annotation-driven video systems. Although the importance of the video annotation data is widely recognized and a considerable amount of research has been conducted on its various aspects, there is no consistent framework on which to structure video annotation data. In this paper, we have focused on investigating the nature of the video annotation data, and accordingly proposed one hierarchical structure for video annotations. Additionally, we have studied the techniques needed to hierarchically organize video annotations and proposed VideoML - an XML-based language - to organize the hierarchical video annotation data. VideoML is built upon the video part of MPEG-7 with special consideration of the video annotation data's hierarchical structure
{"title":"Hierarchical organization for video annotation","authors":"Honglin Li, S. Aahlt","doi":"10.1109/EIT.2005.1627031","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627031","url":null,"abstract":"The omnipresent multimedia data calls for efficient and flexible methodologies to annotate, organize, store, and access video resources. Video annotation data, or video meta-data, plays an important role in the future annotation-driven video systems. Although the importance of the video annotation data is widely recognized and a considerable amount of research has been conducted on its various aspects, there is no consistent framework on which to structure video annotation data. In this paper, we have focused on investigating the nature of the video annotation data, and accordingly proposed one hierarchical structure for video annotations. Additionally, we have studied the techniques needed to hierarchically organize video annotations and proposed VideoML - an XML-based language - to organize the hierarchical video annotation data. VideoML is built upon the video part of MPEG-7 with special consideration of the video annotation data's hierarchical structure","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128655135","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 : 2005-05-22DOI: 10.1109/EIT.2005.1626983
Chung-Yen Chang
The most important asset in any computing environment is the data that is being processed. Lost information can be disastrous to any enterprise or corporate. Therefore, data protection is one of the most important tasks performed on any computer systems on a regular basis. The mechanisms used by data protection vary depending on the kind of data to be protected and the type of media used. Traditionally, data protection focuses mainly on backup applications which copies data to removable media that can be shelved and protected. By putting the copy on removable media, they are isolated from the problems that can cause data loss or corruption on the live system. Recent development and cost reduction in hard disk technologies and the growing concern over data safety have made it more attractive to perform data protections using online disk-based media. The author of this paper takes a broader view of data protection and surveys different technologies that are used at different places in a computer system to guard against data loss. Pros and cons of these technologies were analyzed and some best practice guidelines were provided for implementing data protection strategies
{"title":"A survey of data protection technologies","authors":"Chung-Yen Chang","doi":"10.1109/EIT.2005.1626983","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626983","url":null,"abstract":"The most important asset in any computing environment is the data that is being processed. Lost information can be disastrous to any enterprise or corporate. Therefore, data protection is one of the most important tasks performed on any computer systems on a regular basis. The mechanisms used by data protection vary depending on the kind of data to be protected and the type of media used. Traditionally, data protection focuses mainly on backup applications which copies data to removable media that can be shelved and protected. By putting the copy on removable media, they are isolated from the problems that can cause data loss or corruption on the live system. Recent development and cost reduction in hard disk technologies and the growing concern over data safety have made it more attractive to perform data protections using online disk-based media. The author of this paper takes a broader view of data protection and surveys different technologies that are used at different places in a computer system to guard against data loss. Pros and cons of these technologies were analyzed and some best practice guidelines were provided for implementing data protection strategies","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128759019","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 : 2005-05-22DOI: 10.1109/EIT.2005.1626960
Yunqian Ma
Accurate link delivery ratio prediction is crucial to routing protocols in wireless mesh network. Since predicting delivery ratio directly usually requires excessive probing packets, it has been suggested to use packet SNR to predict delivery ratio, as SNR is a measure easy to obtain and "free" with every received packet. Unfortunately, several previous studies have shown that a simple direct mapping between SNR and delivery ratio values is often impossible. In this paper, we formulate the delivery ratio prediction problem as a classification problem (predicting link to be "good" or "bad), and apply various statistical classification algorithms (k-NN, kernel methods, and support vector machines) to it. We obtain the temporal data of link delivery ratios and SNR's from a measurement trace of a live wireless mesh network, and analyze the effectiveness of using SNR to enhance delivery ratio classification. Contrary to the pessimistic conclusion of previous works, we find that by incorporating SNR information in addition to historical delivery ratio data, the classification accuracy is improved in all the algorithms we used, with an average reduction of 8-10% of errors compared with using delivery ratio data alone. We therefore conclude that adding SNR can be an attractive alternative when designing a wireless link delivery ratio prediction protocol
{"title":"Improving wireless link delivery ratio classification with packet SNR","authors":"Yunqian Ma","doi":"10.1109/EIT.2005.1626960","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626960","url":null,"abstract":"Accurate link delivery ratio prediction is crucial to routing protocols in wireless mesh network. Since predicting delivery ratio directly usually requires excessive probing packets, it has been suggested to use packet SNR to predict delivery ratio, as SNR is a measure easy to obtain and \"free\" with every received packet. Unfortunately, several previous studies have shown that a simple direct mapping between SNR and delivery ratio values is often impossible. In this paper, we formulate the delivery ratio prediction problem as a classification problem (predicting link to be \"good\" or \"bad), and apply various statistical classification algorithms (k-NN, kernel methods, and support vector machines) to it. We obtain the temporal data of link delivery ratios and SNR's from a measurement trace of a live wireless mesh network, and analyze the effectiveness of using SNR to enhance delivery ratio classification. Contrary to the pessimistic conclusion of previous works, we find that by incorporating SNR information in addition to historical delivery ratio data, the classification accuracy is improved in all the algorithms we used, with an average reduction of 8-10% of errors compared with using delivery ratio data alone. We therefore conclude that adding SNR can be an attractive alternative when designing a wireless link delivery ratio prediction protocol","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129281756","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}
Carrier interferometry (CI) may be used to spread OFDM symbols over all N subcarriers to exploit frequency diversity without loss in throughput. In this paper, we implement the OFDM (uncoded and coded) system incorporated with the carrier interferometry and VBLAST (Vertical Bell Laboratories layered Space-Time) to undertake performance comparison in frequency selective fading channel. It is shown that the novel systems, offer considerable high throughput provided by VBLAST architecture. The novel systems simultaneously achieve dramatic performance gains by taking advantage of large frequency diversity inherent in the CI/OFDM technique. The proposed VBLAST-CI/OFDM system outperforms the VBLAST-OFDM system by 5 dB at a BER of 10-2 and 8 dB at BER of 10-3. The VBLAST-CI/COFDM system demonstrates a 4 dB performance gain at a BER of 10-3 over the VBLAST-COFDM system. VBLAST-CI/COFDM system offers a performance 2dB better than COFDM at a BER of 10-3 and simultaneously provides a throughput P(the number of transmit antennas) times that of COFDM at the expense of receiver complexity
{"title":"High-throughput high-performance VBLAST-OFDM via carrier interferometry","authors":"Peng Liang, Shaopeng Feng, Chuan-gang Zhao, Weilin Wu","doi":"10.1109/EIT.2005.1627026","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627026","url":null,"abstract":"Carrier interferometry (CI) may be used to spread OFDM symbols over all N subcarriers to exploit frequency diversity without loss in throughput. In this paper, we implement the OFDM (uncoded and coded) system incorporated with the carrier interferometry and VBLAST (Vertical Bell Laboratories layered Space-Time) to undertake performance comparison in frequency selective fading channel. It is shown that the novel systems, offer considerable high throughput provided by VBLAST architecture. The novel systems simultaneously achieve dramatic performance gains by taking advantage of large frequency diversity inherent in the CI/OFDM technique. The proposed VBLAST-CI/OFDM system outperforms the VBLAST-OFDM system by 5 dB at a BER of 10-2 and 8 dB at BER of 10-3. The VBLAST-CI/COFDM system demonstrates a 4 dB performance gain at a BER of 10-3 over the VBLAST-COFDM system. VBLAST-CI/COFDM system offers a performance 2dB better than COFDM at a BER of 10-3 and simultaneously provides a throughput P(the number of transmit antennas) times that of COFDM at the expense of receiver complexity","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116099831","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 : 2005-05-22DOI: 10.1109/EIT.2005.1626975
K. Veeraraghavan, D. Peng, H. Sharif
Visual surveillance with a distributed ad hoc sensor network enable reliable monitoring and control of a variety of applications that range from civil to military. However, due to the large volume of multimedia data associated with visual sensors, the surveillance scheme has to be architected with a goal of energy conservation and extending life expectancy. In this paper, we briefly discuss the computation and communication energy costs associated with a sensor node and explore the possibilities of extending battery life by choosing to perform local processing. We propose a discrete wavelet transform (DWT) based multi-resolution surveillance schema designed to reduce power requirement. We then compare and contrast the computational and communication power expended by a traditionally used JPEG-based scheme and illustrate the significant power savings achieved by the proposed surveillance system
{"title":"Energy efficient multi-resolution visual surveillance on wireless sensor networks","authors":"K. Veeraraghavan, D. Peng, H. Sharif","doi":"10.1109/EIT.2005.1626975","DOIUrl":"https://doi.org/10.1109/EIT.2005.1626975","url":null,"abstract":"Visual surveillance with a distributed ad hoc sensor network enable reliable monitoring and control of a variety of applications that range from civil to military. However, due to the large volume of multimedia data associated with visual sensors, the surveillance scheme has to be architected with a goal of energy conservation and extending life expectancy. In this paper, we briefly discuss the computation and communication energy costs associated with a sensor node and explore the possibilities of extending battery life by choosing to perform local processing. We propose a discrete wavelet transform (DWT) based multi-resolution surveillance schema designed to reduce power requirement. We then compare and contrast the computational and communication power expended by a traditionally used JPEG-based scheme and illustrate the significant power savings achieved by the proposed surveillance system","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126797943","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 : 2005-05-22DOI: 10.1109/EIT.2005.1627027
D. Overbye
This paper presents a new method of compensating for complex multipath channel fading in blind multiuser detection for long-code DS-CDMA communication. The system employs detectors that incorporate methods of independent component analysis (ICA). Such detectors are subject to performance degradation as the length of the user spreading code increases. When compensated through a class of sparse priors, the long-code ICA neural network detectors displayed significantly better bit error rate performance. Performance of the long-code detectors approached that of the short-code detectors in some cases
{"title":"Incorporation of sparse priors in long-code blind multiuser detection for DS-CDMA communication","authors":"D. Overbye","doi":"10.1109/EIT.2005.1627027","DOIUrl":"https://doi.org/10.1109/EIT.2005.1627027","url":null,"abstract":"This paper presents a new method of compensating for complex multipath channel fading in blind multiuser detection for long-code DS-CDMA communication. The system employs detectors that incorporate methods of independent component analysis (ICA). Such detectors are subject to performance degradation as the length of the user spreading code increases. When compensated through a class of sparse priors, the long-code ICA neural network detectors displayed significantly better bit error rate performance. Performance of the long-code detectors approached that of the short-code detectors in some cases","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115124575","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
扫码关注我们
求助内容：
应助结果提醒方式：