Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Topics in Cryptology – CT-RSA 2020 -

Topics in Cryptology – CT-RSA 2020

The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings

Stanislaw Jarecki (Herausgeber)

Buch | Softcover
XIII, 694 Seiten
2020 | 1st ed. 2020
Springer International Publishing (Verlag)
978-3-030-40185-6 (ISBN)
CHF 74,85 inkl. MwSt

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.

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

 

Erscheinungsdatum
Reihe/Serie Lecture Notes in Computer Science
Security and Cryptology
Zusatzinfo XIII, 694 p. 350 illus., 28 illus. in color.
Verlagsort Cham
Sprache englisch
Maße 155 x 235 mm
Gewicht 1068 g
Themenwelt Mathematik / Informatik Informatik Datenbanken
Mathematik / Informatik Informatik Netzwerke
Informatik Theorie / Studium Kryptologie
Schlagworte Applications • authentication • ciphertexts • Computer Hardware • Computer Networks • Computer Science • Computer Security • Computer systems • conference proceedings • cryptography • data privacy • Data Security • electronic document identification systems • Encryption • Informatics • Internet • Mathematics • Network Protocols • Network Security • privacy • Public Key Cryptography • Research • Software engineering • Telecommunication Systems
ISBN-10 3-030-40185-5 / 3030401855
ISBN-13 978-3-030-40185-6 / 9783030401856
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich