Vai al contenuto principale della pagina
Titolo: |
Topics in Cryptology – CT-RSA 2020 : The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings / / edited by Stanislaw Jarecki
![]() |
Pubblicazione: | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
Edizione: | 1st ed. 2020. |
Descrizione fisica: | 1 online resource (XIII, 694 p. 350 illus., 28 illus. in color.) |
Disciplina: | 005.824 |
Soggetto topico: | Data encryption (Computer science) |
Computer communication systems | |
Application software | |
Computers | |
Coding theory | |
Information theory | |
Software engineering | |
Cryptology | |
Computer Communication Networks | |
Information Systems Applications (incl. Internet) | |
Computing Milieux | |
Coding and Information Theory | |
Software Engineering | |
Persona (resp. second.): | JareckiStanislaw |
Note generali: | Includes index. |
Nota di contenuto: | 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. . |
Sommario/riassunto: | 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. |
Titolo autorizzato: | Topics in Cryptology – CT-RSA 2020 ![]() |
ISBN: | 3-030-40186-3 |
Formato: | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 9910380759503321 |
Lo trovi qui: | Univ. Federico II |
Opac: | Controlla la disponibilità qui |