Cantitate/Preț
Produs
Total produse
Vezi coșul
Public-Key Cryptography - PKC 2021 de Juan A. Garay

Public-Key Cryptography - PKC 2021: Lecture Notes in Computer Science, cartea 12710

Editat de Juan A. Garay
en Limba Engleză Paperback – mai 2021
The two-volume proceedings set LNCS 12710 and 12711 constitutes the proceedings of the 24th IACR International Conference on Practice and Theory of Public Key Cryptography, PKC 2021, which was held online during May 10-13, 2021. The conference was originally planned to take place in Edinburgh, UK, but had to change to an online format due to the COVID-19 pandemic. The 52 papers included in these proceedings were carefully reviewed and selected from 156 submissions. They focus on all aspects of public-key cryptography, covering theory, implementations and applications. This year, post-quantum cryptography, PQC constructions and cryptanalysis received special attention.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 81324 lei  6-8 săpt.
  Springer – mai 2021 81324 lei  6-8 săpt.
  Springer – mai 2021 92254 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 92254 lei

Preț vechi: 115318 lei
-20%

Puncte Express: 1384
Preț estimativ în valută:
16313€ • 18707$ • 14099£

Carte tipărită la comandă

Livrare economică 27 aprilie-11 mai

 Adaugă în coș

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

Specificații

ISBN-13: 9783030752446
ISBN-10: 3030752445
Pagini: 776
Ilustrații: XVII, 756 p. 93 illus., 29 illus. in color.
Dimensiuni: 155 x 235 x 42 mm
Greutate: 1.15 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

Post-Quantum Constructions and Cryptanalysis.- QCCA-Secure Generic Key Encapsulation Mechanism with Tighter Security in the Quantum Random Oracle Model.- An Alternative Approach for SIDH Arithmetic.- The Convergence of Slide-type Reductions.- On the Success Probability of Solving Unique SVP via BKZ.- Two-round n-out-of-n and Multi-Signatures and Trapdoor Commitment from Lattice.- Isogeny-based key compression without pairings.- Analysis of Multivariate Encryption Schemes: Application to Dob.- On the Integer Polynomial Learning with Errors Problem.- Shorter Lattice-Based Zero-Knowledge Proofs via One-Time Commitments.- Multivariate Public Key Cryptosystem from Sidon Spaces.- Banquet: Short and Fast Signatures from AES.- Cryptographic Primitives and Schemes.- Improving Revocation for Group Signature with Redactable Signature.- Bootstrapping fully homomorphic encryption over the integers in less than one second.- Group Signatures with User-Controlled and Sequential Linkability.- Impossibility on Tamper-Resilient Cryptography with Uniqueness Properties.- Rate-1 Key-Dependent Message Security via Reusable Homomorphic Extractor against Correlated-Source Attacks.- Two-Party Adaptor Signatures From Identification Schemes.- Compact Zero-Knowledge Proofs for Threshold ECDSA with Trustless Setup.- Universal Proxy Re-Encryption.- Master-Key KDM-Secure ABE via Predicate Encoding.- Exact Lattice Sampling from Non-Gaussian Distributions.- Efficient Adaptively-Secure IB-KEMs and VRFs via Near-Collision Resistance.- Subversion-Resilient Public Key Encryption with Practical Watchdogs.- Non-Interactive CCA2-Secure Threshold Cryptosystems: Achieving Adaptive Security in the Standard Model Without Pairings.- Updatable Signatures and Message Authentication Codes.- Multi-Client Functional Encryption for Separable Functions.