EUROCRYPT 2008: Istanbul, Turkey

• Sebastiaan Indesteege, Nathan Keller, Orr Dunkelman, Eli Biham, Bart Preneel:
  A Practical Attack on KeeLoq. 1-18
  
• Pierre-Alain Fouque, Gilles Macario-Rat, Jacques Stern:
  Key Recovery on Hidden Monomial Multivariate Schemes. 19-30
  
• Nicolas Gama, Phong Q. Nguyen:
  Predicting Lattice Reduction. 31-51
  
• Gregory Neven:
  Efficient Sequential Aggregate Signed Data. 52-69
  
• Daniel J. Bernstein:
  Proving Tight Security for Rabin-Williams Signatures. 70-87
  
• Rosario Gennaro, Shai Halevi, Hugo Krawczyk, Tal Rabin:
  Threshold RSA for Dynamic and Ad-Hoc Groups. 88-107
  
• Dennis Hofheinz, Dominique Unruh:
  Towards Key-Dependent Message Security in the Standard Model. 108-126
  
• David Cash, Eike Kiltz, Victor Shoup:
  The Twin Diffie-Hellman Problem and Applications. 127-145
  
• Jonathan Katz, Amit Sahai, Brent Waters:
  Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products. 146-162
  
• Benjamin Smith:
  Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves. 163-180
  
• Guido Bertoni, Joan Daemen, Michael Peeters, Gilles Van Assche:
  On the Indifferentiability of the Sponge Construction. 181-197
  
• Yevgeniy Dodis, Krzysztof Pietrzak, Prashant Puniya:
  A New Mode of Operation for Block Ciphers and Length-Preserving MACs. 198-219
  
• Phillip Rogaway, John P. Steinberger:
  Security/Efficiency Tradeoffs for Permutation-Based Hashing. 220-236
  
• Lei Wang, Kazuo Ohta, Noboru Kunihiro:
  New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5. 237-253
  
• Jean-Pierre Tillich, Gilles Zémor:
  Collisions for the LPS Expander Graph Hash Function. 254-269
  
• Elena Andreeva, Charles Bouillaguet, Pierre-Alain Fouque, Jonathan J. Hoch, John Kelsey, Adi Shamir, Sébastien Zimmer:
  Second Preimage Attacks on Dithered Hash Functions. 270-288
  
• Vipul Goyal, Payman Mohassel, Adam Smith:
  Efficient Two Party and Multi Party Computation Against Covert Adversaries. 289-306
  
• Juan A. Garay, Rafail Ostrovsky:
  Almost-Everywhere Secure Computation. 307-323
  
• Kaoru Kurosawa, Kazuhiro Suzuki:
  Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme. 324-340
  
• Boaz Barak, Sharon Goldberg, David Xiao:
  Protocols and Lower Bounds for Failure Localization in the Internet. 341-360
  
• Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin:
  HB^#: Increasing the Security and Efficiency of HB⁺. 361-378
  
• Jens Groth, Yuval Ishai:
  Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle. 379-396
  
• Omkant Pandey, Rafael Pass, Amit Sahai, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam:
  Precise Concurrent Zero Knowledge. 397-414
  
• Jens Groth, Amit Sahai:
  Efficient Non-interactive Proof Systems for Bilinear Groups. 415-432
  
• Dario Catalano, Dario Fiore, Mariagrazia Messina:
  Zero-Knowledge Sets with Short Proofs. 433-450
  
• Hao Chen, Ronald Cramer, Robbert de Haan, Ignacio Cascudo Pueyo:
  Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves. 451-470
  
• Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, Daniel Wichs:
  Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. 471-488
  
• Ran Canetti, Ronny Ramzi Dakdouk:
  Obfuscating Point Functions with Multibit Output. 489-508
  
• Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs:
  Isolated Proofs of Knowledge and Isolated Zero Knowledge. 509-526
  
• Tal Moran, Gil Segev:
  David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. 527-544
  
• Nishanth Chandran, Vipul Goyal, Amit Sahai:
  New Constructions for UC Secure Computation Using Tamper-Proof Hardware. 545-562
  

Last update Wed Feb 15 04:05:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page