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ț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 403.53 lei
Nou
Puncte Express: 605
Preț estimativ în valută:
77.23€ • 80.22$ • 64.15£
77.23€ • 80.22$ • 64.15£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
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.