Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

TitleTopics in Cryptology – CT-RSA 2019 [electronic resource] : The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4–8, 2019, Proceedings / edited by Mitsuru Matsui
ImprintCham : Springer International Publishing : Imprint: Springer, 2019
Edition 1st ed. 2019
Connect tohttps://doi.org/10.1007/978-3-030-12612-4
Descript XI, 578 p. 584 illus., 19 illus. in color. online resource

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


CONTENT

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


Data encryption (Computer science) Computer Communication Networks Coding theory Computer science Software engineering Artificial intelligence Cryptology. http://scigraph.springernature.com/things/product-market-codes/I28020 Computer Communication Networks. http://scigraph.springernature.com/things/product-market-codes/I13022 Coding and Information Theory. http://scigraph.springernature.com/things/product-market-codes/I15041 Computers and Society. http://scigraph.springernature.com/things/product-market-codes/I24040 Software Engineering. http://scigraph.springernature.com/things/product-market-codes/I14029 Artificial Intelligence. http://scigraph.springernature.com/things/product-market-codes/I21000



Location



Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network

  line

facebook   instragram