Last update:
Wed Jul 9 16:47:17 MDT 2008
E. F. Brickell Editorial . . . . . . . . . . . . . . . 1--2
Burton S. Kaliski, Jr. and
Ronald L. Rivest and
Alan T. Sherman Is the Data Encryption Standard a Group?
(Results of Cycling Experiments on DES) 3--36
D. R. Stinson Some Constructions and Bounds for
Authentication Codes . . . . . . . . . . 37--52 (or 37--51??)
Pierre Beauchemin and
Gilles Brassard and
Claude Crépeau and
Claude Goutier and
Carl Pomerance The Generation of Random Numbers that
Are Probably Prime . . . . . . . . . . . 53--64
David Chaum The Dining Cryptographers Problem:
Unconditional Sender and Recipient
Untraceability . . . . . . . . . . . . . 65--75
Uriel Feige and
Amos Fiat and
Adi Shamir Zero-knowledge proofs of identity . . . 77--94
Kevin S. McCurley A key distribution system equivalent to
factoring . . . . . . . . . . . . . . . 95--105
Johannes Buchmann and
H. C. Williams A key-exchange system based on imaginary
quadratic fields . . . . . . . . . . . . 107--118
D. R. Stinson A construction for
authentication/secrecy codes from
certain combinatorial designs . . . . . 119--127
Pierre Beauchemin and
Gilles Brassard Generalization of Hellman's extension to
Shannon's approach to cryptography . . . 129--131
Martin Tompa and
Heather Woll How to share a secret with cheaters . . 133--138
Neal Koblitz Hyperelliptic cryptosystems . . . . . . 139--150
Michael Luby and
Charles Rackoff A study of password security . . . . . . 151--158
Willi Meier and
Othmar Staffelbach Fast correlation attacks on certain
stream ciphers . . . . . . . . . . . . . 159--176
Joan Boyar Inferring sequences produced by a linear
congruential generator missing low-order
bits . . . . . . . . . . . . . . . . . . 177--184
Fred Piper and
Michael Walker Linear ciphers and spreads . . . . . . . 185--188
Martin Abadi and
Joan Feigenbaum Secure circuit evaluation. A protocol
based on hiding information from an
oracle . . . . . . . . . . . . . . . . . 1--12
Kazuo Nishimura and
Masaaki Sibuya Probability to meet in the middle . . . 13--22
D. R. Stinson The combinatorics of authentication and
secrecy codes . . . . . . . . . . . . . 23--49
Li Gong and
David J. Wheeler A matrix key-distribution scheme . . . . 51--59
Joan F. Boyar and
Stuart A. Kurtz and
Mark W. Krentel Discrete logarithm implementation of
perfect zero-knowledge blobs . . . . . . 63--76
Gustavus J. Simmons Cartesian product construction for
unconditionally secure authentication
codes that permit arbitration . . . . . 77--104
Harald Niederreiter Combinatorial approach to probabilistic
results on the linear-complexity profile
of random sequences . . . . . . . . . . 105--112
Réjane Forré Methods and instruments for designing
$S$-boxes . . . . . . . . . . . . . . . 115--130
Michael Walker Information-theoretic bounds for
authentication schemes . . . . . . . . . 131--143
Sean Murphy The cryptanalysis of FEAL-$4$ with 20
chosen plaintexts . . . . . . . . . . . 145--154
Chris Mitchell Enumerating Boolean functions of
cryptographic significance . . . . . . . 155--170
Philippe Godlewski and
Chris Mitchell Key-minimal cryptosystems for
unconditional secrecy . . . . . . . . . 1--25
Carlisle Adams and
Stafford Tavares Structured design of cryptographically
good $S$-boxes . . . . . . . . . . . . . 27--41
Ralph C. Merkle A fast software one-way hash function 43--58
T. A. Berson and
R. A. Rueppel Guest Editor's Introduction . . . . . . 61--62
G. B. Agnew and
R. C. Mullin and
I. M. Onyszchuk and
S. A. Vanstone An implementation for a fast public-key
cryptosystem . . . . . . . . . . . . . . 63--79
Klaus Gaarder and
Einar Snekkenes Applying a formal analysis technique to
the CCITT X.509 strong two-way
authentication protocol . . . . . . . . 81--98
Stuart Haber and
W. Scott Stornetta How to time-stamp a digital document . . 99--111
Stephen M. Matyas Key processing with control vectors . . 113--136
Jose Pastor CRYPTOPOST. A cryptographic application
to mail processing . . . . . . . . . . . 137--146
H. W. Lenstra, Jr. On the Chor-Rivest knapsack cryptosystem 149--155
S. Micali and
C. P. Schnorr Efficient, perfect polynomial random
number generators . . . . . . . . . . . 157--172
Marijke De Soete New bounds and constructions for
authentication/secrecy codes with
splitting . . . . . . . . . . . . . . . 173--186
Burton S. Kaliski, Jr. One-way permutations on elliptic curves 187--199
Jovan Dj. Goli\'c and
Miodrag J. Mihaljevi\'c Generalized correlation attack on a
class of stream ciphers based on the
Levenshtein distance . . . . . . . . . . 201--212
E. F. Brickell Editorial Introduction . . . . . . . . . 1--2
Eli Biham and
Adi Shamir Differential cryptanalysis of DES-like
cryptosystems . . . . . . . . . . . . . 3--72
J. Feigenbaum Guest Editor's Introduction . . . . . . 73--73
D. Beaver Secure Multiparty Protocols and
Zero-Knowledge Proof Systems Tolerating
a Faulty Minority . . . . . . . . . . . 75--122
E. F. Brickell and
D. M. Davenport On the Classification of Ideal Secret
Sharing Schemes . . . . . . . . . . . . 123--134
U. M. Maurer and
J. L. Massey Local Randomness in Pseudorandom
Sequences . . . . . . . . . . . . . . . 135--149
M. Naor Bit Commitment Using Pseudorandomness 151--158
C.-P. Schnorr Efficient Signature Generation by Smart
Cards . . . . . . . . . . . . . . . . . 161--174
C. Goutier S. Bengio, G. Brassard, Y. G. Desmedt and
J.-J. Quisquater Secure Implementations of Identification
Systems . . . . . . . . . . . . . . . . 175--183
Joan Boyar and
Katalin Friedl and
Carsten Lund Practical Zero-Knowledge Proofs: Giving
Hints and Using Deficiencies . . . . . . 185--206
Neal Koblitz Elliptic Curve Implementations of
Zero-Knowledge Blobs . . . . . . . . . . 207--213
I. B. Damgård Preface . . . . . . . . . . . . . . . . 1--1
Charles Bennett, H. and
François Bessette and
Gilles Brassard and
Louis Salvail Experimental quantum cryptography . . . 3--28
Ernest F. Brickell and
Kevin S. McCurley Interactive identification scheme based
on discrete logarithms and factoring . . 29--39
Jan-Hendrik Evertse and
Eug\`ene van Heyst Which new RSA-signatures can be computed
from certain given RSA-signatures? . . . 41--52
Ueli M. Maurer Conditionally-perfect secrecy and a
provably-secure randomized cipher . . . 53--66
Willi Meier and
Othmar Staffelbach Correlation properties of combiners with
memory in stream ciphers . . . . . . . . 67--86
Ueli M. Maurer A universal statistical test for random
bit generators . . . . . . . . . . . . . 89--105
Sheelagh Lloyd Counting binary functions with certain
cryptographic properties . . . . . . . . 107--131
Jean Georgiades Some remarks on the security of the
identification scheme based on permuted
kernels . . . . . . . . . . . . . . . . 133--137
J. H. Loxton and
David S. P. Khoo and
Gregory J. Bird and
Jennifer Seberry A cubic RSA code equivalent to
factorization . . . . . . . . . . . . . 139--150
E. F. Brickell and
D. R. Stinson Some improved bounds on the information
rate of perfect secret sharing schemes 153--166
Spyros S. Magliveras and
Nasir D. Memon Algebraic properties of cryptosystem PGM 167--183
Steven J. Phillips and
Nicholas C. Phillips Strongly ideal secret sharing schemes 185--191
Zong Duo Dai Binary sequences derived from
ML-sequences over rings I: Periods and
minimal polynomials . . . . . . . . . . 193--207
G. Brassard Editor's Note . . . . . . . . . . . . . 1--1
G. B. Agnew and
T. Beth and
R. C. Mullin and
S. A. Vanstone Arithmetic operations in $ {\rm
GF}(2^m)$ . . . . . . . . . . . . . . . 3--13
Mitsuru Ito and
Akira Saito and
Takao Nishizeki Multiple assignment scheme for sharing
secret . . . . . . . . . . . . . . . . . 15--20
Oded Goldreich Uniform-Complexity Treatment of
Encryption and Zero-Knowledge . . . . . 21--53
Ueli M. Maurer and
James L. Massey Cascade ciphers: The importance of being
first . . . . . . . . . . . . . . . . . 55--61
Joan Boyar and
Carsten Lund and
René Peralta On the communication complexity of
zero-knowledge proofs . . . . . . . . . 65--85
Benny Chor and
Eyal Kushilevitz Secret sharing over infinite domains . . 87--95
Oded Goldreich and
Eyal Kushilevitz A Perfect Zero-knowledge Proof System
for a Problem Equivalent to the Discrete
Algorithm . . . . . . . . . . . . . . . 97--116
A. W. Schrift and
A. Shamir Universal tests for nonuniform
distributions . . . . . . . . . . . . . 119--133
Ute Rosenbaum Lower bound on authentication after
having observed a sequence of messages 135--156
R. M. Capocelli and
A. De Santis and
L. Gargano and
U. Vaccaro On the size of shares for secret sharing
schemes . . . . . . . . . . . . . . . . 157--167
Don Coppersmith Modifications to the number field sieve 169--180
Glenn Orton and
Lloyd Peppard and
Stafford Tavares Design of a fast pipelined modular
multiplier based on a diminished-radix
algorithm . . . . . . . . . . . . . . . 183--208
Alfred J. Menezes and
Scott A. Vanstone Elliptic curve cryptosystems and their
implementation . . . . . . . . . . . . . 209--224
Arjen K. Lenstra and
Yacov Yacobi User impersonation in key certification
schemes . . . . . . . . . . . . . . . . 225--232
Oded Goldreich and
Yair Oren Definitions and Properties of
Zero-Knowledge Proof Systems . . . . . . 1--32
Andrew Klapper The Vulnerability of Geometric Sequences
Based on Fields of Odd Characteristic 33--51
Benny Chor and
Mihaly Gereb-Graus and
Eyal Kushilevitz On the Structure of the Privacy
Hierarchy . . . . . . . . . . . . . . . 53--60
Sean Murphy and
Kenneth Paterson and
Peter Wild A Weak Cipher that Generates the
Symmetric Group . . . . . . . . . . . . 61--65
G. J. Simmons Proof of soundness (integrity) of
cryptographic protocols . . . . . . . . 69--77
R. Kemmerer and
C. Meadows and
J. Millen Three systems for cryptographic protocol
analysis . . . . . . . . . . . . . . . . 79--130
Luke O'Connor An Analysis of a Class of Algorithms for
$S$-Box Construction . . . . . . . . . . 133--151
Shang-Hua Teng Functional Inversion and Communication
Complexity . . . . . . . . . . . . . . . 153--170
Renate Scheidler and
Johannes A. Buchmann and
Hugh C. Williams A Key-Exchange Protocol Using Real
Quadratic Fields . . . . . . . . . . . . 171--199
Ming Hua Qu and
S. A. Vanstone Factorizations in the Elementary Abelian
$p$-Group and Their Cryptographic
Significance . . . . . . . . . . . . . . 201--212
Luke O'Connor and
Andrew Klapper Algebraic Nonlinearity and Its
Applications to Cryptography . . . . . . 213--227
E. Biham New Types of Cryptanalytic Attacks Using
Related Keys . . . . . . . . . . . . . . 229
D. Davies and
S. Murphy Pairs and Triplets of DES $S$-Boxes . . 1
Kaisa Nyberg and
Lars Ramkilde Knudsen Provable Security Against a Differential
Attack . . . . . . . . . . . . . . . . . 27--37
C. Blundo and
A. De Santis and
D. R. Stinson and
U. Vaccaro Graph Decompositions and Secret Sharing
Schemes . . . . . . . . . . . . . . . . 39--64
L. O'Connor On the Distribution of Characteristics
in Bijective Mappings . . . . . . . . . 67
Alexander Russell Necessary and Sufficient Conditions for
Collision-Free Hashing . . . . . . . . . 87--99
S. A. Vanstone and
R. J. Zuccherato Short RSA Keys and Their Generation . . 101
Yi Xian Yang and
Bao An Guo Further Enumerating Boolean Functions of
Cryptographic Parameters . . . . . . . . 115--122
Ueli M. Maurer Fast Generation of Prime Numbers and
Secure Public-Key Cryptographic
Parameters . . . . . . . . . . . . . . . 123--155
Simon Blackburn and
Sean Murphy and
Jacques Stern The Cryptanalysis of a Public-Key
Implementation of Finite Group Mappings 157--166
D. R. Stinson and
J. L. Massey An Infinite Class of Counterexamples to
a Conjecture Concerning Nonlinear
Resilient Functions . . . . . . . . . . 167--173
Ding Yi Pei Information-Theoretic Bounds for
Authentication Codes and Block Designs 177--188
Martin Dyer and
Trevor Fenner and
Alan Frieze and
Andrew Thomason On Key Storage in Secure Networks . . . 189
I. B. Damgård Practical and Provably Secure Release of
a Secret and Exchange of Signatures . . 201
Howard M. Heys and
Stafford E. Tavares Substitution-Permutation Networks
Resistant to Differential and Linear
Cryptanalysis . . . . . . . . . . . . . 1--19
Ishai Ben-Aroya and
Eli Biham Differential Cryptanalysis of Lucifer 21--34
Shimon Even and
Oded Goldreich and
Silvio Micali On-Line/Off-Line Digital Signatures . . 35--67
Michael J. Fischer and
Rebecca N. Wright Bounds on Secret Key Exchange Using a
Random Deal of Cards . . . . . . . . . . 71--99
Toshiya Itoh and
Masafumi Hoshi and
Shigeo Tsujii A Low Communication Competitive
Interactive Proof System for Promised
Quadratic Residuosity . . . . . . . . . 101--109
Jovan Dj. Golic Correlation Properties of a General
Binary Combiner with Memory . . . . . . 111--126
Claude Crépeau Guest Editor's Introduction . . . . . . 127--128
Alfredo De Santis and
Giuseppe Persiano The Power of Preprocessing in
Zero-Knowledge Proofs of Knowledge . . . 129--148
Mihir Bellare and
Moti Yung Certifying Permutations: Noninteractive
Zero-Knowledge Based on Any Trapdoor
Permutation . . . . . . . . . . . . . . 149--166
Oded Goldreich and
Ariel Kahan How To Construct Constant-Round
Zero-Knowledge Proof Systems for NP . . 167--189
M. J. Fischer and
S. Micali and
C. Rackoff A Secure Protocol for the Oblivious
Transfer (Extended Abstract) . . . . . . 191--195
Russell Impagliazzo and
Moni Naor Efficient Cryptographic Schemes Provably
as Secure as Subset Sum . . . . . . . . 199--216
Matthew Franklin and
Stuart Haber Joint Encryption and Message-Efficient
Secure Computation . . . . . . . . . . . 217--232
Wen-Ai Jackson and
Keith M. Martin and
Christine M. O'Keefe Ideal Secret Sharing Schemes with
Multiple Secrets . . . . . . . . . . . . 233--250
Yenjo Han and
Lane A. Hemaspaandra Pseudorandom Generators and the
Frequency of Simplicity . . . . . . . . 251--261
Peter de Rooij On Schnorr's Preprocessing for Digital
Signature Schemes . . . . . . . . . . . 1--16
D. Beaver and
J. Feigenbaum and
J. Kilian and
P. Rogaway Locally Random Reductions: Improvements
and Applications . . . . . . . . . . . . 17--36
Toshiya Itoh and
Yuji Ohta and
Hiroki Shizuya A Language-Dependent Cryptographic
Primitive . . . . . . . . . . . . . . . 37--49
H. Dobbertin RIPEMD with Two-Round Compress Function
Is Not Collision-Free . . . . . . . . . 51--69
B. S. Kaliski A Chosen Message Attack on Demytko's
Elliptic Curve Cryptosystem . . . . . . 71--72
A. Fiat Batch RSA . . . . . . . . . . . . . . . 75--88
Y. Yacobi and
M. J. Beller Batch Diffie-Hellman Key Agreement
Systems . . . . . . . . . . . . . . . . 89--96
C. Cachin and
U. M. Maurer Linking Information Reconciliation and
Privacy Amplification . . . . . . . . . 97--110
Andrew Klapper and
Mark Goresky Feedback Shift Registers, $2$-Adic Span,
and Combiners with Memory . . . . . . . 111--147
Shimon Even and
Yishay Mansour A Construction of a Cipher from a Single
Pseudorandom Permutation . . . . . . . . 151--161
Ivan B. Damgård and
Torben P. Pedersen and
Birgit Pfitzmann On the Existence of Statistically Hiding
Bit Commitment Schemes and Fail-Stop
Signatures . . . . . . . . . . . . . . . 163--194
Eli Biham and
Alex Biryukov An Improvement of Davies' Attack on DES 195--205
Don Coppersmith and
Jacques Stern and
Serge Vaudenay The Security of the Birational
Permutation Signature Schemes . . . . . 207--221
László Csirmaz The Size of a Share Must Be Large . . . 223--231
Don Coppersmith Small Solutions to Polynomial Equations,
and Low Exponent RSA Vulnerabilities . . 233--260
Wen-Ai Jackson and
Keith M. Martin and
Christine M. O'Keefe Mutually Trusted Authority-Free Secret
Sharing Schemes . . . . . . . . . . . . 261--289
Joe Kilian and
Erez Petrank An Efficient Noninteractive
Zero-Knowledge Proof System for NP with
General Assumptions . . . . . . . . . . 1--27
Kouichi Sakurai and
Hiroki Shizuya A Structural Comparison of the
Computational Difficulty of Breaking
Discrete Log Cryptosystems . . . . . . . 29--43
Eli Biham Cryptanalysis of Multiple Modes of
Operation . . . . . . . . . . . . . . . 45--58
Lars R. Knudsen and
Xuejia Lai and
Bart Preneel Attacks on Fast Double Block Length Hash
Functions . . . . . . . . . . . . . . . 59--72
Jovan Dj. Goli\'c On Matroid Characterization of Ideal
Secret Sharing Schemes . . . . . . . . . 75--86
Moni Naor and
Rafail Ostrovsky and
Ramarathnam Venkatesan and
Moti Yung Perfect Zero-Knowledge Arguments for NP
Using Any One-Way Permutation . . . . . 87--108
R. Scheidler A Public-Key Cryptosystem Using Purely
Cubic Fields . . . . . . . . . . . . . . 109--124
Claus Peter Schnorr and
Serge Vaudenay The Black-Box Model for Cryptographic
Primitives . . . . . . . . . . . . . . . 125--140
R. Balasubramanian and
Neal Koblitz The Improbability That an Elliptic Curve
Has Subexponential Discrete Log Problem
under the Menezes-Okamoto-Vanstone
Algorithm . . . . . . . . . . . . . . . 141--145
Jòrgen Brandt and
Ivan Damgård and
Peter Landrock and
Torben Pedersen Zero-Knowledge Authentication Scheme
with Secret Key Exchange . . . . . . . . 147--159
Antoine Joux and
Jacques Stern Lattice Reduction: A Toolbox for the
Cryptanalyst . . . . . . . . . . . . . . 161--185
Cynthia Dwork and
Moni Naor An Efficient Existentially Unforgeable
Signature Scheme and Its Applications 187--208
Ivan B. Damgård and
Lars R. Knudsen Two-Key Triple Encryption . . . . . . . 209--218
Volker Müller Fast Multiplication on Elliptic Curves
over Small Fields of Characteristic Two 219--234
Sean Murphy An Analysis of SAFER . . . . . . . . . . 235--251
Hans Dobbertin Cryptanalysis of MD4 . . . . . . . . . . 253--271
Phillip Rogaway and
Don Coppersmith A Software-Optimized Encryption
Algorithm . . . . . . . . . . . . . . . 273--287
Paul C. van Oorschot and
Michael J. Wiener Parallel Collision Search with
Cryptanalytic Applications . . . . . . . 1--28
Moni Naor and
Omer Reingold On the Construction of Pseudorandom
Permutations: Luby-Rackoff Revisited . . 29--66
N. P. Smart and
S. Siksek A Fast Diffie-Hellman Protocol in Genus
2 . . . . . . . . . . . . . . . . . . . 67--73
Shai Halevi Efficient Commitment Schemes with
Bounded Sender and Unbounded Receiver 77--89
Phillip Rogaway Bucket Hashing and Its Application to
Fast Message Authentication . . . . . . 91--115
Mihir Bellare and
Ronald L. Rivest Translucent Cryptography --- An
Alternative to Key Escrow, and Its
Implementation via Fractional Oblivious
Transfer . . . . . . . . . . . . . . . . 117--139
N. P. Smart Elliptic Curve Cryptosystems over Small
Fields of Odd Characteristic . . . . . . 141--151
Carlo Blundo and
Alfredo De Santis and
Kaoru Kurosawa and
Wakaha Ogata On a Fallacious Bound for Authentication
Codes . . . . . . . . . . . . . . . . . 155--159
Eli Biham Cryptanalysis of Triple Modes of
Operation . . . . . . . . . . . . . . . 161--184
Daniel J. Bernstein How to Stretch Random Functions: The
Security of Protected Counter Sums . . . 185--192
N. P. Smart The Discrete Logarithm Problem on
Elliptic Curves of Trace One . . . . . . 193--196
Mike Burmester and
Yvo G. Desmedt and
Toshiya Itoh and
Kouichi Sakurai and
Hiroki Shizuya Divertible and Subliminal-Free
Zero-Knowledge Proofs for Languages . . 197--223
Kathleen A. S. Quinn Bounds for Key Distribution Patterns . . 227--239
Marc Joye and
Arjen K. Lenstra and
Jean-Jacques Quisquater Chinese Remaindering Based Cryptosystems
in the Presence of Faults . . . . . . . 241--245
Victor Shoup On the Security of a Practical
Identification Scheme . . . . . . . . . 247--260
Carlo Blundo and
Alfredo De Santis and
Douglas R. Stinson On the Contrast in Visual Cryptography
Schemes . . . . . . . . . . . . . . . . 261--289
Oded Goldreich Preface . . . . . . . . . . . . . . . . 1--7
Matthew Franklin and
Rebecca N. Wright Secure Communication in Minimal
Connectivity Models . . . . . . . . . . 9--30
Martin Hirt and
Ueli Maurer Player Simulation and General Adversary
Structures in Perfect Multiparty
Computation . . . . . . . . . . . . . . 31--60
Ran Canetti and
Shai Halevi and
Amir Herzberg Maintaining Authenticated Communication
in the Presence of Break-Ins . . . . . . 61--105
Ran Canetti and
Eyal Kushilevitz and
Rafail Ostrovsky and
Adi Rosén Randomness versus Fault-Tolerance . . . 107--142
Ran Canetti Security and Composition of Multiparty
Cryptographic Protocols . . . . . . . . 143--202
H. Zbinden and
N. Gisin and
B. Huttner and
A. Muller and
W. Tittel Practical Aspects of Quantum
Cryptographic Key Distribution . . . . . 207--220
R. Fischlin and
C. P. Schnorr Stronger Security Proofs for RSA and
Rabin Bits . . . . . . . . . . . . . . . 221--244
Jovan Dj. Golic and
Mahmoud Salmasizadeh and
Ed Dawson Fast Correlation Attacks on the
Summation Generator . . . . . . . . . . 245--262
Sachar Paulus and
Tsuyoshi Takagi A New Public-Key Cryptosystem over a
Quadratic Order with Quadratic
Decryption Time . . . . . . . . . . . . 263--272
Rosario Gennaro and
Tal Rabin and
Stanislav Jarecki and
Hugo Krawczyk Robust and Efficient Sharing of RSA
Functions . . . . . . . . . . . . . . . 273--300
Muxiang Zhang Maximum Correlation Analysis of
Nonlinear Combining Functions in Stream
Ciphers . . . . . . . . . . . . . . . . 301--314
Erez Petrank and
Charles Rackoff CBC MAC for Real-Time Data Sources . . . 315--338
Don Coppersmith and
Igor Shparlinski On Polynomial Approximation of the
Discrete Logarithm and the
Diffie--Hellman Mapping . . . . . . . . 339--360
David Pointcheval and
Jacques Stern Security Arguments for Digital
Signatures and Blind Signatures . . . . 361--396
Rosario Gennaro and
Tal Rabin and
Hugo Krawczyk RSA-Based Undeniable Signatures . . . . 397--416
Lars R. Knudsen A Detailed Analysis of SAFER K . . . . . 417--436
J. M. Pollard Kangaroos, Monopoly and Discrete
Logarithms . . . . . . . . . . . . . . . 437--447
Joan Boyar and
Ivan Damgård and
René Peralta Short Non-Interactive Cryptographic
Proofs . . . . . . . . . . . . . . . . . 449--472
Michael J. Jacobson, Jr. Computing Discrete Logarithms in
Quadratic Orders . . . . . . . . . . . . 473--492
Andrew Klapper On the Existence of Secure Keystream
Generators . . . . . . . . . . . . . . . 1--15
Joe Kilian and
Phillip Rogaway How to Protect DES Against Exhaustive
Key Search (an Analysis of DESX) . . . . 17--35
Giovanni Di Crescenzo and
Yuval Ishai and
Rafail Ostrovsky Universal Service-Providers for Private
Information Retrieval . . . . . . . . . 37--74
Don Coppersmith Weakness in Quaternion Signatures . . . 77--85
Serge Vaudenay Cryptanalysis of the Chor--Rivest
Cryptosystem . . . . . . . . . . . . . . 87--100
Dan Boneh and
Richard A. DeMillo and
Richard J. Lipton On the Importance of Eliminating Errors
in Cryptographic Computations . . . . . 101--119
Yongge Wang and
Yvo Desmedt Secure Communication in Multicast
Channels: The Answer to Franklin and
Wright's Question . . . . . . . . . . . 121--135
Dingfeng Ye and
Zongduo Dai and
Kwok-Yan Lam Decomposing Attacks on Asymmetric
Cryptography Based on Mapping
Compositions . . . . . . . . . . . . . . 137--150
Daniel V. Bailey and
Christof Paar Efficient Arithmetic in Finite Field
Extensions with Application in Elliptic
Curve Cryptography . . . . . . . . . . . 153--176
Mikael Goldmann and
Mats Näslund and
Alexander Russell Complexity Bounds on General Hard-Core
Predicates . . . . . . . . . . . . . . . 177--195
Thomas Jakobsen and
Lars R. Knudsen Attacks on Block Ciphers of Low
Algebraic Degree . . . . . . . . . . . . 197--210
Amos Fiat and
Tamir Tassa Dynamic Traitor Tracing . . . . . . . . 211--223
Thomas Scanlon Public Key Cryptosystems Based on
Drinfeld Modules Are Insecure . . . . . 225--230
Kaoru Kurosawa and
Thomas Johansson and
Douglas R. Stinson Almost $k$-Wise Independent Sample
Spaces and Their Cryptologic
Applications . . . . . . . . . . . . . . 231--253
Arjen K. Lenstra and
Eric R. Verheul Selecting Cryptographic Key Sizes . . . 255--293
Silvio Micali and
Leonid Reyzin Improving the Exact Security of Digital
Signature Schemes . . . . . . . . . . . 1--18
P. Gaudry and
F. Hess and
N. P. Smart Constructive and Destructive Facets of
Weil Descent on Elliptic Curves . . . . 19--46
Eli Biham and
Lars R. Knudsen Cryptanalysis of the ANSI X9.52 CBCM
Mode . . . . . . . . . . . . . . . . . . 47--59
A. A. Moldovyan and
N. A. Moldovyan A Cipher Based on Data-Dependent
Permutations . . . . . . . . . . . . . . 61--72
Victor Shoup and
Rosario Gennaro Securing Threshold Cryptosystems against
Chosen Ciphertext Attack . . . . . . . . 75--96
Moni Naor and
Omer Reingold Constructing Pseudo-Random Permutations
with a Prescribed Structure . . . . . . 97--102
Martín Abadi and
Phillip Rogaway Reconciling Two Views of Cryptography
(The Computational Soundness of Formal
Encryption) . . . . . . . . . . . . . . 103--127
Steven D. Galbraith Elliptic Curve Paillier Schemes . . . . 129--138
Anna M. Johnston and
Peter S. Gemmell Authenticated Key Exchange Provably
Secure Against the Man-in-the-Middle
Attack . . . . . . . . . . . . . . . . . 139--148
Phong Q. Nguyen and
Igor E. Shparlinski The Insecurity of the Digital Signature
Algorithm with Partially Known Nonces 151--176
Yehuda Lindell and
Benny Pinkas Privacy Preserving Data Mining . . . . . 177--206
Lars R. Knudsen The Security of Feistel Ciphers with Six
Rounds or Less . . . . . . . . . . . . . 207--222
Victor Shoup OAEP Reconsidered . . . . . . . . . . . 223--249
Dario Catalano and
Rosario Gennaro and
Nick Howgrave-Graham Paillier's Trapdoor Function Hides up to
$O(n)$ Bits . . . . . . . . . . . . . . 251--269
Mihir Bellare A Note on Negligible Functions . . . . . 271--284
S. S. Magliveras and
D. R. Stinson and
Tran van Trung New Approaches to Designing Public Key
Cryptosystems Using One-Way Functions
and Trapdoors in Finite Groups . . . . . 285--297
Steven Myers Efficient Amplification of the Security
of Weak Pseudo-Random Function
Generators . . . . . . . . . . . . . . . 1--24
Amos Beimel and
Shlomi Dolev Buses for Anonymous Message Delivery . . 25--39
Jovan Dj. Golic and
Renato Menicocci Edit Probability Correlation Attacks on
Stop/Go Clocked Keystream Generators . . 41--68
Oded Goldreich and
Vered Rosen On the Security of Modular
Exponentiation with Application to the
Construction of Pseudorandom Generators 71--93
Michael Ben-Or and
Dan Gutfreund Trading Help for Interaction in
Statistical Zero-Knowledge Proofs . . . 95--116
Siguna Müller A Probable Prime Test with Very High
Confidence for $n L 3 \bmod 4$ . . . . . 117--139
Yehuda Lindell Parallel Coin-Tossing and Constant-Round
Secure Two-Party Computation . . . . . . 143--184
M. Bellare and
C. Namprempre and
D. Pointcheval and
M. Semanko The One-More-RSA-Inversion Problems and
the Security of Chaum's Blind Signature
Scheme . . . . . . . . . . . . . . . . . 185--215
Gilles Brassard and
Claude Crépeau and
Stefan Wolf Oblivious Transfers and Privacy
Amplification . . . . . . . . . . . . . 219--237
Antoine Joux and
Kim Nguyen Separating Decision Diffie--Hellman from
Computational Diffie--Hellman in
Cryptographic Groups . . . . . . . . . . 239--247
Serge Vaudenay Decorrelation: A Theory for Block Cipher
Security . . . . . . . . . . . . . . . . 249--286
Adam Kalai Generating Random Factored Numbers,
Easily . . . . . . . . . . . . . . . . . 287--289
Oded Goldreich Preface . . . . . . . . . . . . . . . . 1--3
Stefan Dziembowski and
Ueli Maurer Optimal Randomizer Efficiency in the
Bounded-Storage Model . . . . . . . . . 5--26
Chi-Jen Lu Encryption against Storage-Bounded
Adversaries from On-Line Strong
Extractors . . . . . . . . . . . . . . . 27--42
Salil P. Vadhan Constructing Locally Computable
Extractors and Cryptosystems in the
Bounded-Storage Model . . . . . . . . . 43--77
Eiichiro Fujisaki and
Tatsuaki Okamoto and
David Pointcheval and
Jacques Stern RSA-OAEP Is Secure under the RSA
Assumption . . . . . . . . . . . . . . . 81--104
Michael J. Wiener The Full Cost of Cryptanalytic Attacks 105--124
Amos Beimel and
Yuval Ishai and
Tal Malkin Reducing the Servers --- Computation in
Private Information Retrieval: PIR with
Preprocessing . . . . . . . . . . . . . 125--151
Ran Canetti and
Ivan Damgård and
Stefan Dziembowski and
Yuval Ishai and
Tal Malkin Adaptive versus Non-Adaptive Security of
Multi-Party Protocols . . . . . . . . . 153--207
Gustav Hast Nearly One-Sided Tests and the
Goldreich--Levin Predicate . . . . . . . 209--229
Arjen K. Lenstra Preface . . . . . . . . . . . . . . . . 233--233
Victor S. Miller The Weil Pairing, and Its Efficient
Calculation . . . . . . . . . . . . . . 235--261
Antoine Joux A One Round Protocol for Tripartite
Diffie--Hellman . . . . . . . . . . . . 263--276
Eric R. Verheul Evidence that XTR Is More Secure than
Supersingular Elliptic Curve
Cryptosystems . . . . . . . . . . . . . 277--296
Dan Boneh and
Ben Lynn and
Hovav Shacham Short Signatures from the Weil Pairing 297--319
Paulo S. L. M. Barreto and
Ben Lynn and
Michael Scott Efficient Implementation of
Pairing-Based Cryptosystems . . . . . . 321--334
Moni Naor and
Benny Pinkas Computationally Secure Oblivious
Transfer . . . . . . . . . . . . . . . . 1--35
Matthias Fitzi and
Juan A. Garay and
Ueli Maurer and
others Minimal Complete Primitives for Secure
Multi-Party Computation . . . . . . . . 37--61
Henri Cohen Analysis of the Sliding Window Powering
Algorithm . . . . . . . . . . . . . . . 63--76
Régis Dupont and
Andreas Enge and
François Morain Building Curves with Arbitrary Small MOV
Degree over Finite Prime Fields . . . . 79--89
Rosario Gennaro An Improved Pseudo-Random Generator
Based on the Discrete Logarithm Problem 91--110
John Black and
Phillip Rogaway CBC MACs for Arbitrary-Length Messages:
The Three-Key Constructions . . . . . . 111--131
Hoi-Kwong Lo and
H. F. Chau and
M. Ardehali Efficient Quantum Key Distribution
Scheme and a Proof of Its Unconditional
Security . . . . . . . . . . . . . . . . 133--165
Tamir Tassa Low Bandwidth Dynamic Traitor Tracing
Schemes . . . . . . . . . . . . . . . . 167--183
Ran Canetti Preface . . . . . . . . . . . . . . . . 187--189
Jeffrey Considine and
Matthias Fitzi and
Matthew Franklin and
Leonid A. Levin and
Ueli Maurer and
David Metcalf Byzantine Agreement Given Partial
Broadcast . . . . . . . . . . . . . . . 191--217
Christian Cachin and
Klaus Kursawe and
Victor Shoup Random Oracles in Constantinople:
Practical Asynchronous Byzantine
Agreement Using Cryptography . . . . . . 219--246
Shafi Goldwasser and
Yehuda Lindell Secure Multi-Party Computation without
Agreement . . . . . . . . . . . . . . . 247--287
Eli Biham and
Alex Biryukov and
Adi Shamir Cryptanalysis of Skipjack Reduced to
$31$ Rounds Using Impossible
Differentials . . . . . . . . . . . . . 291--311
Adrian Kent Secure Classical Bit Commitment Using
Fixed Capacity Communication Channels 313--335
Joachim von zur Gathen and
Michael Nöcker Polynomial and Normal Bases for Finite
Fields . . . . . . . . . . . . . . . . . 337--355
Roberto M. Avanzi The Complexity of Certain
Multi-Exponentiation Techniques in
Cryptography . . . . . . . . . . . . . . 357--373
Lars R. Knudsen and
Chris J. Mitchell Partial Key Recovery Attack Against RMAC 375--389
Carlo Blundo and
Paolo D'Arco Analysis and Design of Distributed Key
Distribution Centers . . . . . . . . . . 391--414
Jan Denef and
Frederik Vercauteren An Extension of Kedlaya's Algorithm to
Hyperelliptic Curves in Characteristic
$2$ . . . . . . . . . . . . . . . . . . 1--25
Philip MacKenzie and
Thomas Shrimpton and
Markus Jakobsson Threshold Password-Authenticated Key
Exchange . . . . . . . . . . . . . . . . 27--66
Jonathan Katz and
Moti Yung Characterization of Security Notions for
Probabilistic Private-Key Encryption . . 67--95
Yan-Cheng Chang and
Chun-Yuan Hsiao and
Chi-Jen Lu The Impossibility of Basing One-Way
Permutations on Central Cryptographic
Primitives . . . . . . . . . . . . . . . 97--114
Edlyn Teske An Elliptic Curve Trapdoor System . . . 115--133
Ran Canetti and
Eyal Kushilevitz and
Yehuda Lindell On the Limitations of Universally
Composable Two-Party Computation Without
Set-Up Assumptions . . . . . . . . . . . 135--167
Juan A. Garay and
Philip MacKenzie and
Ke Yang Strengthening Zero-Knowledge Protocols
Using Signatures . . . . . . . . . . . . 169--209
Michael J. Jacobson and
Renate Scheidler and
Hugh C. Williams An Improved Real-Quadratic-Field-Based
Key Exchange Procedure . . . . . . . . . 211--239
Oded Goldreich and
Yehuda Lindell Session-Key Generation Using Human
Passwords Only . . . . . . . . . . . . . 241--340
Markus Bläser and
Andreas Jakoby and
Maciej Liskiewicz and
Bodo Manthey Private Computation: $k$-Connected
versus $1$-Connected Networks . . . . . 341--357
Yehuda Lindell A Simpler Construction of CCA2-Secure
Public-Key Encryption under General
Assumptions . . . . . . . . . . . . . . 359--377
Eli Biham and
Michel Boyer and
P. Oscar Boykin and
Tal Mor and
Vwani Roychowdhury A Proof of the Security of Quantum Key
Distribution . . . . . . . . . . . . . . 381--439
Deukjo Hong and
Seokhie Hong and
Wonil Lee and
Sangjin Lee and
Jongin Lim and
Jaechul Sung and
Okyeon Yi Known-IV, Known-in-Advance-IV, and
Replayed-and-Known-IV Attacks on
Multiple Modes of Operation of Block
Ciphers . . . . . . . . . . . . . . . . 441--462
Marc Girault and
Guillaume Poupard and
Jacques Stern On the Fly Authentication and Signature
Schemes Based on Groups of Unknown Order 463--487
Ivan Bjerre Damgard and
Gudmund Skovbjerg Frandsen An Extended Quadratic Frobenius
Primality Test with Average- and
Worst-Case Error Estimate . . . . . . . 489--520
Danny Harnik and
Moni Naor and
Omer Reingold and
Alon Rosen Completeness in Two-Party Secure
Computation: A Computational View . . . 521--552
Florian Luca and
Igor E. Shparlinski Elliptic Curves with Low Embedding
Degree . . . . . . . . . . . . . . . . . 553--562
Anonymous Editor's Note . . . . . . . . . . . . . 1--1
Neal Koblitz and
Alfred J. Menezes Another Look at ``Provable Security'' 3--37
Jean-Sebastien Coron and
Alexander May Deterministic Polynomial-Time
Equivalence of Computing the RSA Secret
Key and Factoring . . . . . . . . . . . 39--50
Rosario Gennaro and
Stanislaw Jarecki and
Hugo Krawczyk and
Tal Rabin Secure Distributed Key Generation for
Discrete-Log Based Cryptosystems . . . . 51--83
Jonathan Katz and
Moti Yung Scalable Protocols for Authenticated
Group Key Exchange . . . . . . . . . . . 85--113
Dario Catalano and
David Pointcheval and
Thomas Pornin Trapdoor Hard-to-Invert Group
Isomorphisms and Their Application to
Password-Based Authentication . . . . . 115--149
Johan Hastad The Security of the IAPM and IACBC Modes 153--163
Yan Zong Ding and
Danny Harnik and
Alon Rosen and
Ronen Shaltiel Constant-Round Oblivious Transfer in the
Bounded Storage Model . . . . . . . . . 165--202
Joonsang Baek and
Ron Steinfeld and
Yuliang Zheng Formal Proofs for the Security of
Signcryption . . . . . . . . . . . . . . 203--235
Tamir Tassa Hierarchical Threshold Secret Sharing 237--264
Ran Canetti and
Shai Halevi and
Jonathan Katz A Forward-Secure Public-Key Encryption
Scheme . . . . . . . . . . . . . . . . . 265--294
Amos Beimel and
Yoav Stahl Robust Information-Theoretic Private
Information Retrieval . . . . . . . . . 295--321
Carlo Blundo and
Paolo D'Arco and
Alfredo De Santis and
Douglas Stinson On Unconditionally Secure Distributed
Oblivious Transfer . . . . . . . . . . . 323--373
Qi Cheng Primality Proving via One Round in ECPP
and One Iteration in AKS . . . . . . . . 375--387
Boaz Tsaban Theoretical Cryptanalysis of the
Klimov--Shamir Number Generator TF-1 . . 389--392
Rosario Gennaro and
Tal Rabin and
Stanislav Jarecki and
Hugo Krawczyk Robust and Efficient Sharing of RSA
Functions . . . . . . . . . . . . . . . 393--393
Rosario Gennaro and
Tal Rabin and
Hugo Krawczyk RSA-Based Undeniable Signatures . . . . 394--394
Martin Abadi and
Phillip Rogaway Reconciling Two Views of Cryptography
(The Computational Soundness of Formal
Encryption) . . . . . . . . . . . . . . 395--395
Rafail Ostrovsky and
William E. Skeith Private Searching on Streaming Data . . 397--430
Yael Tauman Kalai and
Yehuda Lindell and
Manoj Prabhakaran Concurrent Composition of Secure
Protocols in the Timing Model . . . . . 431--492
Eu-Jin Goh and
Stanislaw Jarecki and
Jonathan Katz and
Nan Wang Efficient Signature Schemes with Tight
Reductions to the Diffie--Hellman
Problems . . . . . . . . . . . . . . . . 493--514
Johan Håstad and
Mats Näslund Practical Construction and Analysis of
Pseudo-Randomness Primitives . . . . . . 1--26
D. Coppersmith and
J. S. Coron and
F. Grieu and
S. Halevi and
C. Jutla and
D. Naccache and
J. P. Stern Cryptanalysis of ISO/IEC 9796-1 . . . . 27--51
Minh-Huyen Nguyen and
Salil Vadhan Simpler Session-Key Generation from
Short Random Passwords . . . . . . . . . 52--96
Masayuki Abe and
Rosario Gennaro and
Kaoru Kurosawa Tag-KEM/DEM: A New Framework for Hybrid
Encryption . . . . . . . . . . . . . . . 97--130
Ali Aydìn Selçuk On Probability of Success in Linear and
Differential Cryptanalysis . . . . . . . 131--147
Dan Boneh and
Xavier Boyen Short Signatures Without Random Oracles
and the SDH Assumption in Bilinear
Groups . . . . . . . . . . . . . . . . . 149--177
K. Bentahar and
P. Farshim and
J. Malone-Lee and
N. P. Smart Generic Constructions of Identity-Based
and Certificateless KEMs . . . . . . . . 178--199
Yehuda Lindell Lower Bounds and Impossibility Results
for Concurrent Self Composition . . . . 200--249
Jérôme Renault and
Tristan Tomala Probabilistic Reliability and Privacy of
Communication Using Multicast in General
Neighbor Networks . . . . . . . . . . . 250--279
R. Overbeck Structural Attacks for Public Key
Cryptosystems based on Gabidulin Codes 280--301
Jonathan Katz and
Yehuda Lindell Handling Expected Polynomial-Time
Strategies in Simulation-Based Security
Proofs . . . . . . . . . . . . . . . . . 303--349
Michel Abdalla and
Mihir Bellare and
Dario Catalano and
Eike Kiltz and
Tadayoshi Kohno and
Tanja Lange and
John Malone-Lee and
Gregory Neven and
Pascal Paillier and
Haixia Shi Searchable Encryption Revisited:
Consistency Properties, Relation to
Anonymous IBE, and Extensions . . . . . 350--391
Elad Barkan and
Eli Biham and
Nathan Keller Instant Ciphertext-Only Cryptanalysis of
GSM Encrypted Communication . . . . . . 392--429
Yi Lu and
Serge Vaudenay Cryptanalysis of an E0-like Combiner
with Memory . . . . . . . . . . . . . . 430--457
Francesco Matucci Cryptanalysis of the Shpilrain--Ushakov
Protocol for Thompson's Group . . . . . 458--468