Cantitate/Preț
Produs
Total produse
Vezi coșul
Public-Key Cryptography - PKC 2022 de Goichiro Hanaoka

Public-Key Cryptography - PKC 2022: Lecture Notes in Computer Science, cartea 13177

Editat de Goichiro Hanaoka, Junji Shikata, Yohei Watanabe
en Limba Engleză Paperback – 27 feb 2022
The two-volume proceedings set LNCS 13177 and 13178 constitutes the refereed proceedings of the 25th IACR International Conference on Practice and Theory of Public Key Cryptography, PKC 2022, which took place virtually during March 7-11, 2022. The conference was originally planned to take place in Yokohama, Japan, but had to change to an online format due to the COVID-19 pandemic. The 40 papers included in these proceedings were carefully reviewed and selected from 137 submissions. They focus on all aspects of public-key cryptography, covering cryptanalysis; MPC and secret sharing; cryptographic protocols; tools; SNARKs and NIZKs; key exchange; theory; encryption; and signatures.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 58151 lei  43-57 zile
  Springer – 27 feb 2022 58151 lei  43-57 zile
  Springer – 27 feb 2022 64253 lei  43-57 zile

Din seria Lecture Notes in Computer Science

Preț: 64253 lei

Preț vechi: 80316 lei
-20%

Puncte Express: 964
Preț estimativ în valută:
11362€ • 13029$ • 9820£

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: 9783030971205
ISBN-10: 3030971201
Pagini: 664
Ilustrații: XIV, 648 p. 58 illus., 26 illus. in color.
Dimensiuni: 155 x 235 x 36 mm
Greutate: 0.99 kg
Ediția:1st edition 2022
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Cryptanalysis.- Multitarget decryption failure attacks and their application to Saber and Kyber.- Post-quantum Security of Plain OAEP Transform.- On the security of OSIDH.- Time-Memory tradeoffs for large-weight syndrome decoding in ternary codes.- Syndrome Decoding Estimator.- On the Isogeny Problem with Torsion Point Information.- MPC and Secret Sharing.- Reusable Two-Round MPC from LPN.- On the Bottleneck Complexity of MPC with Correlated Randomness.- Low-Communication Multiparty Triple Generation for SPDZ from Ring-LPN.- Fast Batched DPSS and its Applications.- CNF-FSS and its Applications.- Cryptographic Protocols.- Effcient Verifiable Partially-Decryptable Commitments from Lattices and Applications.- Making Private Function Evaluation Safer, Faster, and Simpler.- Two-Round Oblivious Linear Evaluation from Learning with Errors.- Improved Constructions of Anonymous Credentials From StructurePreserving Signatures on Equivalence Classes.- Traceable PRFs: Full Collusion Resistance andActive Security.- Tools.- Radical Isogenies on Montgomery Curves.- Towards a Simpler Lattice Gadget Toolkit.- SNARKs and NIZKs.- Polynomial IOPs for Linear Algebra Relations.- A Unified Framework for Non-Universal SNARKs.- ECLIPSE: Enhanced Compiling method for Pedersen-committed zkSNARK Engines.- Rational Modular Encoding in the DCR Setting: Non-Interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model.