|
|
|
Accepted Papers |
|
EuroCrypt 2008 Accepted Submissions
Isolated Proofs of Knowledge and Isolated Zero Knowledge
Ivan Damgaard and Jesper Buus Nielsen and Daniel Wichs
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
Kaoru Kurosawa and Kazuhiro Suzuki
A Practical Attack on KeeLoq
Eli Biham and Orr Dunkelman and Sebastiaan Indesteege and Nathan Keller and Bart Preneel
Collisions for the LPS expander graph hash function
Jean-Pierre Tillich and Gilles Zemor
Protocols and Lower Bounds for Fault Localization in the Internet
Boaz Barak and Sharon Goldberg and David Xiao
Towards Key-Dependent Message Security in the Standard Model
Dennis Hofheinz and Dominique Unruh
The Twin Diffie-Hellman Problem and Applications
David Cash and Eike Kiltz and Victor Shoup
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
Ronald Cramer and Yevgeniy Dodis and Serge Fehr and Carles Padro and Daniel Wichs
HB#: Increasing the Security and Efficiency of HB+
Henri Gilbert and Matthew J.B. Robshaw and Yannick Seurin
Zero Knowledge Sets with short proofs
Dario Catalano and Dario Fiore and Mariagrazia Messina
On the Indifferentiability of the Sponge Construction
Guido Bertoni and Joan Daemen and Michael Peeters and Gilles Van Assche
Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves
Benjamin Smith
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
Jens Groth and Yuval Ishai
Second Preimage Attacks on Dithered Hash Functions
Elena Andreeva and Charles Bouillaguet and Pierre-Alain Fouque and Jonathan J. Hoch and John Kelsey and Adi Shamir and Sebastien Zimmer
Key Recovery on Hidden Monomial Multivariate Schemes
P.A. Fouque and G. Macario-Rat and J. Stern
Efficient Sequential Aggregate Signed Data
Gregory Neven
Strongly Multiplicative Ramp Schemes From High Degree Rational Points on Curves
Hao Chen and Ronald Cramer and Robbert de Haan and Ignacio Cascudo Pueyo
Predicting Lattice Reduction
Nicolas Gama and Phong Q. Nguyen
Almost-everywhere Secure Computation
Juan Garay and Rafail Ostrovsky
Proving tight security for Rabin/Williams signatures
Daniel J. Bernstein
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Jonathan Katz and Amit Sahai and Brent Waters
Security/Efficiency Tradeoffs for Permutation-Based Hashing
Phillip Rogaway and John Steinberger
Threshold RSA for Dynamic and Ad-Hoc Groups
Rosario Gennaro and Shai Halevi and Hugo Krawczyk and Tal Rabin
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
Tal Moran and Gil Segev
New Constructions for UC Secure Computation using Tamper-proof Hardware
Nishanth Chandran and Vipul Goyal and Amit Sahai
Digital Lockers: Obfuscating Point Functions with Multibit Output
Ran Canetti and Ronny R. Dakdouk
Precise Concurrent Zero Knowledge
Omkant Pandey and Rafael Pass and Amit Sahai and Wei-Lung Dustin Tseng and Muthuramakrishnan Venkitasubramaniam
Efficient Two- and Multi-party Computation against Covert Adversaries
Vipul Goyal and Payman Mohassel and Adam Smith
New Key Recovery Attack on HMAC/NMAC-MD4 and NMAC-MD5
Lei Wang and Kazuo Ohta and Noboru Kunihiro
A New Mode of Operation for Block Ciphers and Length-Preserving MACs
Yevgeniy Dodis and and Krzysztof Pietrzak and Prashant Puniya
Efficient Non-interactive Proof Systems for Bilinear Groups
Jens Groth and Amit Sahai
|
|
|
|
|
|