发布求助
文献互助 智能选刊 最新文献

2010 IEEE 2nd International Advance Computing Conference (IACC)最新文献

筛选
英文 中文
Signature replacement attack and its counter-measures 签名替换攻击及其应对策略
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423006
Subrata Sinha, S. Sinha
{"title":"Signature replacement attack and its counter-measures","authors":"Subrata Sinha, S. Sinha","doi":"10.1109/IADCC.2010.5423006","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423006","url":null,"abstract":"2-tuple Digital Signature scheme has two elements: a message and a signature. A tempered message can be verified by the decryption of the message digest, encrypted by the secret key of the signer, with the help of its corresponding public key. On the contrary, if the signature element is replaced then it cannot be verified. This is termed as signature replacement attack hitherto not discussed in the literature. In case of signature replacement attack, proof of origin is compromised. In this paper this attack is brought into focus for the first time. A solution for digital signature, resilient to signature replacement attack, is also proposed, where a trusted central arbiter is used as an in-line TTP. However, the central arbiter becomes the main bottleneck of performance. The problem is equally true for XML signature scheme used in Web service security today. This paper also proposes a solution with a BPEL process which acts as a central arbiter in the proposed special protocol.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133985021","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}
引用次数: 4
An advanced secure (t, n) threshold proxy signature scheme based on RSA cryptosystem for known signers 针对已知签名者，提出了一种基于RSA密码系统的高级安全(t, n)阈值代理签名方案
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422940
Raman Kumar, H. Verma
{"title":"An advanced secure (t, n) threshold proxy signature scheme based on RSA cryptosystem for known signers","authors":"Raman Kumar, H. Verma","doi":"10.1109/IADCC.2010.5422940","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422940","url":null,"abstract":"In a (t,n) threshold proxy signature scheme based on RSA, any t or more proxy signers can cooperatively generate a proxy signature while t-1 or fewer of them can't do it. The threshold proxy signature scheme uses the RSA cryptosystem to generate the private and the public key of the signers [8]. In this article, we discuss the implementation and comparison of some threshold proxy signature schemes that are based on the RSA cryptosystem. Comparison is done on the basis of time complexity, space complexity and communication overhead. We compare the performance of four schemes: Hwang et al. [1], Wen et al.[2], Geng et al.[3] and Fengying et al[4] with the performance of a scheme that has been proposed by the authors of this article earlier and proposed an advanced secure (t, n) threshold proxy signature scheme. In the proposed scheme, both the combiner and the secret share holder can verify the correctness of the information that they are receiving from each other. Therefore, the proposed scheme is secure and efficient against notorious conspiracy attacks.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"352 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124457912","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}
引用次数: 35
A weighted mean time Min-Min Max-Min selective scheduling strategy for independent tasks on Grid 网格上独立任务的加权平均时间Min-Min - Max-Min选择调度策略
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423047
S. Chauhan, R. Joshi
{"title":"A weighted mean time Min-Min Max-Min selective scheduling strategy for independent tasks on Grid","authors":"S. Chauhan, R. Joshi","doi":"10.1109/IADCC.2010.5423047","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423047","url":null,"abstract":"With the emergence of Grid technologies, the problem of scheduling tasks in heterogeneous systems has been arousing attention. Task scheduling is a NP-complete problem[5] and it is more complicated under the Grid environment. To better use tremendous capabilities of Grid system, effective and efficient scheduling algorithms are needed. In this paper, we are presenting a new heuristic scheduling strategy for Independent tasks. The strategy is based on two traditional scheduling heuristics Min-Min and Max-Min. The strategy also considers the overall performance of machines to decide the scheduling sequence of tasks. We have evaluated our scheduling strategy within a grid simulator known as GridSim. We compared the results given by our strategy with the existing scheduling heuristics Min-Min and Max-Min and the results shows that our strategy outperforms in many cases than the existing ones.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128574584","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}
引用次数: 63
Automated analysis of gestational sac in medical image processing 医学图像处理中妊娠囊的自动分析
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422938
V. Chakkarwar, M. Joshi, P. S. Revankar
{"title":"Automated analysis of gestational sac in medical image processing","authors":"V. Chakkarwar, M. Joshi, P. S. Revankar","doi":"10.1109/IADCC.2010.5422938","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422938","url":null,"abstract":"Ultrasonography is considered to be one of the most powerful techniques for imaging organs for an obstetrician and gynecologist. The first trimester of pregnancy is the most critical period in human existence. This evaluation of the first trimester pregnancy is usually indicated to confirm presence and number of pregnancy, its location and confirm well being of the pregnancy. The first element to be measurable is the gestational sac(gsac) of the early pregnancy. Size of gestational sac gives measure of fetus age in early pregnancy and also from that EDD is predicted. Today, the monitoring of gestational sac is done non-automatic, with human interaction. These methods involve multiple subjective decisions which increase the possibility of interobserver error. Because of the tedious and time-consuming nature of manual measurement, an automated, computer-based method is desirable which gives accurate boundary detection, consequently finding accurate diameter. Ultrasound images are characterized by speckle noise and edge information, which is weak and discontinuous. Therefore, traditional edge detection techniques are susceptible to spurious responses when applied to ultrasound imagery due to speckle noise. Algorithm for finding edges of gsac are as follows. In first step, we are using contrast enhancement, followed by filtering. We are smoothing image using lowpass filter followed by wiener filter. This image is segmented using thresholding. This results in image having large number of gaps due to high intensity around sac. These false regions are minimized by morphological reconstruction. Then boundaries are detected using morphological operations. Knowledge based filtering is used to remove false boundaries. In this prior knowledge of shape of gestational sac is used. First fragmented edges are removed then most circular shape is found as our sac is generally circular. Once sac is located, sac size is measured to predict the gestational age.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114861837","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}
引用次数: 10
A multi dimensional design framework for querying spatial data using concept lattice 使用概念格查询空间数据的多维设计框架
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422922
A. Tripathy, Lizashree Mishra, P. Patra
{"title":"A multi dimensional design framework for querying spatial data using concept lattice","authors":"A. Tripathy, Lizashree Mishra, P. Patra","doi":"10.1109/IADCC.2010.5422922","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422922","url":null,"abstract":"Data Warehouses (DWs) and On-Line Analytical Processing (OLAP) systems rely on a multidimensional model that includes dimensions and measures. Such model allows expressing users' requirements for supporting the decision-making process. Spatial related data has been used for a long time; however, spatial dimensions have not been fully exploited. To exploit the full potential of the spatial and temporal data for analysis spatial dimensions is a necessity for building a data warehouse. It has been observed that OLAP possesses a certain potential to support spatio-temporal analysis. However, without a spatial framework for viewing and manipulating the geometric component of the spatial data, the analysis remains incomplete. This paper presents a multi dimensional design framework adapted for effective spatio-temporal exploration and analysis. This includes an extension of a conceptual model with spatial dimensions to enable spatial analysis. The proposed design framework addresses the problem of spatial and temporal data integration by providing information to facilitate data analysis in a Spatial Data Warehouse (SDW) that uniformly handles all types of data.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126816552","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}
引用次数: 3
Performance evaluation of DWT based image steganography 基于小波变换的图像隐写性能评价
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423005
Vijay Kumar, Dinesh Kumar
{"title":"Performance evaluation of DWT based image steganography","authors":"Vijay Kumar, Dinesh Kumar","doi":"10.1109/IADCC.2010.5423005","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423005","url":null,"abstract":"Steganography plays an important role in the field of information hiding. It is used in wide variety of applications such as internet security, authentication, copyright protection and information assurance etc. In Discrete Wavelet Transform (DWT) based steganography approaches the wavelet coefficients of the cover image are modified to embed the secret message. DWT based algorithm for image data hiding has been proposed in the recent past that embeds the secret message in CH band of cover image. This paper intends to observe the effect of embedding the secret message in different bands such as CH, CV and CD on the performance of stegano image in terms of Peak Signal to Noise Ratio (PSNR). Experimentation has been done using six different attacks. Experimental results reveal that the error block replacement with diagonal detail coefficients (CD) gives better PSNR than doing so with other coefficients.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127022767","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}
引用次数: 120
Multiscale Ridgelet Transform for content based image retrieval 基于内容的图像检索的多尺度脊波变换
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423021
A. Gonde, R. Maheshwari, R. Balasubramanian
{"title":"Multiscale Ridgelet Transform for content based image retrieval","authors":"A. Gonde, R. Maheshwari, R. Balasubramanian","doi":"10.1109/IADCC.2010.5423021","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423021","url":null,"abstract":"In this paper, a new algorithm for image indexing and retrieval using Multi-scale Ridgelet Transform (MRT) is presented. In MRT, ridgelet transform has been implemented by using Gabor wavelet sub bands. This method captured image edge information more accurately than spectral method such as Gabor transform (GT). MRT is applied on Coral database and computed the low order statistics from the transformed images. Feature database has been generated by using this extracted texture features and the retrieval results demonstrate significant improvement in precision and average retrieval rate, compared to GT.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123554576","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}
引用次数: 26
Gaussian Restoration pyramid : Application of image restoration to Laplacian pyramid compression 高斯恢复金字塔:图像恢复在拉普拉斯金字塔压缩中的应用
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423035
A. Lakshmi, S. Rakshit
{"title":"Gaussian Restoration pyramid : Application of image restoration to Laplacian pyramid compression","authors":"A. Lakshmi, S. Rakshit","doi":"10.1109/IADCC.2010.5423035","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423035","url":null,"abstract":"An efficient non-orthogonal pyramid representation was proposed by Burt. However it has been stated in literature that the Laplacian sub bands of Burt pyramid have redundant information. In this paper, we propose a modified pyramid representation to reduce the redundancy in Laplacian sub bands. The proposed pyramid representation makes use of well studied de-blurring algorithm to get a prediction of blurred Gaussian images. The proposed pyramid is an improvement on Burt pyramid as it exhibits reduced sub-band frequency overlap, cross correlation and mutual information. The advantage of using this pyramid representation in image magnification and Progressive image transmission (PIT) in noisy and unreliable networks is discussed here.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131573076","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}
引用次数: 4
Detecting and eliminating Rogue Access Points in IEEE-802.11 WLAN - a multi-agent sourcing Methodology 检测和消除IEEE-802.11 WLAN中的流氓接入点——一种多代理源方法
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5422999
V. Sriram, G. Sahoo, K. Agrawal
{"title":"Detecting and eliminating Rogue Access Points in IEEE-802.11 WLAN - a multi-agent sourcing Methodology","authors":"V. Sriram, G. Sahoo, K. Agrawal","doi":"10.1109/IADCC.2010.5422999","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422999","url":null,"abstract":"Rogue Access Points (RAPs) is one of the leading security threats in current network scenario, if not properly handled in time could lead from minor network faults to serious network failure. Most of the current solutions to detect rogue access points are not automated and are dependent on a specific wireless technology. In this paper, we propose a Multi-Agent Based Methodology, which not only detects Rogue Access Point but also completely eliminates it. This Methodology has the following outstanding properties: (1) it doesn't require any specialized hardware; (2) the proposed algorithm detects and completely eliminates the RAPs from network; (3) it provides a cost-effective solution. The proposed technique can block RAPs as well as remove them from the networks both in form of Unauthorized APs or as a Rogue Clients Acting as APs.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"5 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131829985","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}
引用次数: 25
A new robust watermarking scheme for color images 一种新的彩色图像鲁棒水印方案
2010 IEEE 2nd International Advance Computing Conference (IACC) Pub Date : 2010-03-01 DOI: 10.1109/IADCC.2010.5423010
Sanjay Rawat, B. Raman
{"title":"A new robust watermarking scheme for color images","authors":"Sanjay Rawat, B. Raman","doi":"10.1109/IADCC.2010.5423010","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423010","url":null,"abstract":"In this paper, a novel watermarking scheme for color images is proposed. The host image is transformed from RGB color space to YCbCr color space. First discrete cosine transform is applied on all the components of the image and then all the transformed components are further decomposed by l-level wavelet packet transform. A gray scale watermark is embedded in all the frequency sub-bands of the image. A reliable extraction scheme is developed for the extraction of the watermark from the distorted images. Experimental results show that the proposed watermarking algorithm provides good results in terms of imperceptibility and is also robust against variety of attacks.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128249570","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}
引用次数: 42
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信