03714nam a22005895i 4500001001800000003000900018005001700027007001500044008004100059020003700100024003500137050001000172072001600182072001600198072002300214072001500237072001500252245026500267250001800532264006900550300006600619336002600685337002600711338003600737347002400773490005900797505071300856520053701569650002502106650004702131650004202178650003602220650002902256650002302285650003702308650003602345650003402381700015802415700008402573700008402657700008602741710003402827773002602861776003602887776003602923830005902959856004603018912001403064912001503078912001403093999001703107978-3-031-56235-8DE-He21320251030111750.0cr nn 008mamaa240328s2024    sz |    s    |||| 0|eng d  a97830315623589978-3-031-56235-87 a10.1007/978-3-031-56235-82doi 4aQA268 7aGPJ2bicssc 7aURY2bicssc 7aCOM0830002bisacsh 7aGPJ2thema 7aURY2thema10aProgress in Cryptology – INDOCRYPT 2023h[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.  a1st ed. 2024. 1aCham :bSpringer Nature Switzerland :bImprint: Springer,c2024.  aXXII, 264 p. 42 illus., 22 illus. in color.bonline resource.  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  atext filebPDF2rda1 aLecture Notes in Computer Science,x1611-3349 ;v144600 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.  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. . 0aCryptography.964299 0aData encryption (Computer science).958243 0aComputer sciencexMathematics.964041 0aArtificial intelligence.958441 0aComputer science.95855214aCryptology.96649124aMathematics of Computing.96650124aArtificial Intelligence.95844124aTheory of Computation.9675521 aChattopadhyay, Anupam.eeditor.0(orcid)0000-0002-8818-69831https://orcid.org/0000-0002-8818-69834edt4http://id.loc.gov/vocabulary/relators/edt9741841 aBhasin, Shivam.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt9715761 aPicek, Stjepan.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt9741851 aRebeiro, Chester.eeditor.4edt4http://id.loc.gov/vocabulary/relators/edt9741862 aSpringerLink (Online service)0 tSpringer Nature eBook08iPrinted edition:z978303156234108iPrinted edition:z9783031562365 0aLecture Notes in Computer Science,x1611-3349 ;v1446040uhttps://doi.org/10.1007/978-3-031-56235-8  aZDB-2-SCS  aZDB-2-SXCS  aZDB-2-LNC  c58737d58737