Topics in cryptology - CT-RSA 2013 : the Cryptographers' track at the RSA Conference 2013, San Francisco, CA, USA, February 25-March 1, 2013 : proceedings

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. Front Matter....Pages - Horizontal and Vertical Side-Channel Attacks against Secure RSA Implementations....Pages 1-17 Timing Attack against Protected RSA-CRT Implementation Used in PolarSSL....Pages 18-33 Fair Exchange of Short Signatures without Trusted Third Party....Pages 34-49 Fully Secure Attribute-Based Systems with Short Ciphertexts/Signatures and Threshold Access Structures....Pages 50-67 A Robust and Plaintext-Aware Variant of Signed ElGamal Encryption....Pages 68-83 Efficient Public Key Cryptosystem Resilient to Key Leakage Chosen Ciphertext Attacks....Pages 84-100 Simple, Efficient and Strongly KI-Secure Hierarchical Key Assignment Schemes....Pages 101-114 Randomized Partial Checking Revisited....Pages 115-128 Randomly Failed! The State of Randomness in Current Java Implementations....Pages 129-144 Efficient Vector Implementations of AES-Based Designs: A Case Study and New Implemenations for Grøstl ....Pages 145-161 Collisions for the WIDEA-8 Compression Function....Pages 162-173 Finding Collisions for Round-Reduced SM3....Pages 174-188 Many Weak Keys for PRINTcipher : Fast Key Recovery and Countermeasures....Pages 189-206 Applying Remote Side-Channel Analysis Attacks on a Security-Enabled NFC Tag....Pages 207-222 Practical Leakage-Resilient Pseudorandom Objects with Minimum Public Randomness....Pages 223-238 Cryptanalytic Attacks on MIFARE Classic Protocol....Pages 239-258 Asynchronous Computational VSS with Reduced Communication Complexity....Pages 259-276 Proxy Re-Encryption in a Stronger Security Model Extended from CT-RSA2012....Pages 277-292 Solving BDD by Enumeration: An Update....Pages 293-309 The k -BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions....Pages 310-325 Accountable Authority Identity-Based Encryption with Public Traceability....Pages 326-342 Efficient Delegation of Key Generation and Revocation Functionalities in Identity-Based Encryption....Pages 343-358 The Low-Call Diet: Authenticated Encryption for Call Counting HSM Users....Pages 359-374 A Fully Homomorphic Cryptosystem with Approximate Perfect Secrecy....Pages 375-388 Weak Keys of the Full MISTY1 Block Cipher for Related-Key Differential Cryptanalysis....Pages 389-404 Back Matter....Pages - 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 Fully Homomorphic Cryptosystem with Approximate Perfect Secrecy Weak Keys of the Full MISTY1 Block Cipher for Related-Key Differential Cryptanalysis. ^^