Topics in Cryptology - CT- RSA 2013

The Cryptographer`s Track at RSA Conference 2013, San Francisco, CA, USA, February 25- March 1, 2013, Proceedings

Häftad, Engelska, 2013

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the refereed proceedings of the Cryptographers' Track at the RSA Conference 2013, CT-RSA 2013, held in San Francisco, CA, USA, in February/March 2013. The 25 revised full papers presented were carefully reviewed and selected from 89 submissions. The papers are grouped into topical sections covering: side channel attacks, digital signatures, public-key encryption, cryptographic protocols, secure implementation methods, symmetric key primitives, and identity-based encryption.

Produktinformation

Utgivningsdatum2013-01-02
Mått155 x 235 x 23 mm
Vikt633 g
FormatHäftad
SpråkEngelska
SerieSecurity and Cryptology
Antal sidor405
Upplaga2013
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783642360947

Tillhör följande kategorier

Tillämpad datateknik inom Data och it
Operativsystem inom Data och it
Hårdvara inom Data och it
E-handel inom Ekonomi och ledarskap
Nätverk och kommunikation inom Data och it
Referensverk och tvärvetenskap inom Samhalle och politik
IT-säkerhet inom Data och it

Side Channel Attacks I.- Horizontal and Vertical Side-Channel Attacks against Secure RSA Implementations.-Timing Attack against Protected RSA-CRT Implementation Used in PolarSSL.- Digital Signatures I.-Fair Exchange of Short Signatures without Trusted Third Party.- Fully Secure Attribute-Based Systems with Short Ciphertexts/Signatures and Threshold Access Structures.- Public-Key Encryption I.- Robust and Plaintext-Aware Variant of Signed ElGamal Encryption.- Efficient Public Key Cryptosystem Resilient to Key Leakage Chosen Ciphertext Attacks.- Cryptographic Protocols I.- Simple, Efficient and Strongly KI-Secure Hierarchical Key Assignment Schemes.- Randomized Partial Checking Revisited.- Secure Implementation Methods.- Randomly Failed! The State of Randomness in Current Java Implementations.- Efficient Vector Implementations of AES-Based Designs: A Case Study and New Implementations for Grøstl.- Symmetric Key Primitives I.- Collisions for the WIDEA-8 Compression Function.- Finding Collisions for Round-Reduced SM3.- Many Weak Keys for PRINTcipher: Fast Key Recovery and Countermeasures.- Side Channel Attacks II.- Applying Remote Side-Channel Analysis Attacks on a Security-Enabled NFC Tag.- Practical Leakage-Resilient Pseudorandom Objects with Minimum Public Randomness.- Cryptographic Protocols II.- Cryptanalytic Attacks on MIFARE Classic Protocol.- Asynchronous Computational VSS with Reduced Communication Complexity.- Public-Key Encryption II.-Proxy Re-Encryption in a Stronger Security Model Extended from CT-RSA2012.- Solving BDD by Enumeration: An Update.- Identity-Based Encryption.- The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions.- Accountable Authority Identity-Based Encryption with Public Traceability.- Efficient Delegation of Key Generation and Revocation Functionalities in Identity-Based Encryption.- Symmetric Key Primitives II.- The Low-Call Diet: Authenticated Encryption for Call Counting HSM Users.- A FullyHomomorphic Cryptosystem with Approximate Perfect Secrecy.- Weak Keys of the Full MISTY1 Block Cipher for Related-Key Differential Cryptanalysis.