Cantitate/Preț
Produs

Advances in Cryptology – EUROCRYPT 2008: 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008, Proceedings: Lecture Notes in Computer Science, cartea 4965

Editat de Nigel Smart
en Limba Engleză Paperback – 28 mar 2008

Din seria Lecture Notes in Computer Science

Preț: 40701 lei

Nou

Puncte Express: 611

Preț estimativ în valută:
7789 8036$ 6592£

Carte tipărită la comandă

Livrare economică 05-19 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540789666
ISBN-10: 3540789669
Pagini: 584
Ilustrații: XIII, 564 p.
Dimensiuni: 155 x 235 x 38 mm
Greutate: 0.86 kg
Ediția:2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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 PartiesUsing Tamper-Proof Hardware.- New Constructions for UC Secure Computation Using Tamper-Proof Hardware.