Cantitate/Preț
Produs

Security and Cryptography for Networks: 7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010, Proceedings: Lecture Notes in Computer Science, cartea 6280

Editat de Juan A. Garay, Roberto De Prisco
en Limba Engleză Paperback – sep 2010

Din seria Lecture Notes in Computer Science

Preț: 33703 lei

Preț vechi: 42128 lei
-20% Nou

Puncte Express: 506

Preț estimativ în valută:
6450 6805$ 5375£

Carte disponibilă

Livrare economică 12-26 decembrie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642153167
ISBN-10: 364215316X
Pagini: 474
Ilustrații: VII, 474 p. 54 illus.
Greutate: 0.91 kg
Ediția:2010
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

Encryption I.- Time-Specific Encryption.- Public-Key Encryption with Efficient Amortized Updates.- Generic Constructions of Parallel Key-Insulated Encryption.- Invited Talk.- Heuristics and Rigor in Lattice-Based Cryptography.- Cryptanalysis.- Differential Fault Analysis of LEX.- Generalized RC4 Key Collisions and Hash Collisions.- Hash Functions.- On the Indifferentiability of the Grøstl Hash Function.- Side Channel Attacks and Leakage Resilience.- Algorithmic Tamper-Proof Security under Probing Attacks.- Leakage-Resilient Storage.- Encryption II.- Searching Keywords with Wildcards on Encrypted Data.- Threshold Attribute-Based Signcryption.- Cryptographic Protocols I.- Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption.- Improved Primitives for Secure Multiparty Integer Computation.- How to Pair with a Human.- Authentication and Key Agreement.- A New Security Model for Authenticated Key Agreement.- A Security Enhancement and Proof for Authentication and Key Agreement (AKA).- Authenticated Key Agreement with Key Re-use in the Short Authenticated Strings Model.- Cryptographic Primitives and Schemes.- Kleptography from Standard Assumptions and Applications.- Provably Secure Convertible Undeniable Signatures with Unambiguity.- History-Free Aggregate Message Authentication Codes.- Lattice-Based Cryptography.- Recursive Lattice Reduction.- Adaptively Secure Identity-Based Identification from Lattices without Random Oracles.- Groups Signatures and Authentication.- The Fiat–Shamir Transform for Group and Ring Signature Schemes.- Get Shorty via Group Signatures without Encryption.- Group Message Authentication.- Cryptographic Protocols II.- Fast Secure Computation of Set Intersection.- Distributed Private-Key Generators for Identity-BasedCryptography.- Anonymity.- Solving Revocation with Efficient Update of Anonymous Credentials.

Caracteristici

up-to-date results fast track conference proceedings state-of-the-art report