Download - Academy Publisher

More documents

Recommendations

Info

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. 190-192 A Study on High-Strength Communication Scheme Based on Signed Digital Envelope Wenping Guo, Ying Chen, and Xiaoming Zhao School of Mathematics and Information Engineering, Taizhou University, Linhai, China Email: guo_wp@126.com , ychen222@163.com , tzxyzxm@yahoo.com.cn Abstract—The digital signature and digital envelope, two specific applications of computer technology, have been widely used in data communication, but the application of either one may cause some deficiencies in practice. Based on the current cryptographic techniques and the study on digital signature and digital envelope, this paper proposed a new scheme, signed digital envelope. It can overcome the shortcomings of the two technologies that bring along, and the security of data communication is thereby greatly strengthened. Index Terms—Digital signature, Digital envelope, Signed digital envelope I. INTRODUCTION With widespread use of the Internet, people are more aware of the network security. How to efficiently block intruders’ access to personal computer and their alteration of unauthorized data is one of the burning problems at present. In the field of data communication, data security is mainly concerning three indicators, confidentiality, integrity and undeniability, but the conventional digital signature and digital envelope still need some improvements before achieving the above- mentioned three indicators. In this paper, we took advantages of digital signature and digital envelope’s role in data protection and proposed a high-secure scheme, signed digital envelope, which ensures data communication against being intruded. infeasible to generate a valid signature for a party who does not possess the private key. Digital signature is used to ensure that the message in transit is integrated, and that the source of the message is authenticated and undeniable. Digital signature uses what is known as public key algorithm. The use of public key cryptography for digital signature is similar with public key encryption. It has two keys, one is signing key which must be kept private, referred to as private key, the other is verification key which is open, referred to as public key. The big computing workload slows down the computing speed of public key algorithm, so we can use secure oneway hash function to summarize the message so as to lessen the computing workload. Figure 1 illustrates the formation of digital signature. Figure 2 illustrates the verification of digital signature. Data Sender’s Private key Data Sender’s Public Key Hash Function Data Digest Signature Method Figure 1. Formation of Digital Signature Hash Function Decrypted by Public Key Data Digest Data Digest Digital Signature Match Ⅱ. SIGNED DIGITAL ENVELOPE A. Digital Signature Digital signature (DS) [1] is a mathematical scheme for demonstrating the authenticity of a digital message or document. A valid digital signature gives a recipient reason to believe that the message was created by a known sender, and that it was not altered in transit. It typically consists of three algorithms: (1) A key generation algorithm that selects a private key uniformly at random from a set of possible private keys. The algorithm outputs the private key and a corresponding public key. (2)A signing algorithm which, given a message and a private key, produces a signature. And (3) A signature verifying algorithm which given a message, public key and a signature, either accepts or rejects. Two main properties are required. First, a signature generated from a fixed message and fixed private key should verify on that message and the corresponding public key. Secondly, it should be computationally © 2010 ACADEMY PUBLISHER AP-PROC-CS-10CN006 190 Digital Signature Figure 2. Verification of Digital Signature B. Digital Envelope Digital Envelope [2] is a type of security that uses two layers of encryption to protect a message. First, the message itself is encoded using symmetric encryption, and then the key to decode the message is encrypted using public-key encryption. This technique overcomes one of the problems of public-key encryption, which is that it is slower than symmetric encryption. Because only the key is protected with public-key encryption, there is very little overhead. With the advantages of private key encryption and public key encryption, digital envelope can overcome private key’s distribution difficulty in private key encryption and public key’s long encryption. The flexibility of the public key and the high efficiency of the
private key that obtained by using two layers of encryption can guarantee the security of messages. Figure 3 illustrates the encryption process of the digital envelope. First, the plaintext is encrypted by symmetric key, and then symmetric key is encrypted by receiver’s public key so as to obtain digital envelop, that is, the data ciphertext and key ciphertext. [1] C. Signed Digital Envelope The conventional digital envelope can ensure the confidentiality of the data, but its adoption of the public key encryption makes it possible for malicious user to destroy the data, so the integrity and undeniability of the data can not be guaranteed. However, signed digital envelope can make it up for conventional digital envelope due to its adoption of private key encryption. And a new and improved encryption scheme is born by combining digital envelope with digital signature Figure 4 illustrates the improved scheme. First, the digital signature is obtained by signing plaintext data with sender’s private key, and then plaintext data are encrypted by symmetric key, and after that, both the signature and the symmetric key are encrypted by sender’s public key. In this way, only the authorized receiver has access to the initial data that can not be altered by malicious user. Figure 5 illustrates the process that the authorized user receives the data and has them verified. Ⅲ. SECURE COMMUNICATION BASED ON SIGNED DIGITAL ENVELOPE The .Net provides all the developers with first-class encryption model which has great scalability and doesn’t have to resort to that obscure function from the unmanaged class. Therefore, .Net was chosen as the development environment to bring about a new scheme in this paper. A. Methods for Symmetric Encryption and Decryption The entire document should be in Times New Roman or Times font. Type 3 fonts must not be used. Other font types may be used if needed for special purposes. The steps of symmetric encryption are shown as follows: (1)Creating encryption key TripleDESCryptoServiceProvider crypt = new TripleDESCryptoServiceProvider(); …… …… crypt.GenerateKey();//creating symmetric key (2)Creating encrypted object and memory stream MemoryStream ms = new MemoryStream(); …… (3)Packing the memory stream with CrytoStream and encrypting it. CryptoStream cs = new CrytoStream ( ms,crypt.CreateEncryptor (), CryptoStreamMode. Write ) ; // packing the memory stream with CrytoStream StreamWriter sw = new StreamWriter(cs); sw.WriteLine (“plaintext”);// importing plaintext data sw.Flush(); cs.FlushFinalBlock(); …… Both decryption and encryption need to pack memory with CryoStream, but in this regard, CreateDecrytor proves itself better than CreateEncyptor in practice. B. Methods for Public Key Encryption and Decryption Being similar with digital signature, here we can use RSACryptoServiceProvider class and DSACryptoServiceProvider. But digital signature is to use one’s own private key to encrypt the data, and what is known as asymmetric encryption, in most cases, refers to the use of counterpart’s public key to encrypt the data. Different encryption keys can be applied to different circumstances. The steps of public key encryption are shown as follows: (1)Creating key pair RSACryptoServiceProvider crypt = new RSACryptoServiceProvider(); 191
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: TABLE II. THE CONCENTRATION BETWEEN
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

Create successful ePaper yourself

Delete template?

Save as template?