Fr. 69.00

Topics in Cryptology - CT-RSA 2019 - The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4-8, 2019, Proceedings

English · Paperback / Softback

Shipping usually within 1 to 2 weeks (title will be printed to order)

Description

Read more

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.

List of contents

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.

Summary

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.

Product details

Assisted by Mitsur Matsui (Editor), Mitsuru Matsui (Editor)
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 01.01.2019
 
EAN 9783030126117
ISBN 978-3-0-3012611-7
No. of pages 578
Dimensions 155 mm x 33 mm x 236 mm
Weight 899 g
Illustrations XI, 578 p. 584 illus., 19 illus. in color.
Series Lecture Notes in Computer Science
Security and Cryptology
Lecture Notes in Computer Science
Security and Cryptology
Subject Natural sciences, medicine, IT, technology > IT, data processing > IT

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.