Beschreibung
These are the proceedings of Eurocrypt 2008, the 27th Annual IACR Eu- crypt Conference. The conference was sponsored by the International Asso- ation for Cryptologic Research (www.iacr.org), this year in cooperation with Tubitak (www.tubitak.gov.tr). The Eurocrypt 2008 Program Committee (PC) consisted of 28 members whose names are listed on the next page. There were 163 papers submitted to the conference and the PC chose 31 of them. Each paper was assigned to at least three PC members, who either handled it themselves or assigned it to an external referee. After the reviews were submitted, the committee deliberated both online for severalweeks and?nally ina face-to-facemeetingheldinBristol. Papers were refereed anonymously, with PC papers having a minimum of ?ve reviewers. All of our deliberations were aided by theWeb Submission and- viewSoftware written and maintainedby Shai Halevi. In addition to noti?cation of the decision of the committee, authors received reviews; the default for any report given to the committee was that it should be available to the authors as well.
Autorenporträt
InhaltsangabeA Practical Attack on KeeLoq.- Key Recovery on Hidden Monomial Multivariate Schemes.- Predicting Lattice Reduction.- Efficient Sequential Aggregate Signed Data.- Proving Tight Security for Rabin-Williams Signatures.- Threshold RSA for Dynamic and Ad-Hoc Groups.- Towards Key-Dependent Message Security in the Standard Model.- The Twin Diffie-Hellman Problem and Applications.- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products.- Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves.- On the Indifferentiability of the Sponge Construction.- A New Mode of Operation for Block Ciphers and Length-Preserving MACs.- Security/Efficiency Tradeoffs for Permutation-Based Hashing.- New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5.- Collisions for the LPS Expander Graph Hash Function.- Second Preimage Attacks on Dithered Hash Functions.- Efficient Two Party and Multi Party Computation Against Covert Adversaries.- Almost-Everywhere Secure Computation.- Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme.- Protocols and Lower Bounds for Failure Localization in the Internet.-: Increasing the Security and Efficiency of.- Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle.- Precise Concurrent Zero Knowledge.- Efficient Non-interactive Proof Systems for Bilinear Groups.- Zero-Knowledge Sets with Short Proofs.- Strongly Multiplicative Ramp Schemes from High Degree Rational Points on Curves.- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors.- Obfuscating Point Functions with Multibit Output.- Isolated Proofs of Knowledge and Isolated Zero Knowledge.- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware.- New Constructions for UC Secure Computation Using Tamper-Proof Hardware.
