000 03889nam a22006495i 4500
001 978-3-031-56235-8
003 DE-He213
005 20250516160017.0
007 cr nn 008mamaa
008 240328s2024 sz | s |||| 0|eng d
020 _a9783031562358
_9978-3-031-56235-8
050 4 _aQA268
072 7 _aGPJ
_2bicssc
072 7 _aURY
_2bicssc
072 7 _aCOM083000
_2bisacsh
072 7 _aGPJ
_2thema
072 7 _aURY
_2thema
082 0 4 _a005.824
_223
245 1 0 _aProgress in Cryptology - INDOCRYPT 2023
_h[electronic resource] :
_b24th International Conference on Cryptology in India, Goa, India, December 10-13, 2023, Proceedings, Part II /
_cedited by Anupam Chattopadhyay, Shivam Bhasin, Stjepan Picek, Chester Rebeiro.
250 _a1st ed. 2024.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2024.
300 _aXXII, 264 p. 42 illus., 22 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14460
505 0 _aSecure 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.
520 _aThe 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. .
541 _fUABC ;
_cPerpetuidad
650 0 _aCryptography.
650 0 _aData encryption (Computer science).
650 0 _aComputer science
_xMathematics.
650 0 _aArtificial intelligence.
650 0 _aComputer science.
650 1 4 _aCryptology.
650 2 4 _aMathematics of Computing.
650 2 4 _aArtificial Intelligence.
650 2 4 _aTheory of Computation.
700 1 _aChattopadhyay, Anupam.
_eeditor.
_0(orcid)0000-0002-8818-6983
_1https://orcid.org/0000-0002-8818-6983
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aBhasin, Shivam.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPicek, Stjepan.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aRebeiro, Chester.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031562341
776 0 8 _iPrinted edition:
_z9783031562365
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14460
856 4 0 _zLibro electrónico
_uhttp://libcon.rec.uabc.mx:2048/login?url=https://doi.org/10.1007/978-3-031-56235-8
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cLIBRO_ELEC
999 _c274644
_d274643