Front matter
1-11
Cryptanalysis of RSA with Private Key
d
Less than
N
0.292
Dan Boneh and Glenn Durfee
12-23
Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
Eli Biham, Alex Biryukov and Adi Shamir
24-41
Software Performance of Universal Hash Functions
Wim Nevelsteen and Bart Preneel
42-55
Lower Bounds for Oblivious Transfer Reductions
Yevgeniy Dodis and Silvio Micali
56-73
On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions
Ivan Damgård, Joe Kilian and Louis Salvail
74-89
Conditional Oblivious Transfer and Timed-Release Encryption
Giovanni Di Crescenzo, Rafail Ostrovsky and Sivaramakrishnan Rajagopalan
90-106
An Efficient
threshold
Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
Ran Canetti and Shafi Goldwasser
107-122
Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
Jan Camenisch and Markus Michels
123-139
Secure Hash-and-Sign Signatures Without the Random Oracle
Rosario Gennaro, Shai Halevi and Tal Rabin
140-149
A Note on the Limits of Collusion-Resistant Watermarks
Funda Ergun, Joe Kilian and Ravi Kumar
150-164
Coin-Based Anonymous Fingerprinting
Birgit Pfitzmann and Ahmad-Reza Sadeghi
165-175
On the Performance of Hyperelliptic Cryptosystems
Nigel P. Smart
176-189
Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
Tetsutaro Kobayashi, Hikaru Morita, Kunio Kobayashi and Fumitaka Hoshino
190-205
Comparing the MOV and FR Reductions in Elliptic Curve Cryptography
Ryuichi Harasawa, Junji Shikata, Joe Suzuki and Hideki Imai
206-222
Unbalanced Oil and Vinegar Signature Schemes
Aviad Kipnis, Jacques Patarin and Louis Goubin
223-238
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Pascal Paillier
239-254
New Public Key Cryptosystems Based on the Dependent-RSA Problems
David Pointcheval
255-271
Resistance Against General Iterated Attacks
Serge Vaudenay
272-285
XOR and Non-XOR Differential Probabilities
Philip Hawkes and Luke O’Connor
286-294
S-boxes with Controllable Nonlinearity
Jung Hee Cheon, Seongtaek Chee and Choonsik Park
925-963
Secure Distributed Key Generation for Discrete-Log Based Cryptosystems
Rosario Gennaro, Stanisław Jarecki, Hugo Krawczyk and Tal Rabin
311-326
Efficient Multiparty Computations Secure Against an Adaptive Adversary
Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt and Tal Rabin
327-346
Distributed Pseudo-random Functions and KDCs
Moni Naor, Benny Pinkas and Omer Reingold
347-362
Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes
Thomas Johansson and Fredrik Jönsson
363-374
Cryptanalysis of an Identification Scheme Based on the Permuted Perceptron Problem
Lars R. Knudsen and Willi Meier
375-388
An Analysis of Exponentiation Based on Formal Languages
Luke O’Connor
389-401
Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key (Extended Abstract)
Takaaki Mizuki, Hiroki Shizuya and Takao Nishizeki
402-414
Computationally Private Information Retrieval with Polylogarithmic Communication
Christian Cachin, Silvio Micali and Markus Stadler
415-431
On the Concurrent Composition of Zero-Knowledge Proofs
Ransom Richardson and Joe Kilian
432-445
Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications
Marc Fischlin
446-458
Secure Communication in Broadcast Channels: The Answer to Franklin and Wright’s Question
Yongge Wang and Yvo Desmedt
459-474
Efficient Communication-Storage Tradeoffs for Multicast Encryption
Ran Canetti, Tal Malkin and Kobbi Nissim
Back matter