Topics in Cryptology - CT-RSA 2020 [electronic resource] : The Cryptographers' Track at the RSA Conference 2020, San Francisco, CA, USA, February 24-28, 2020, Proceedings / edited by Stanislaw Jarecki.
Contributor(s): Jarecki, Stanislaw [editor.] | SpringerLink (Online service).
Material type: BookSeries: Security and Cryptology: 12006Publisher: Cham : Springer International Publishing : Imprint: Springer, 2020Edition: 1st ed. 2020.Description: XIII, 694 p. 350 illus., 28 illus. in color. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783030401863.Subject(s): Cryptography | Data encryption (Computer science) | Computer networks | Application software | Computers | Coding theory | Information theory | Software engineering | Cryptology | Computer Communication Networks | Computer and Information Systems Applications | Computing Milieux | Coding and Information Theory | Software EngineeringAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 005.824 Online resources: Click here to access onlineGeneric Attack on Iterated Tweakable FX Constructions -- Universal Forgery Attack against GCM-RUP -- My Gadget Just Cares For Me - How NINA Can Prove Security Against Combined Attacks -- Modeling Memory Faults in Signature and Authenticated Encryption Schemes -- Cryptanalysis of the Multivariate Encryption Scheme EFLASH -- FPL: White-Box Secure Block Cipher Using Parallel Table Look-Ups -- Extending NIST's CAVP Testing of Cryptographic Hash Function Implementations -- A Fast Characterization Method for Semi-invasive Fault Injection Attacks -- Tightly Secure Two-Pass Authenticated Key Exchange Protocol in the CK Model -- Symmetric-key Authenticated Key Exchange (SAKE) with Perfect Forward Secrecy -- TMPS: Ticket-Mediated Password Strengthening -- Overdrive2k: Efficient Secure MPC over Z2k from Somewhat Homomorphic Encryption -- Consensus from Signatures of Work -- Faster homomorphic encryption is not enough: improved heuristic for multiplicative depth minimization of Boolean circuits -- Better Bootstrapping for Approximate Homomorphic Encryption -- Improved Secure Integer Comparison via Homomorphic Encryption -- Efficient FPGA Implementations of LowMC and Picnic -- Traceable Ring Signatures with Post-quantum Security -- Post-Quantum Provably-Secure Authentication and MAC from Mersenne Primes -- Another look at some isogeny hardness assumptions -- How to Construct CSIDH on Edwards Curves -- Policy-Based Sanitizable Signatures -- Traceable Inner Product Functional Encryption -- One-More Assumptions Do Not Help Fiat-Shamir-type Signature Schemes in NPROM -- Cut-and-Choose for Garbled RAM -- Universally Composable Accumulators -- A Non-Interactive Shu e Argument With Low Trust Assumptions. .
This book constitutes the refereed proceedings of the Cryptographer's Track at the RSA Conference 2020, CT-RSA 2020, held in San Francisco, CA, USA, in February 2020. The 28 papers presented in this volume were carefully reviewed and selected from 95 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.
There are no comments for this item.