Applied Cryptography and Network Security: Third International Conference, ACNS 2005, New York, NY, USA, June 7-10, 2005, Proceedings: Lecture Notes in Computer Science, cartea 3531
Editat de John Ioannidis, Angelos D. Keromytis, Moti Yungen Limba Engleză Paperback – 30 mai 2005
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 340.32 lei
- 20% Preț: 341.95 lei
- 20% Preț: 453.32 lei
- 20% Preț: 238.01 lei
- 20% Preț: 340.32 lei
- 20% Preț: 438.69 lei
- Preț: 449.57 lei
- 20% Preț: 343.62 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 645.28 lei
- 17% Preț: 427.22 lei
- 20% Preț: 655.02 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 591.51 lei
- Preț: 381.21 lei
- 20% Preț: 337.00 lei
- 15% Preț: 438.59 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 575.48 lei
- 20% Preț: 583.40 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 353.50 lei
- 20% Preț: 585.88 lei
- Preț: 410.88 lei
- 20% Preț: 596.46 lei
- 20% Preț: 763.23 lei
- 20% Preț: 825.93 lei
- 20% Preț: 649.49 lei
- 20% Preț: 350.21 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 657.99 lei
Preț vechi: 822.50 lei
-20% Nou
Puncte Express: 987
Preț estimativ în valută:
125.92€ • 129.91$ • 106.57£
125.92€ • 129.91$ • 106.57£
Carte tipărită la comandă
Livrare economică 04-18 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540262237
ISBN-10: 3540262237
Pagini: 548
Ilustrații: XII, 530 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.76 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540262237
Pagini: 548
Ilustrații: XII, 530 p.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.76 kg
Ediția:2005
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Two-Server Password-Only Authenticated Key Exchange.- Strengthening Password-Based Authentication Protocols Against Online Dictionary Attacks.- Cryptanalysis of an Improved Client-to-Client Password-Authenticated Key Exchange (C2C-PAKE) Scheme.- Efficient Security Mechanisms for Overlay Multicast-Based Content Distribution.- A Traitor Tracing Scheme Based on RSA for Fast Decryption.- N-Party Encrypted Diffie-Hellman Key Exchange Using Different Passwords.- Messin’ with Texas Deriving Mother’s Maiden Names Using Public Records.- Mitigating Network Denial-of-Service Through Diversity-Based Traffic Management.- Searching for High-Value Rare Events with Uncheatable Grid Computing.- Digital Signatures Do Not Guarantee Exclusive Ownership.- Thompson’s Group and Public Key Cryptography.- Rainbow, a New Multivariable Polynomial Signature Scheme.- Badger – A Fast and Provably Secure MAC.- IDS False Alarm Reduction Using Continuous and Discontinuous Patterns.- Indexing Information for Data Forensics.- Model Generalization and Its Implications on Intrusion Detection.- Intrusion-Resilient Secure Channels.- Optimal Asymmetric Encryption and Signature Paddings.- Efficient and Leakage-Resilient Authenticated Key Transport Protocol Based on RSA.- Identity Based Encryption Without Redundancy.- OACerts: Oblivious Attribute Certificates.- Dynamic k-Times Anonymous Authentication.- Efficient Anonymous Roaming and Its Security Analysis.- Quantifying Security in Hybrid Cellular Networks.- Off-Line Karma: A Decentralized Currency for Peer-to-peer and Grid Applications.- Building Reliable Mix Networks with Fair Exchange.- SCARE of the DES.- Robust Key Extraction from Physical Uncloneable Functions.- Efficient Constructions for One-Way Hash Chains.- Privacy Preserving Keyword Searches on Remote Encrypted Data.- An Efficient Solution to the Millionaires’ Problem Based on Homomorphic Encryption.- Non-interactive Zero-Knowledge Arguments for Voting.- Short Signature and Universal Designated Verifier Signature Without Random Oracles.- Efficient Identity Based Ring Signature.- New Signature Schemes with Coupons and Tight Reduction.
Caracteristici
Includes supplementary material: sn.pub/extras