Security and Cryptography for Networks 7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Garay, Juan A. (Επιμελητής έκδοσης), Prisco, Roberto De (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Σειρά: Lecture Notes in Computer Science, 6280
• Θέματα: Computer science.; Computer communication systems.; Computer security.; Data encryption (Computer science).; Algorithms.; Computers and civilization.; Management information systems.; Computer Science.; Systems and Data Security.; Data Encryption.; Computer Communication Networks.; Management of Computing and Information Systems.; Algorithm Analysis and Problem Complexity.; Computers and Society.

Πίνακας περιεχομένων:

• 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-Based Cryptography
• Anonymity
• Solving Revocation with Efficient Update of Anonymous Credentials.