Topics in Cryptology – CT-RSA 2019 -

Topics in Cryptology – CT-RSA 2019

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

Mitsuru Matsui (Herausgeber)

Buch | Softcover
XI, 578 Seiten
2019 | 1st ed. 2019
Springer International Publishing (Verlag)
978-3-030-12611-7 (ISBN)
53,49 inkl. MwSt

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

Erscheinungsdatum
Reihe/Serie Lecture Notes in Computer Science
Security and Cryptology
Zusatzinfo XI, 578 p. 584 illus., 19 illus. in color.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 896 g
Themenwelt Informatik Theorie / Studium Kryptologie
Schlagworte Applications • Artificial Intelligence • authentication • case based reasoning • ciphertexts • Computer Science • conference proceedings • cryptography • data privacy • electronic document identification systems • Encryption • Informatics • Knowledge-Based System • Network Security • Public Key Cryptography • Research • Software engineering • structural design
ISBN-10 3-030-12611-0 / 3030126110
ISBN-13 978-3-030-12611-7 / 9783030126117
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich