This book constitutes the thoroughly refereed post-conference proceedings of the 4th International Conference on Information Security and Cryptology, Inscrypt 2009, held in Beijing, China, in December 2009. The 22 revised full papers and 10 short papers presented were carefully reviewed and selected from 147 submissions. The papers are organized in topical sections on cryptanalysis; signature and signcryption; key exchange; private computations; cipher design and analysis; public key cryptography; network and system security; hardware security; and web security.
Author(s): Feng Bao, Moti Yung, Dongdai Lin, Jiwu Jing
Series: Lecture ... Computer Science / Security and Cryptology
Edition: 1st Edition.
Publisher: Springer
Year: 2010
Language: English
Pages: 474
Cover
......Page 1
Information Securityand Cryptology......Page 4
Copyright
......Page 5
Preface......Page 7
Inscrypt 2009......Page 8
Table of Contents......Page 12
Introduction......Page 15
Description of ARIA......Page 17
Integral Cryptanalysis......Page 18
2.5-Round Integral Distinguishers of ARIA......Page 19
3-Round Integral Distinguishers of ARIA......Page 20
Integral Attacks on Round-Reduced ARIA......Page 21
Integral Attack on 4-Round ARIA......Page 22
Integral Attack on 5-Round ARIA......Page 23
Integral Attack on 6-Round ARIA......Page 24
References......Page 27
Cryptanalysis of the ESSENCE Family of Hash Functions......Page 29
Introduction......Page 30
Branching Number of the L Function......Page 31
A 31-Round Semi-Free-Start Collision Attack For ESSENCE-512......Page 32
Finding Message Pairs for the First Nine Rounds......Page 34
Distinguishers on 14-Round ESSENCE......Page 36
The Distinguisher......Page 37
Key-Recovery Attacks......Page 38
Slide Attack......Page 39
Fixed Points for the ESSENCE Block Cipher......Page 40
Conclusions and Open Problems......Page 41
References......Page 42
Introduction......Page 49
Multiple Linear Cryptanalysis......Page 51
Enhanced Differential-Linear Cryptanalysis......Page 52
Differential-Multiple Linear Cryptanalysis......Page 53
Deriving a Differential-Multiple Linear Distinguisher from an Existing Differential-Linear Distinguisher......Page 54
Differential-Multiple Linear Attack on 9-Round DES......Page 55
Conclusion......Page 62
References......Page 63
Introduction......Page 64
Notation......Page 65
The SC2000 Block Cipher......Page 66
2-Round Iterative Differential Characteristic of Yanami et al.......Page 68
The 4.75-Round Differential Characteristics......Page 69
Attack Procedure......Page 70
Conclusions......Page 71
References......Page 72
Introduction......Page 74
Preliminaries......Page 76
Definition and Security Models of Convertible Nominative Signatures......Page 77
Definition of Convertible Nominative Signatures......Page 78
Invisibility......Page 80
Non-impersonation......Page 81
Proposed Scheme and Security Analysis......Page 83
Discussion......Page 85
Efficiency Analysis and Comparison......Page 86
References......Page 87
Introduction......Page 89
Security Model of CLSC......Page 90
Review of Barbosa et al. Certificateless Signcryption Scheme......Page 93
Attack on Barbosa et al. Certificateless Signcryption Scheme......Page 94
Overview of the Scheme......Page 95
Attack on the CLSC Scheme by Diego et al.......Page 96
Overview of the Scheme......Page 97
Certificateless Signcryption without Pairing......Page 98
Type-I Unforgeability......Page 100
Type-II Unforgeability......Page 104
Type-I Confidentiality......Page 105
References......Page 106
Introduction......Page 107
Applications......Page 108
Transparency......Page 109
Correctness......Page 110
Indistinguishability......Page 111
Scheme Description......Page 112
Security......Page 113
Scheme Description......Page 118
Security......Page 119
References......Page 120
Introduction......Page 122
General Framework of PKI Based Threshold Signcryption......Page 123
Security Model for PKI-Based Threshold Signcryption......Page 124
Threshold Signcryption Scheme by Peng et al.[10]......Page 125
Review of the Scheme[10]......Page 126
Attack on the Scheme[10]......Page 127
The Improved Scheme......Page 128
Security Proof of the Improved Scheme......Page 130
Review of the Scheme [1]......Page 132
Attack on the Scheme citePing......Page 133
Review of the Scheme [15]......Page 134
Attack on the Scheme[15]......Page 135
References......Page 136
Introduction......Page 138
Security Assumptions......Page 140
Security Model......Page 141
Description of Our Scheme......Page 144
Security Analysis of Our Scheme......Page 145
References......Page 146
Introduction......Page 148
Attack on Lu et al.'s Protocol......Page 149
Our Contribution......Page 150
Preliminaries......Page 151
Security Model for Our PAKA Protocol......Page 152
Construction......Page 154
Security Analysis......Page 155
Conclusion......Page 156
References......Page 157
Introduction......Page 158
Security Model......Page 160
Labeled CCA2 Secure Public Key Encryption......Page 161
Smooth Projective Hash Function Family......Page 162
The Protocol......Page 163
Conclusions......Page 166
References......Page 167
Introduction......Page 168
Preliminaries......Page 170
Generalized Selective Private Function Evaluation......Page 172
First Protocol: Efficient Generalized SPFE for Small $m$......Page 173
Second Protocol......Page 174
Private Similarity Test......Page 175
References......Page 177
Introduction......Page 178
Related Work......Page 180
Model......Page 181
Details of Protocol......Page 182
Security Definitions......Page 185
Security Proofs......Page 188
Implementation Results......Page 189
Experimental Results......Page 190
References......Page 191
Introduction......Page 193
Definitions......Page 195
Approach Used in AMPC of [7]and Current Article......Page 196
Asynchronous Complete Secret Sharing (ACSS)......Page 197
Information Checking Protocol and IC Signature......Page 198
Extended ICP......Page 200
Statistical Asynchronous Weak Secret Sharing......Page 201
Extended AWSS Protocol......Page 203
Statistical Asynchronous Verifiable Secret Sharing......Page 205
Extended AVSS Protocol......Page 207
Statistical Asynchronous Complete Secret Sharing......Page 208
Open Problem......Page 210
References......Page 211
Introduction......Page 212
A Discretized CML Model......Page 213
Description of the Stream Cipher......Page 215
Key Setup......Page 216
The Substitution......Page 217
The Counter System......Page 219
Key and IV Setup......Page 220
The Branch Number of the Mixing Transformation......Page 221
Resistance of IV Setup against Differential and Linear Cryptanalysis......Page 223
Linear Correlations between Consecutive Key Stream Bits......Page 224
Performance......Page 225
References......Page 226
Introduction......Page 229
Preliminary......Page 231
Design Rationale......Page 232
Security Evaluation......Page 233
Description of Structure 2......Page 234
Security Evaluation......Page 235
Implementation Considerations......Page 238
Security Evaluation......Page 239
Application 2: Block Cipher VGF2......Page 240
Security Evaluation......Page 241
Conclusion......Page 242
References......Page 243
Introduction......Page 244
Structure of Rabbit......Page 245
Internal State Update......Page 246
Initialization......Page 247
Rabbit in Hardware......Page 248
Direct Architecture and General Optimizations......Page 249
Interleaved Architecture......Page 252
Generalized Folded Structure......Page 254
Implementation and Discussion......Page 256
Conclusion......Page 258
References......Page 259
Introduction......Page 262
Round Function of the Encryption Algorithm......Page 263
Round Function of the Key Scheduling Algorithm......Page 264
Simple Linear Relationships between Input and Output Words......Page 265
On the Branch Number of $L'$......Page 268
Implications for the Key Scheduling Algorithm......Page 270
Implications for the Encryption Algorithm......Page 271
Susceptibility to Advanced Variants of the Slide Attack......Page 272
Subkeys and Related-Keys......Page 273
27-Round Key Recovery Attack......Page 274
Summary and Conclusion......Page 276
References......Page 277
Introduction......Page 280
The Flurry and Curry Block Ciphers......Page 282
The SPN Case: Curry......Page 283
Practical Improvements of the Buchmann, Pyshkin and Weinmann Attack......Page 284
On the Use of Several Plaintext/Ciphertext Pairs......Page 285
Algebraic-High Order Differential Style Cryptanalysis......Page 286
References......Page 289
Introduction......Page 292
Primes Sharing the Least Significant Bits......Page 293
Lattice Attack......Page 294
Main Result......Page 295
Weak Keys......Page 299
Conclusion......Page 300
References......Page 301
Introduction......Page 302
Proxy Re-encryption Schemes......Page 303
Bilinear Groups......Page 304
Identity Based Encryption......Page 305
Chosen Plaintext Security for [ABE-IBE] Type Proxy Re-encryption......Page 306
Construction......Page 307
CN-ABE Scheme......Page 308
[ABE-IBE] Type Proxy Re-encryption......Page 309
Security......Page 310
Extension......Page 314
References......Page 315
Introduction......Page 317
Related Work......Page 319
Public Key Encryption......Page 320
KEMs with Partial Message Recovery (PKEMs)......Page 321
From PKEs......Page 323
From PKEs with Randomness Recovery......Page 324
References......Page 325
Introduction......Page 327
Preliminaries......Page 329
The Contagion-Like Patch Dissemination Mechanism......Page 330
Scheme Description......Page 331
Security Enhancement......Page 332
Modeling and Performance Analysis......Page 333
Simulation Setup......Page 334
Performance Analysis......Page 335
Conclusions and Future Work......Page 336
References......Page 337
Introduction......Page 338
Vulnerability Representation: Description and Condition......Page 339
Unification on Known Vulnerability Databases......Page 340
Requirements......Page 341
A Conceptual Model of Computer Vulnerability......Page 343
The Proposed Data Structure......Page 345
Applying the Data Structure to an Example......Page 347
Conclusions......Page 349
References......Page 350
Introduction......Page 351
Anticipation Games with Cost and Rewards......Page 353
Player's Actions......Page 354
Player Rules......Page 355
Play Example......Page 356
Strategy Objectives......Page 357
Symbolic Constraints......Page 358
Dominant Strategy......Page 359
Complexity......Page 360
Evaluation......Page 361
References......Page 362
Introduction......Page 364
Formal Definition and Security Model of DAA......Page 366
Pairings and Relevant Hard Problems......Page 368
The Proposed DAA Scheme......Page 369
The Setup Algorithm......Page 370
The Sign Protocol......Page 371
The Verification Algorithm......Page 372
Security of the DAA Scheme......Page 373
Performance Comparison......Page 374
References......Page 377
Introduction......Page 380
Preliminaries and Basic Design Decisions......Page 383
Addition of Partial Products......Page 385
Unified Radix-4 Multiplier......Page 387
Generation of Partial Products......Page 388
Addition of Partial Products......Page 391
Results and Discussion......Page 392
Conclusions......Page 393
References......Page 394
Introduction......Page 397
Cloning Attack......Page 398
Traceability Attack......Page 399
Qingling et al.'s Protocol......Page 401
Tag/Reader Impersonation Attack......Page 403
Traceability Attack......Page 404
Conclusions......Page 405
References......Page 406
Introduction......Page 407
Deriving the System of Equations......Page 410
Conversion to a SAT Problem......Page 411
Solving the System......Page 412
Online Phase: Side-Channel Attacks......Page 413
Combining Algebraic and Side-Channel Attacks......Page 414
Advanced Scenarios......Page 415
Information $vs.$ Robustness Tradeoff......Page 418
References......Page 420
Introduction......Page 425
CAPTCHAs......Page 426
AI-Based anti-CAPTCHAs......Page 427
Social-Engineering-Based anti-CAPTCHAs......Page 428
Phishing Strategy......Page 429
Phishing Carrier......Page 430
Verification to Solutions......Page 432
Efficiency......Page 433
Precision......Page 435
Time Lag......Page 436
Possible Countermeasure for CAPTCHA Phishing......Page 437
Conclusion......Page 438
References......Page 439
Introduction......Page 440
Background and Prior Work......Page 441
Wang, Zhang and Wang's Secure Web Transaction with Anonymous Mobile Agent Protocol......Page 442
Registering a User......Page 443
User Releases Mobile Agent......Page 444
Signature and Verification......Page 445
Attacking the WZW Protocol......Page 446
Masquerading Attack–Malicious User on Honest User Attack......Page 447
Attack – Agent's Signature of $W_bid$......Page 448
Security Assumptions......Page 449
Our Mobile Agent Data Structure......Page 450
User Releases a Mobile Agent......Page 451
Signature and Verification......Page 452
Security Analysis......Page 453
Open Problems and Conclusion......Page 455
References......Page 456
Introduction......Page 457
Syntax......Page 458
Expression Examples with $A^xml(T)$......Page 460
Producing Authorisations and Querying the XML Policy Base......Page 461
The Language Alphabet $A_LP$......Page 462
Handling XPaths in $A_LP$......Page 463
Formal Definitions......Page 465
An Example......Page 467
Logic Program Translation......Page 468
Related Work......Page 469
References......Page 470
Author Index
......Page 473
