Download - Academy Publisher

More documents

Recommendations

Info

…… string strPublicKey = crypt.ToXmlString(false); // public key string strPrivateKey = crypt.ToXmlString(true); // private key (2)Code-conversing the data …… byte[] bytes = Encoding.GetEncoding("GB2312").GetBytes(“plaintext” );//importing plaintext data and symmetric key ( 3 ) Encrypting with Encrypt ( ) of RSA- CryptoServiceProvider …… byte[] cipherBytes = crypt.Encrypt(bytes, false); When decrypting with this method, we only use Decrypt () of RSACryptoServiceProvider. C. Data Signature and the Verification .NET Framework provides signed data and documents with RSACryptoServiceProvider and DSACrypto- ServiceProvider class. That is, RSACryptoServiceProvider crypt = new RSACryptoServiceProvider() importing one’s own private key for signing. The theory of singing with crypt.FromXmlString- (strPrivateKey), as a matter of fact, is using plaintext to get hash code and then encrypting the hash code with one’s own private key. Based on the plaintext, we can use SignData () to get hash code and signed data. byte[] signBytes = crypt.SignData(bytData, offset, count, SHA1.Create());//SHA1.Create() enable us to obtain hash code of the data. The data verification is accomplished by comparing the re-generated hash with the original hash to determine whether the data have been altered or not. After importing counterpart’s public key, the verification results prove that the new scheme is up to expectation by using VerifyData(bytData, SHA1.Create(), bytSignature). Ⅳ. CONCLUSIONS This paper studied the two conventional computer security technologies, digital signature and digital envelope, based on which, a more secure scheme was constructed. It is proved that the communication data can meet the three indicators, confidentiality, integrity and undeniablility. Our next step is to put the new scheme into practical application; however, it is necessary to point out that the .Net, as the development environment, provides first-class encryption model and encryption class, making the implementation of the scheme become much easier. REFERENCES [1] [Wikipedia’s digital signature,]Wikipedia page: Digital signature, last modified on 1 September 2009, http://en.wikipedia.org/wiki/Digital_signature [2] PKCS #7 Version 1.6 Bulletin:Cryptographic message syntax, RSA Laboratories[S]. [3] ZHAO Yan-bo, ZHANG Xue-jie, JIANG Yong-ling. Application researches on high strength file encryption based on digital envelope. Computer Engineering and Design[J].2007.9:4357-4359 [4] Gu C. X., Zhu Y. F., Zhang Y. J. A Formal Model for the Security of Proxy Signature Schemes. Wuhan University Journal of Natural Science, 10(1), 2005: 275-278. [5] Ureche O, Plamondon R. Document transport, transfer and exchange:Security and commercial aspects [C].ICDAR.Washington,DC,USA:IEEE Computer Society,1999:585-588. [6] Okamoto T., Inomata A., Okamoto E. A Proposal of Short Proxy Signature Using Pairing. In: International Conference on Information Technology (ITCC 2005). USA: IEEE press, 2005: 631–635. [7] Huang X.Y., Mu Y., Susilo W., et al. A Short Proxy Signature Scheme: Efficient Authentication in the Ubiquitous World. In: EUCWorkshops 2005. Berlin: Springer-Verlag, 2005: 480–489. 192
ISBN 978-952-5726-09-1 (Print) Proceedings of the Second International Symposium on Networking and Network Security (ISNNS ’10) Jinggangshan, P. R. China, 2-4, April. 2010, pp. 193-196 A Framework for Credibility Evaluation of Web- Based Competitive Intelligence Jie Zhao 1, 2 , and Peiquan Jin 3 1 School of Business Administration, Anhui University, Hefei, China 2 School of Management, University of Science and Technology of China, Hefei, China zjpq@mail.hf.ah.cn 3 School of Computer Science and Technology University of Science and Technology of China, Hefei, China jpq@ustc.edu.cn Abstract—With the rapid increasing of Web data volume, it has been a hot issue to find competitive intelligence from Web. However, previous studies in this direction focused on the extracting algorithms for Web-based competitive intelligence, and little work has been done in the credibility evaluation of Web-based competitive intelligence. The credibility of Web-based competitive intelligence plays critical roles in the application of competitive intelligence and can determine the effectiveness of competitive intelligence. In this paper, we focus on the credibility evaluation issue of Web-based competitive intelligence, and present a framework to model and evaluate the credibility of Web-based competitive intelligence. A networked credibility model and some new methods for credibility evaluation are proposed in the paper. I. INTRODUCTION With the rapid development of Web technologies, the amount of Web data has reached a very huge value. A recent report said that the volume of Web pages has been 200, 000 TB. The huge volume of Web data brings new challenges in many areas, especially in the extraction and application of competitive intelligence. Researches on Competitive intelligence mainly focus on extracting useful competitive intelligence from a large set of data, and thus provide support for enterprise management and decisions. A survey in 2007 shown that about ninety percentage of competitive intelligence could be acquired from the Web (Lamar, 2007). Therefore, many researchers devoted themselves in the extraction of Webbased competitive intelligence. However, previous work in Web-based competitive intelligence mostly concentrated on how to extract competitive intelligence from Web pages (Deng and Luo, 2007), and little work has been done in the credibility evaluation of Web-based competitive intelligence. The credibility of Web-based competitive intelligence is a critical issue in the application of competitive intelligence, because incredible intelligence will bring wrong developing strategies management mechanisms to enterprises. In this paper, we will focus on the credibility evaluation issue of Web-based competitive intelligence. Our goal is to develop a system to automatically collect and evaluate Web-based competitive intelligence. This © 2010 ACADEMY PUBLISHER AP-PROC-CS-10CN006 193 paper is not a system demonstration, but a description of our designing framework. We will discuss the system architecture of the credibility evaluation of Web-based competitive intelligence, and pay more attention to the details of concrete modules in the system. The main contributions of the paper can be summarized as follows: (1) We present a Web-based framework for the extraction and credibility evaluation of competitive intelligence. The major components of such a system are analyzed (see Section 3). (2) We present a new technique to perform the credibility evaluation of Web-based competitive intelligence, which is the spatiotemporal-evolution-based approach (see Section 4). The following of the paper is structured as follows. In Section 2 we discuss the related work. Section 3 discusses the framework of Web-based competitive intelligence extraction and credibility evaluation. Section 4 gives the discussion about spatiotemporal-evolution-based approach to evaluating the credibility of Web-based competitive intelligence. And conclusions and future work are in the Section 5. II. RELATED WORK According to our knowledge, there are few works focused on the credibility evaluation of competitive intelligence. Most of previous related works concentrated on information credibility. Basically, competitive intelligence stems from information. But competitive intelligence credibility is different from information credibility. There is some relationship between those two types of credibility, which is still an unrevealed issue in the research on competitive intelligence. Information credibility refers to the believability of some information and/or its source (Metzger, 2007). It not only refers to the objective evaluation on information quality and precise, but also refers to the measurement on information source. Recently, Web information credibility has been a hot topic and some works have been conducted. The earliest research on this area can be found in (Alfarez and Hailes, 1999), in which the authors present a new method considering some trust mechanism in society to measure the information credibility.
Page 1 and 2:
Proceedings The Second Internationa
Page 3 and 4:
Table of Contents Message from the
Page 5 and 6:
Zuming Xiao, Zhan Guo, Bin Tan, and
Page 7 and 8:
Message from the Symposium Chairs T
Page 9 and 10:
Second International Symposium on N
Page 11 and 12:
ISBN 978-952-5726-09-1 (Print) Proc
Page 13 and 14:
model that can deal with time serie
Page 15 and 16:
ISBN 978-952-5726-09-1 (Print) Proc
Page 17 and 18:
training for the Wushu competition
Page 19 and 20:
ISBN 978-952-5726-09-1 (Print) Proc
Page 21 and 22:
information, called weak uncertain
Page 23 and 24:
Student side Student side Student s
Page 25 and 26:
ISBN 978-952-5726-09-1 (Print) Proc
Page 27 and 28:
If we define element of student as
Page 29 and 30:
ISBN 978-952-5726-09-1 (Print) Proc
Page 31 and 32:
QoS, each frame data is divided int
Page 33 and 34:
ISBN 978-952-5726-09-1 (Print) Proc
Page 35 and 36:
for Imaging Two and Three Phase Flo
Page 37 and 38:
ISBN 978-952-5726-09-1 (Print) Proc
Page 39 and 40:
A. Profiling&following control algo
Page 41 and 42:
Research and Realization about Conv
Page 43 and 44:
PDF document structure is a tree st
Page 45 and 46:
ISBN 978-952-5726-09-1 (Print) Proc
Page 47 and 48:
support 10 Mb / s. But ENC28J60 onl
Page 49 and 50:
ISBN 978-952-5726-09-1 (Print) Proc
Page 51 and 52:
condition the first byte output of
Page 53 and 54:
ISBN 978-952-5726-09-1 (Print) Proc
Page 55 and 56:
According to maximum membership deg
Page 57 and 58:
ISBN 978-952-5726-09-1 (Print) Proc
Page 59 and 60:
ubber according to the mass ratio o
Page 61 and 62:
Ⅲ. AN IMPROVED DNA ALGORITHM FOR
Page 63 and 64:
Ⅴ.CONCLUSION REMARKS DNA computer
Page 65 and 66:
its first child q 1 on the left, th
Page 67 and 68:
chains can greatly improve efficien
Page 69 and 70:
II. RELATED WORK A. Mobile Service
Page 71 and 72:
special services. SOAP is used to b
Page 73 and 74:
detection methods of DDoS attacks m
Page 75 and 76:
Step4 calculate the new subordinate
Page 77 and 78:
Figure 1. An analysis of the partit
Page 79 and 80:
ISBN 978-952-5726-09-1 (Print) Proc
Page 81 and 82:
The preceding three formulas can be
Page 83 and 84:
ISBN 978-952-5726-09-1 (Print) Proc
Page 85 and 86:
And the decay speed of buffer seque
Page 87 and 88:
ISBN 978-952-5726-09-1 (Print) Proc
Page 89 and 90:
distance of view point. Given that
Page 91 and 92:
ISBN 978-952-5726-09-1 (Print) Proc
Page 93 and 94:
Ⅳ. EVALUATION OF BLENDED LEARNING
Page 95 and 96:
ISBN 978-952-5726-09-1 (Print) Proc
Page 97 and 98:
symmetric with respect to the origi
Page 99 and 100:
ISBN 978-952-5726-09-1 (Print) Proc
Page 101 and 102:
each sample belongs to each categor
Page 103 and 104:
ISBN 978-952-5726-09-1 (Print) Proc
Page 105 and 106:
A. Data Preparing To generate our t
Page 107 and 108:
ISBN 978-952-5726-09-1 (Print) Proc
Page 109 and 110:
oth α and β . determination of Qu
Page 111 and 112:
ISBN 978-952-5726-09-1 (Print) Proc
Page 113 and 114:
Strong earthquake 0.1< M L
Page 115 and 116:
ISBN 978-952-5726-09-1 (Print) Proc
Page 117 and 118:
indirect causes, and the logical re
Page 119 and 120:
egression. Granger causality test i
Page 121 and 122:
B. Evaluation We have evaluated thi
Page 123 and 124:
used as a source and neighboring ce
Page 125 and 126:
Figure 3. Drainage networks generat
Page 127 and 128:
Combinational logic unit failures i
Page 129 and 130:
Tabal.1 Combinational fault logic t
Page 131 and 132:
under the endorsement of both the m
Page 133 and 134:
TABLE I. DESCRIPTION OF PROPOSITION
Page 135 and 136:
Figure 2. The process of the invers
Page 137 and 138:
Figure 9. (a)the original image.(b)
Page 139 and 140:
ISBN 978-952-5726-09-1 (Print) Proc
Page 141 and 142:
In order to reduce to the number of
Page 143 and 144:
ISBN 978-952-5726-09-1 (Print) Proc
Page 145 and 146:
that studying being going to be to
Page 147 and 148:
Reference[10] analyzed the evolutio
Page 149 and 150:
module, communication module, apper
Page 151 and 152: After the comprehensive performance
Page 153 and 154: system testing can be seen that the
Page 155 and 156: III. AUTONOMIC RESOURCE ALLOCATION
Page 157 and 158: The QoE i (T i ) is the ith user’
Page 159 and 160: ISBN 978-952-5726-09-1 (Print) Proc
Page 161 and 162: nodes will be formed one cluster, t
Page 165 and 166: Where n is the number of data point
Page 169 and 170: Keyboard event Application User mod
Page 173 and 174: SQL Azure will eventually include a
Page 177 and 178: The nodes in the suffix tree are dr
Page 179 and 180: [3] Y. Li, S. M. Chung, and J. D. H
Page 181 and 182: some drilling fluid produces hydrog
Page 183 and 184: "normalization", whose membership b
Page 185 and 186: and minimum structural elements in
Page 187 and 188: esults of the spatial transform par
Page 189 and 190: B. Research on protocol actions Com
Page 191 and 192: ACKNOWLEDGMENT This work is funded
Page 193 and 194: A. Problem Description In a small b
Page 195 and 196: [4] Huang, Hung, and J. Y. jen Hsu.
Page 197 and 198: Further by calculating, the followi
Page 199 and 200: TABLE II. THE CONCENTRATION BETWEEN
Page 201: private key that obtained by using
Page 205 and 206: ontology, and the domain dictionary
Page 209 and 210: Eq.4 is NP-hard and can be solved b
Page 213 and 214: Where: G i is the selection field o
Page 215 and 216: If there is X j in a generation, wh
Page 217 and 218: Theorem 2.4([10]). Let L 1 and L 2
Page 219 and 220: The relation between the lattice im
Page 221 and 222: Figure 2. Example of single-step de
Page 223 and 224: evocation and the fourth group stor
Page 225 and 226: focused mainly on rule-based forms
Page 227 and 228: Ⅵ. CONCLUSION Figure 6. The Flask
Page 229 and 230: EDCF in comparison with DCF, has so
Page 231 and 232: B. Simulation results and analysis
Page 235 and 236: in routing table. When search resou
Page 239 and 240: others through the selective emotio
Page 241 and 242: such as weather information, techno
Page 243 and 244: the opening window, a related page
Page 245 and 246: 1) Process context storage areas. I
Page 247 and 248: V. CONCLUSION In this thesis, sCPU-
Page 249 and 250: main types of horizontal search env
Page 251 and 252: Enterprise Portal security provides
Page 253 and 254:
() t = [ S () t S () t ] T N S ,...
Page 255 and 256:
[2] Kumaravel, N., and Kavitha, V.,
Page 257 and 258:
output, so BP network has been wide
Page 259 and 260:
input to the artificial neural netw
Page 261 and 262:
(2) In a process (tokens from outsi
Page 263 and 264:
The reduction process consists of t
Page 265 and 266:
all eight normal vectors are identi
Page 267 and 268:
is B object , and the number of emp
Page 269 and 270:
xi, j y' = εα ( (1 + tanh( )) −
Page 271 and 272:
Error 8000 7000 6000 5000 4000 3000
Page 273 and 274:
Architecture (AMBA) a new bus archi
Page 275 and 276:
In order to ensure the smooth proce
Page 277 and 278:
ISBN 978-952-5726-09-1 (Print) Proc
Page 279 and 280:
In this paper, we adopt two Sobel o
Page 281 and 282:
ISBN 978-952-5726-09-1 (Print) Proc
Page 283 and 284:
four layers.The far right of the gr
Page 285 and 286:
ISBN 978-952-5726-09-1 (Print) Proc
Page 287 and 288:
TABLE II. OPERATIONAL EMPLOYEE TABL
Page 289 and 290:
A. Object-relational Type To audit
Page 291 and 292:
to execution time. Also, DBA would
Page 293 and 294:
Liping Chen .......................
show all

Download - Academy Publisher

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?