ShopSpell

Topics in Cryptology CT-RSA 2019: The Cryptographers' Track at the RSA Confere [Paperback]

$41.99     $54.99    24% Off      ($100.00 Shipping)
100 available
  • Category: Books (Computers)
  • ISBN-10:  3030126110
  • ISBN-10:  3030126110
  • ISBN-13:  9783030126117
  • ISBN-13:  9783030126117
  • Publisher:  Springer
  • Publisher:  Springer
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Apr-2019
  • Pub Date:  01-Apr-2019
  • SKU:  3030126110-11-SPRI
  • SKU:  3030126110-11-SPRI
  • Pages:  578
  • Pages:  578
  • Item ID: 105309053
  • List Price: $54.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 4 business days
  • Delivery by: Oct 01 to Oct 03

This book constitutes the refereed proceedings of the Cryptographer's Track at the RSA Conference 2019, CT-RSA 2019, held in San Francisco, CA, USA, in March 2019.

The 28 papers presented in this volume were carefully reviewed and selected from 75 submissions.

CT-RSA is the track devoted to scientific papers on cryptography, public-key to symmetric-key cryptography and from crypto- graphic protocols to primitives and their implementation security.

Structure-Preserving Certificateless Encryption and its Application.- Public Key Encryption Resilient to Post-Challenge Leakage and Tampering Attacks.- Downgradable Identity-based Encryption and Applications.- Large Universe Subset Predicate Encryption Based on Static Assumption (without Random Oracle).- An Improved RNS Variant of the BFV Homomorphic Encryption Scheme.- New techniques for multi-value input homomorphic evaluation and applications.- Efficient Function-Hiding Functional Encryption: From Inner-Products to Orthogonality.- Robust Encryption, Extended.- Tight Reductions for Diffie-Hellman Variants in the Algebraic Group Model.- Doubly half-injective PRGs for incompressible white-box cryptography.- Error Detection in Monotone Span Programs with Application to Communication-Efficient Multi-Party Computation.- Lossy Trapdoor Permutations with Improved Lossiness.- Post-Quantum EPID Signatures from Symmetric Primitives.- Assessment of the key reuse resilience of NewHope.- Universal Forgery and Multiple Forgeries of MergeMAC and Generalized Constructions.- Linking Stams Bounds With Generalized Truncation.- Poly-Logarithmic Side Channel Rank Estimation via Exponential Sampling.- Efficient Fully-Leakage Resilient One-More Signature Schemes.- MILP-based Differential Attack on Round-reduced GIFT.- Quantum Chosen-Ciphertext Attacks against Feistel Ciphers.- Automatic Search for A Variant of Division Property Using Three Subsets.- Constructing TI-friendly Substil#j

Add Review