Cantitate/Preț
Produs

Progress in Cryptology - INDOCRYPT 2023: Lecture Notes in Computer Science, cartea 14460

Editat de Anupam Chattopadhyay, Shivam Bhasin, Stjepan Picek, Chester Rebeiro
en Limba Engleză Paperback – 29 mar 2024
The two-volume proceedings constitutes the refereed proceedings of the 24th International Conference on Progress in Cryptology, INDOCRYPT 2023, Goa, India, in December 2023. 
The 26 full papers were carefully reviewed and selected from 74 submissions. They are organized in topical sections as follows: 
Part One: Symmetric-key cryptography, Hash functions, Authenticated Encryption Modes; Elliptic curves, Zero-knowledge proof, Signatures; Attacks.
Part Two: Secure computation, Algorithm hardness, Privacy; Post-quantum cryptography.


Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 40385 lei  6-8 săpt.
  Springer – 29 mar 2024 40385 lei  6-8 săpt.
  Springer – 29 mar 2024 49063 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 40385 lei

Preț vechi: 50482 lei
-20%

Puncte Express: 606

Preț estimativ în valută:
7140 8253$ 6180£

Carte tipărită la comandă

Livrare economică 09-23 mai


Specificații

ISBN-13: 9783031562341
ISBN-10: 3031562348
Pagini: 288
Ilustrații: XXII, 264 p. 42 illus., 22 illus. in color.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.44 kg
Ediția:2024
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Secure computation, Algorithm hardness, Privacy.- Threshold-Optimal MPC With Friends and Foes.- Network-Agnostic Perfectly Secure Synchronous Message Transmission Revisited.- Explicit Lower Bounds for Communication Complexity of PSM for Concrete Functions.- Distributed Protocols for Oblivious Transfer and Polynomial Evaluation.- Obfuscating Decision Trees.- Privacy-Preserving Plagiarism Checking.- PURED: A unified framework for resource-hard functions.- Post-quantum cryptography.- Implementing Lattice-Based PQC on Resource-Constrained Processors: A Case Study for Kyber/Saber’s Polynomial Multiplication on ARM CortexM0/M0+.- Algorithmic Views of Vectorized Polynomial Multipliers – NTRU.