|
Contents |
7 |
|
|
Foreword |
11 |
|
|
Preface |
13 |
|
|
Randomness and Discrepancy Transforms |
16 |
|
|
1. Introduction |
16 |
|
|
2. Discrepancy Transforms |
17 |
|
|
3. Runs of Discrepancy Sequences and Linear Span Profiles |
19 |
|
|
4. Restricted Discrepancy Transforms and Filtering Generators with D-Permutations |
20 |
|
|
5. Conclusion |
22 |
|
|
References |
23 |
|
|
Legendre Sequences and Modified Jacobi Sequences |
24 |
|
|
Introduction |
24 |
|
|
1. Legendre sequences |
25 |
|
|
2. Modified Jacobi sequences |
25 |
|
|
3. Polyphase Legendre sequences |
26 |
|
|
4. Modified polyphase Jacobi sequences |
27 |
|
|
5. Proof of Green’s conjecture |
30 |
|
|
References |
31 |
|
|
Resilient Functions with Good Cryptographic Properties |
32 |
|
|
1. Introductions |
32 |
|
|
2. Preliminaries |
33 |
|
|
3. Previous constructions and results |
34 |
|
|
4. New construction of resilient functions |
35 |
|
|
5. Example |
37 |
|
|
6. Conclusion |
38 |
|
|
References |
38 |
|
|
Differential Factoring for Integers |
40 |
|
|
1. Introduction |
40 |
|
|
2. Right shifting and its properties |
41 |
|
|
3. An algorithm |
41 |
|
|
4. A complementary algorithm |
43 |
|
|
5. Some perfect primes are not perfect |
44 |
|
|
6. Preprocessing for parallel computation |
45 |
|
|
7. A few small examples |
46 |
|
|
8. Concluding remarks |
47 |
|
|
References |
47 |
|
|
Simple and Efficient Systematic A-codes from Error Correcting Codes |
48 |
|
|
1. Introduction |
48 |
|
|
2. Systematic authentication codes and some bounds |
49 |
|
|
3. The construction of the authentication codes |
51 |
|
|
4. Specific constructions of authentication codes from error correcting codes |
52 |
|
|
5. Open problems |
57 |
|
|
6. Concluding remarks |
57 |
|
|
References |
57 |
|
|
On Coefficients of Binary Expression of Integer Sums |
60 |
|
|
1. Introduction |
60 |
|
|
2. preparation |
61 |
|
|
3. Main theorem |
62 |
|
|
4. Conclusions |
66 |
|
|
References |
66 |
|
|
A new publicly verifiable proxy signcryption scheme |
68 |
|
|
1. Related works |
69 |
|
|
2. The proposed proxy signcryption scheme |
71 |
|
|
3. Analysis |
72 |
|
|
4. Conclusion |
72 |
|
|
References |
72 |
|
|
Some New Proxy Signature Schemes from Pairings |
74 |
|
|
1. Introduction |
74 |
|
|
2. Preliminaries |
75 |
|
|
3. The General Construction |
77 |
|
|
4. New Proxy Signature Schemes |
78 |
|
|
5. New Proxy Blind Signature Schemes |
79 |
|
|
6. Conclusion |
80 |
|
|
References |
81 |
|
|
Construction of Digital Signature Schemes Based on DLP |
82 |
|
|
1. Introduction |
82 |
|
|
2. Constructions of schemes |
83 |
|
|
3. Conclusion |
86 |
|
|
References |
86 |
|
|
DLP-based blind signatures and their application in E-Cash systems |
88 |
|
|
1. Introduction |
88 |
|
|
2. How to construct DLP-based blind signatures |
89 |
|
|
3. Generalize some DLP-based blinding processes |
92 |
|
|
4. The application of blind signatures in E-Cash |
93 |
|
|
5. Conclusion |
94 |
|
|
References |
94 |
|
|
A Group of Threshold Group-Signature Schemes with Privilege Subsets |
96 |
|
|
1. Introduction |
96 |
|
|
2. Analysis on threshold scheme [8] |
97 |
|
|
3. threshold group-signature |
98 |
|
|
3.1 Basic idea |
98 |
|
|
3.2 Initiation |
98 |
|
|
3.3 Generation of group key and secret pieces |
99 |
|
|
3.4 Generation of threshold group-signature |
99 |
|
|
3.5 Verification and Traceability |
99 |
|
|
3.6 Threshold group-signature scheme with several privilege subsets |
100 |
|
|
3.7 Instance without the assistance of KAC |
100 |
|
|
4. Threshold group-signature schemes with message recovery |
100 |
|
|
4.1 Generic threshold schemes of ElGamal type |
100 |
|
|
4.2 Threshold schemes with message recovery |
101 |
|
|
5. Analysis |
102 |
|
|
References |
103 |
|
|
A New Group Signature Scheme with Unlimited Group Size |
104 |
|
|
1. Proxy signature with privacy protection |
106 |
|
|
1.1 Notations |
106 |
|
|
1.2 An improved proxy signature scheme |
107 |
|
|
2. Group signature with unlimited group size |
108 |
|
|
3. Properties analysis |
109 |
|
|
4. Discussion |
110 |
|
|
5. Conclusion |
110 |
|
|
References |
111 |
|
|
Identity Based Signature Scheme Based on Quadratic Residues |
112 |
|
|
1. Introduction |
112 |
|
|
2. Notation and related theorem |
114 |
|
|
3. Identity based signature scheme based on quadratic residue problem( IBS- QR) |
115 |
|
|
4. Practical aspects |
119 |
|
|
5. Comparison and conclusion |
119 |
|
|
Notes |
120 |
|
|
References |
120 |
|
|
A New Digital Signature Scheme Based on Factoring and Discrete Logarithms |
122 |
|
|
1. Introduction |
122 |
|
|
2. He-Kiesler scheme and a simple attack |
123 |
|
|
3. Modified He-Kiesler Signature Scheme |
124 |
|
|
4. Conclusion |
126 |
|
|
References |
126 |
|
|
New Transitive Signature Scheme based on Discreted Logarithm Problem |
128 |
|
|
Introduction |
128 |
|
|
1. Definitions |
129 |
|
|
2. New undirected transitive signature scheme |
131 |
|
|
3. Correctness |
133 |
|
|
4. Security |
135 |
|
|
5. Conclusion |
137 |
|
|
References |
137 |
|
|
Blind signature schemes based on GOST signature |
138 |
|
|
Introduction |
138 |
|
|
1. GOST signature scheme |
139 |
|
|
2. Blind GOST signature schemes |
139 |
|
|
3. Conclusion |
143 |
|
|
References |
143 |
|
|
One-off Blind Public Key |
144 |
|
|
Introduction |
144 |
|
|
1. Definition and properties of one-off blind public key |
144 |
|
|
2. Relative knowledge |
145 |
|
|
2.1 The theorem comes from [5] |
145 |
|
|
2.2 The Fiat-Shamir identification scheme |
145 |
|
|
2.3 Group signature [2] |
146 |
|
|
3. One-off blind public key protocol |
146 |
|
|
3.1 The initialization of the trusted entity |
146 |
|
|
3.2 Issue generative factor of blind public key for user |
146 |
|
|
3.3 Calculation of blind public key |
146 |
|
|
3.4 Verification of the validity of one-off blind public key. |
147 |
|
|
3.5 Useing of one-off blind public key and the private key |
147 |
|
|
4. Security analysis of one-off blind public key |
148 |
|
|
5. The properties of one-off blind public key protocol |
149 |
|
|
5.1 One transform blind signature |
149 |
|
|
5.2 The check on one-off blind public key |
150 |
|
|
5.3 The compose of one-off blind public key |
150 |
|
|
5.4 The functions and the rights of the trusted entity |
150 |
|
|
5.5 Comparison with group signature |
151 |
|
|
6. Conclusion |
151 |
|
|
References |
151 |
|
|
Analysis on the two classes of Robust Threshold Key Escrow Schemes |
152 |
|
|
1. Introduction |
152 |
|
|
2. Review of two classes of robust threshold Key Escrow Schemes ( RTKES) |
153 |
|
|
3. Our viewpoints |
155 |
|
|
4. Analysis basis on KES |
155 |
|
|
5. Analysis on RTKES1 |
156 |
|
|
5.1 Analysis on Improved RSA |
156 |
|
|
5.2 Analysis on escrow protocol |
156 |
|
|
5.3 Subliminal channel attack on communication protocol |
156 |
|
|
5.4 Analysis of monitor protocol |
157 |
|
|
6. Analysis on RTKES2 |
157 |
|
|
7. Tag |
159 |
|
|
References |
159 |
|
|
Privacy-Preserving Approximately Equation Solving over Reals |
160 |
|
|
1. Introduction |
160 |
|
|
2. Approximately Multi–party Computation over Reals |
161 |
|
|
3. Secure Multi–Party Equation Solving Problems and Protocols |
163 |
|
|
4. Summary and Future Work |
164 |
|
|
References |
165 |
|
|
An Authenticated Key Agreement Protocol Resistant to DoS attack |
166 |
|
|
1. Introduction |
166 |
|
|
2. AKAKC Protocol |
167 |
|
|
3. DoS attack |
168 |
|
|
4. An improved protocol which can defeat DoS attack |
168 |
|
|
4.1 Basic idea of the improved protocol [3] |
168 |
|
|
4.2 Description of the improved protocol |
168 |
|
|
4.3 The analysis of the improved protocol |
170 |
|
|
5. Summary |
171 |
|
|
References |
171 |
|
|
A comment on a multi-signature scheme |
172 |
|
|
1. Introduction |
172 |
|
|
2. Brief review of Burmester et al.’s scheme |
172 |
|
|
3. Our attack |
174 |
|
|
4. Summary |
174 |
|
|
References |
175 |
|
|
Cryptanalysis of LKK Proxy Signature |
176 |
|
|
1. Introduction |
176 |
|
|
2. Brief review of related schemes and our attack |
177 |
|
|
2.1 Schnorr’s scheme [3] |
177 |
|
|
2.2 LKK strong proxy signature scheme |
177 |
|
|
3. Our attack |
178 |
|
|
4. Summary |
179 |
|
|
References |
179 |
|
|
Attack on Identity-Based Broadcasting Encryption Schemes |
180 |
|
|
1. Introduction |
180 |
|
|
2. Identity-Based Broadcasting Scheme: MSL Scheme 1 |
181 |
|
|
3. MSL Scheme 2 and Its Analysis |
184 |
|
|
3.1 MSL Scheme 2 |
184 |
|
|
3.2 Linear Attack on MSL Scheme 2 |
185 |
|
|
4. Remark on the Assumption of the Order of the Group |
186 |
|
|
5. Conclusion |
187 |
|
|
References |
187 |
|
|
Differential-Linear Cryptanalysis of Camellia |
188 |
|
|
1. Introduction |
188 |
|
|
2. Description of the Camellia |
189 |
|
|
3. 4-Round Distinguisher |
190 |
|
|
4. Attacks on Camellia Reduced to 9 and 10 Rounds |
192 |
|
|
5. Conclusion |
194 |
|
|
References |
194 |
|
|
Security Analysis of EV-DO System |
196 |
|
|
1. INTRODUCTION |
196 |
|
|
2. EV-DO Security Architecture |
197 |
|
|
3. EV-DO User Authentication |
197 |
|
|
4. Session security in the air interface |
200 |
|
|
5. Security analysis and suggestion |
200 |
|
|
5.1 Weak |
200 |
|
|
5.2 Improvement |
200 |
|
|
6. Conclusion |
201 |
|
|
Acknowledgments |
201 |
|
|
References |
201 |
|
|
A Remedy of Zhu-Lee-Deng’s Public Key Cryptosystem |
202 |
|
|
1. Introduction |
202 |
|
|
2. Notions and Definitions |
203 |
|
|
3. Our remedy scheme |
205 |
|
|
4. Conclusions |
208 |
|
|
Acknowledgments |
208 |
|
|
References |
208 |
|
|
Quantum cryptographic algorithm for classical binary information |
210 |
|
|
1. Quantum cryptographic algorithm |
211 |
|
|
2. Security analysis |
213 |
|
|
3. Physical realization |
214 |
|
|
4. Summary |
214 |
|
|
Acknowledgments |
215 |
|
|
References |
215 |
|
|
Practical Quantum Key Distribution Network based on Stratospehre platform |
216 |
|
|
1. Feasibility of stratosphere QKD network |
217 |
|
|
2. Models of QKD network |
218 |
|
|
3. Implementation and applications |
222 |
|
|
4. Summary |
222 |
|
|
References |
222 |
|
|
A Survey of P2P Network Security Issues based on Protocol Stack |
224 |
|
|
1. Introduction |
224 |
|
|
2. Basic Concepts |
225 |
|
|
2.1 The P2P Network |
225 |
|
|
2.2 The P2P Network Security |
226 |
|
|
3. Secure Demands Analysis of the P2P Network |
227 |
|
|
3.1 P2P Computing |
227 |
|
|
3.2 Cooperation Computing |
227 |
|
|
3.3 File Sharing |
228 |
|
|
4. The P2P Network Security Hidden Danger and Attack |
228 |
|
|
4.1 Connection Layer |
228 |
|
|
4.2 Service Layer |
229 |
|
|
4.3 Application Layer |
230 |
|
|
5. Conclusion |
230 |
|
|
References |
231 |
|
|
DDoS Scouter: A simple IP traceback scheme |
232 |
|
|
1. Introduction |
232 |
|
|
2. Multi-edge marking |
235 |
|
|
2.1 Record route IP option[2] |
235 |
|
|
2.2 Algorithm |
235 |
|
|
2.3 Analysis |
237 |
|
|
2.4 Authenticated multi-edge marking algorithm |
237 |
|
|
3. DDoS Scouter |
239 |
|
|
4. Simulation |
240 |
|
|
5. Discussion |
241 |
|
|
5.1 Fragmentation |
241 |
|
|
5.2 Authentication |
242 |
|
|
5.3 Cross-domains |
242 |
|
|
6. Conclusion |
242 |
|
|
References |
243 |
|
|
A Method of Digital Data Transformation–Base91 |
244 |
|
|
1. Background of Invention |
244 |
|
|
2. Contents of Invention |
245 |
|
|
3. Conclusion |
248 |
|
|
References |
249 |
|
|
An approach to the formal analysis of TMN protocol |
250 |
|
|
1. Introduction |
250 |
|
|
2. The TMN protocol |
251 |
|
|
3. Analysis of TMN protocol using Running-Mode |
251 |
|
|
4. Attacks on the TMN protocol |
254 |
|
|
5. Conclusion |
258 |
|
|
References |
258 |
|
|
Index |
260 |
|
|
More eBooks at www.ciando.com |
0 |
|