Muutke küpsiste eelistusi

Progress in Cryptology INDOCRYPT 2023: 24th International Conference on Cryptology in India, Goa, India, December 1013, 2023, Proceedings, Part II 2024 ed. [Pehme köide]

Edited by , Edited by , Edited by , Edited by
  • Formaat: Paperback / softback, 264 pages, kõrgus x laius: 235x155 mm, 22 Illustrations, color; 20 Illustrations, black and white; XXII, 264 p. 42 illus., 22 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 14460
  • Ilmumisaeg: 29-Mar-2024
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031562348
  • ISBN-13: 9783031562341
Teised raamatud teemal:
  • Pehme köide
  • Hind: 62,59 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 73,64 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Progress in Cryptology INDOCRYPT 2023: 24th International Conference on Cryptology in India, Goa, India, December 1013, 2023, Proceedings, Part II 2024 ed.Suurem pilt
  • Formaat: Paperback / softback, 264 pages, kõrgus x laius: 235x155 mm, 22 Illustrations, color; 20 Illustrations, black and white; XXII, 264 p. 42 illus., 22 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 14460
  • Ilmumisaeg: 29-Mar-2024
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031562348
  • ISBN-13: 9783031562341
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783031562341.html
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 I: Symmetric-key cryptography, Hash functions, Authenticated Encryption Modes; Elliptic curves, Zero-knowledge proof, Signatures; Attacks.





Part II: Secure computation, Algorithm hardness, Privacy; Post-quantum cryptography.





 
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/Sabers Polynomial
Multiplication on ARM CortexM0/M0+.- Algorithmic Views of Vectorized
Polynomial Multipliers NTRU.