Topics in Cryptology - CT-RSA 2019 : The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4-8, 2019, Proceedings / edited by Mitsuru Matsui.

Format:

Book

Contributor:

Matsui, Mitsuru, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Security and cryptology ; SL 4, 11405.

Security and Cryptology ; 11405

Language:

English

Subjects (All):

Data encryption (Computer science).

Computer networks.

Coding theory.

Information theory.

Computers and civilization.

Software engineering.

Artificial intelligence.

Cryptology.

Computer Communication Networks.

Coding and Information Theory.

Computers and Society.

Software Engineering.

Artificial Intelligence.

Local Subjects:

Cryptology.

Computer Communication Networks.

Coding and Information Theory.

Computers and Society.

Software Engineering.

Artificial Intelligence.

Physical Description:

1 online resource (XI, 578 pages) : 584 illustrations, 19 illustrations in color.

Edition:

First edition 2019.

Contained In:

Springer eBooks

Place of Publication:

Cham : Springer International Publishing : Imprint: Springer, 2019.

System Details:

text file PDF

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.

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.

Other Format:

Printed edition:

ISBN:

978-3-030-12612-4

9783030126124

Access Restriction:

Restricted for use by site license.