Progress in Cryptology - INDOCRYPT 2021: Lecture Notes in Computer Science, cartea 13143
Editat de Avishek Adhikari, Ralf Küsters, Bart Preneelen Limba Engleză Paperback – 9 dec 2021
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 642.10 lei
Preț vechi: 802.63 lei
-20%
Puncte Express: 963
Carte tipărită la comandă
Livrare economică 13-27 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783030925178
ISBN-10: 303092517X
Pagini: 656
Ilustrații: XIX, 634 p. 130 illus., 51 illus. in color.
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.98 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 303092517X
Pagini: 656
Ilustrații: XIX, 634 p. 130 illus., 51 illus. in color.
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.98 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Authenticated Encryption.- Revisiting the Security of COMET Authenticated Encryption Scheme.- tHyENA: Making HyENA Even Smaller.- Panther: A Sponge Based Lightweight Authenticated Encryption Scheme.- Symmetric Cryptography.- Crooked Indifferentiability of Enveloped XOR Revisited.- Sequential Indifferentiability of Confusion-Diffusion Networks.- Elastic-Tweak: A Framework for Short Tweak Tweakable Block Cipher.- Lightweight Cryptography.- Three Input Exclusive-OR Gate Support For Boyar-Peralta’s Algorithm.- Pushing the Limits: Searching for Implementations with the Smallest Area for Lightweight S-Boxes.- Quantum Resource Estimation for FSR based Symmetric Ciphers & Related Grover’s Attacks.- Side-Channel Attacks.- Analyzing Masked Ciphers Against Transition and Coupling Effects.- A Lightweight Implementation of Saber Resistant Against Side-Channel Attacks.- Improving First-Order Threshold Implementations of SKINNY.- Fault Attacks.- Differential Fault Attackon Espresso.- Differential Fault Attack on Montgomery Ladder and in the Presence of Scalar Randomization.- Fault-Enabled Chosen-Ciphertext Attacks on Kyber.- Post-Quantum Cryptography.- DeCSIDH: Delegating Isogeny Computations in the CSIDH Setting.- Key-Oblivious Encryption from Isogenies with Application to Accountable Tracing Signatures.- Identity-Based Signature and Extended Forking Algorithm in the Multivariate Quadratic Setting.- Public Key Encryption and Protocols.- Identity-Based Matchmaking Encryption without Random Oracles.- Forward-Secure Public Key Encryption without Key Update from Proof-of-Stake Blockchain.- Cryptanalysis of the Privacy-Preserving Ride-Hailing Service TRACE.- Cryptographic Constructions.- Exipnos: An Efficient Verifiable Dynamic Symmetric Searchable Encryption Scheme with Forward and Backward Privacy.- Smooth Zero-Knowledge Hash Functions.- Another Use of the Five-Card Trick: Card-Minimal Secure Three-Input Majority Function Evaluation.- Blockchains.- On Elapsed Time Consensus Protocols.- Time-release Cryptography from Minimal Circuit Assumptions.- Succinct Publicly-Certifiable Proofs (or, Can a Blockchain Verify a Designated-Verifier Proof?).