Topics in Cryptology – CT-RSA 2019

The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4–8, 2019, Proceedings

Häftad, Engelska, 2019

729 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 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.

Produktinformation

Utgivningsdatum2019-02-04
Mått155 x 235 x undefined mm
FormatHäftad
SpråkEngelska
SerieSecurity and Cryptology
Antal sidor578
FörlagSpringer Nature Switzerland AG
ISBN9783030126117

Tillhör följande kategorier

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 Stam’s 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 Substitution Boxes using Shift-Invariant Permutations.- Fast Secure Comparison for Medium-Sized Integers and Its Application in Binarized Neural Networks.- EPIC: Efficient Private Image Classification (or: Learning from the Masters).- Context Hiding Multi-Key Linearly Homomorphic Authenticators.- Revisiting the Secret Hiding Assumption Used in Verifiable (Outsourced) Computation.- Delegatable Anonymous Credentials from Mercurial Signatures.- Accountable Tracing Signatures from Lattices.