Topics in Cryptology – CT-RSA 2020: The Cryptographers’ Track at the RSA Conference 2020, San Francisco, CA, USA, February 24–28, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12006
Editat de Stanislaw Jareckien Limba Engleză Paperback – 30 ian 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.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 390.18 lei - 20%
Preț: 461.65 lei - 20%
Preț: 461.32 lei - 20%
Preț: 461.77 lei - 20%
Preț: 527.36 lei - 20%
Preț: 497.04 lei - 20%
Preț: 461.52 lei - 20%
Preț: 390.35 lei - 20%
Preț: 496.64 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.14 lei - 15%
Preț: 461.85 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.06 lei - 20%
Preț: 390.69 lei - 20%
Preț: 252.15 lei - 20%
Preț: 391.14 lei - 20%
Preț: 532.54 lei - 20%
Preț: 461.83 lei - 20%
Preț: 255.91 lei - 20%
Preț: 498.46 lei - 20%
Preț: 497.55 lei - 20%
Preț: 499.36 lei - 20%
Preț: 390.12 lei - 20%
Preț: 391.20 lei - 20%
Preț: 390.35 lei - 20%
Preț: 391.20 lei - 20%
Preț: 392.64 lei - 20%
Preț: 389.90 lei - 20%
Preț: 639.72 lei - 20%
Preț: 461.65 lei - 20%
Preț: 462.05 lei - 15%
Preț: 388.50 lei - 5%
Preț: 516.27 lei - 20%
Preț: 390.94 lei - 20%
Preț: 391.86 lei - 20%
Preț: 389.85 lei - 20%
Preț: 498.32 lei - 20%
Preț: 462.67 lei - 20%
Preț: 460.98 lei - 20%
Preț: 424.26 lei - 20%
Preț: 535.77 lei - 15%
Preț: 535.92 lei - 20%
Preț: 532.28 lei - 20%
Preț: 400.17 lei - 20%
Preț: 403.00 lei - 20%
Preț: 461.57 lei - 20%
Preț: 498.50 lei - 20%
Preț: 461.83 lei - 20%
Preț: 249.95 lei
Preț: 396.14 lei
Nou
Puncte Express: 594
Preț estimativ în valută:
70.12€ • 81.73$ • 61.32£
70.12€ • 81.73$ • 61.32£
Carte tipărită la comandă
Livrare economică 20 ianuarie-03 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030401856
ISBN-10: 3030401855
Pagini: 600
Ilustrații: XIII, 694 p. 350 illus., 28 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.98 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology
Locul publicării:Cham, Switzerland
ISBN-10: 3030401855
Pagini: 600
Ilustrații: XIII, 694 p. 350 illus., 28 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.98 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology
Locul publicării:Cham, Switzerland
Cuprins
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.