Cryptanalysis I

• 
  Dan Boneh, Glenn Durfee: Cryptanalysis of RSA with Private Key d Less than N^0.292. 1-11
• 
  Eli Biham, Alex Biryukov, Adi Shamir: Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials. 12-23

Hash Functions

• 
  Wim Nevelsteen, Bart Preneel: Software Performance of Universal Hash Functions. 24-41

Foundations I

• 
  Yevgeniy Dodis, Silvio Micali: Lower Bounds for Oblivious Transfer Reductions. 42-55
• 
  Ivan Damgård, Joe Kilian, Louis Salvail: On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions. 56-73
• 
  Giovanni Di Crescenzo, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan: Conditional Oblivious Transfer and Timed-Release Encryption. 74-89

Public Key

• 
  Ran Canetti, Shafi Goldwasser: An Efficient Threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack. 90-106
• 
  Jan Camenisch, Markus Michels: Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes. 107-122
• 
  Rosario Gennaro, Shai Halevi, Tal Rabin: Secure Hash-and-Sign Signatures Without the Random Oracle. 123-139

Watermarking and Fingerprinting

• 
  Funda Ergün, Joe Kilian, Ravi Kumar: A Note on the Limits of Collusion-Resistant Watermarks. 140-149
• 
  Birgit Pfitzmann, Ahmad-Reza Sadeghi: Coin-Based Anonymous Fingerprinting. 150-164

Elliptic Curves

• 
  Nigel P. Smart: On the Performance of Hyperelliptic Cryptosystems. 165-175
• 
  Tetsutaro Kobayashi, Hikaru Morita, Kunio Kobayashi, Fumitaka Hoshino: Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic. 176-189
• 
  Ryuichi Harasawa, Junji Shikata, Joe Suzuki, Hideki Imai: Comparing the MOV and FR Reductions in Elliptic Curve Cryptography. 190-205

New Schemes

• 
  Aviad Kipnis, Jacques Patarin, Louis Goubin: Unbalanced Oil and Vinegar Signature Schemes. 206-222
• 
  Pascal Paillier: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. 223-238
• 
  David Pointcheval: New Public Key Cryptosystems Based on the Dependent-RSA Problems. 239-254

Block Ciphers

• 
  Serge Vaudenay: Resistance Against General Iterated Attacks. 255-271
• 
  Philip Hawkes, Luke O'Connor: XOR and Non-XOR Differential Probabilities. 272-285
• 
  Jung Hee Cheon, Seongtaek Chee, Choonsik Park: S-boxes with Controllable Nonlinearity. 286-294

Distributed Cryptography

• 
  Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin: Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. 295-310
• 
  Ronald Cramer, Ivan Damgård, Stefan Dziembowski, Martin Hirt, Tal Rabin: Efficient Multiparty Computations Secure Against an Adaptive Adversary. 311-326
• 
  Moni Naor, Benny Pinkas, Omer Reingold: Distributed Pseudo-random Functions and KDCs. 327-346

Cryptanalysis II

• 
  Thomas Johansson, Fredrik Jönsson: Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes. 347-362
• 
  Lars R. Knudsen, Willi Meier: Cryptanalysis of an Identification Scheme Based on the Permuted Perceptron Problem. 363-374

Tools from Related Areas

• 
  Luke O'Connor: An Analysis of Exponentiation Based on Formal Languages. 375-388
• 
  Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki: Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key. 389-401

Foundations II

• 
  Christian Cachin, Silvio Micali, Markus Stadler: Computationally Private Information Retrieval with Polylogarithmic Communication. 402-414
• 
  Ransom Richardson, Joe Kilian: On the Concurrent Composition of Zero-Knowledge Proofs. 415-431
• 
  Marc Fischlin: Pseudorandom Function Tribe Ensembles Based on One-Way Permutations: Improvements and Applications. 432-445

Broadcast and Multicast

• 
  Yongge Wang, Yvo Desmedt: Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question. 446-458
• 
  Ran Canetti, Tal Malkin, Kobbi Nissim: Efficient Communication-Storage Tradeoffs for Multicast Encryption. 459-474

last updated on Mon May 20 01:58:06 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page