Cantitate/Preț
Produs
Total produse
Vezi coșul
Advances in Cryptology - EUROCRYPT 2021 de Anne Canteaut

Advances in Cryptology - EUROCRYPT 2021: Lecture Notes in Computer Science, cartea 12697

Editat de Anne Canteaut, François-Xavier Standaert
en Limba Engleză Paperback – 16 iun 2021
The 3-volume-set LNCS 12696 – 12698 constitutes the refereed proceedings of the 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Eurocrypt 2021, which was held in Zagreb, Croatia, during October 17-21, 2021. The 78 full papers included in these proceedings were accepted from a total of 400 submissions. They were organized in topical sections as follows:
Part I: Best papers; public-key cryptography; isogenies; post-quantum cryptography; lattices; homomorphic encryption; symmetric cryptanalysis;
Part II: Symmetric designs; real-world cryptanalysis; implementation issues; masking and secret-sharing; leakage, faults and tampering; quantum constructions and proofs; multiparty computation;
Part III: Garbled circuits; indistinguishability obfuscation; non-malleable commitments; zero-knowledge proofs; property-preserving hash functions and ORAM; blockchain; privacy and law enforcement.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (3) 58458 lei  6-8 săpt.
  Springer – 16 iun 2021 58458 lei  6-8 săpt.
  Springer – 16 iun 2021 81734 lei  6-8 săpt.
  Springer – 16 iun 2021 82183 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 82183 lei

Preț vechi: 102729 lei
-20%

Puncte Express: 1233
Preț estimativ în valută:
14532€ • 16668$ • 12564£

Carte tipărită la comandă

Livrare economică 29 aprilie-13 mai

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783030778859
ISBN-10: 3030778851
Pagini: 952
Ilustrații: XV, 933 p. 115 illus., 37 illus. in color.
Dimensiuni: 155 x 235 x 51 mm
Greutate: 1.41 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

Symmetric Designs.- Ciminion: Symmetric Encryption Based on Toffoli-Gates over Large Finite Fields.- Mind the Middle Layer: The HADES Design Strategy Revisited.- Password Hashing and Preprocessing.- Compactness of Hashing Modes and Efficiency beyond Merkle Tree.- Real-World Cryptanalysis.- Three Third Generation Attacks on the Format Preserving Encryption Scheme FF3.- Cryptanalysis of the GPRS Encryption Algorithms GEA-1 and GEA-2.- Implementation Issues.- Pre-Computation Scheme of Window NAF for Koblitz Curves Revisited.- Dummy Shuffling against Algebraic Attacks in White-box Implementations.- Advanced Lattice Sieving on GPUs, with Tensor Cores.- Masking and Secret-Sharing.- Fast verification of masking schemes in characteristic two.- On the Power of Expansion: More Efficient Constructions in the Random Probing Model.- Leakage-resilience of the Shamir Secret-sharing Scheme against Physicalbit Leakages.- Leakage, Faults and Tampering.- Leakage Resilient Value Comparison With Application to Message Authentication.- The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free.- Message-recovery Laser Fault Injection Attack on the Classic McEliece Cryptosystem.- Multi-Source Non-Malleable Extractors and Applications.- Quantum Constructions and Proofs.- Secure Software Leasing.- Oblivious Transfer is in MiniQCrypt.- Security Analysis of Quantum Lightning.- Classical vs Quantum Random Oracles.- On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work.- Classical proofs of quantum knowledge.- Multiparty Computation.- Order-C Secure Multiparty Computation for Highly Repetitive Circuits.- The More The Merrier: Reducing the Cost of Large Scale MPC.- Multi-Party Reusable Non-Interactive Secure Computation from LWE.- Unbounded Multi-Party Computation from Learning with Errors.- Generic Compiler for Publicly Verifiable Covert Multi-Party Computation.- Constant-Overhead Unconditionally Secure Multiparty Computation over Binary Fields.- Breaking the Circuit Size Barrier for Secure Computation under Quasi-Polynomial LPN.- Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation.- VOLE-PSI: Fast OPRF and Circuit-PSI from Vector-OLE.