Cover Image

Advances in Cryptology – EUROCRYPT 2008 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008, Proceedings /

Corporate Author: SpringerLink (Online service)
Other Authors: Smart, Nigel. (Editor, http://id.loc.gov/vocabulary/relators/edt)
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
Edition:1st ed. 2008.
Series:Security and Cryptology ; 4965
Subjects:
Data encryption (Computer science).
Computer communication systems.
Computer security.
Algorithms.
Computer science—Mathematics.
Management information systems.
Computer science.
Cryptology.
Computer Communication Networks.
Systems and Data Security.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Management of Computing and Information Systems.
Online Access:https://doi.org/10.1007/978-3-540-78967-3
Table of Contents:
  • A 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.

Similar Items