000 | 03849nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-031-56235-8 | ||
003 | DE-He213 | ||
005 | 20240730171710.0 | ||
007 | cr nn 008mamaa | ||
008 | 240328s2024 sz | s |||| 0|eng d | ||
020 |
_a9783031562358 _9978-3-031-56235-8 |
||
024 | 7 |
_a10.1007/978-3-031-56235-8 _2doi |
|
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 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. | ||
650 | 0 |
_aCryptography. _91973 |
|
650 | 0 |
_aData encryption (Computer science). _99168 |
|
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aArtificial intelligence. _93407 |
|
650 | 0 |
_aComputer science. _99832 |
|
650 | 1 | 4 |
_aCryptology. _931769 |
650 | 2 | 4 |
_aMathematics of Computing. _931875 |
650 | 2 | 4 |
_aArtificial Intelligence. _93407 |
650 | 2 | 4 |
_aTheory of Computation. _9100023 |
700 | 1 |
_aChattopadhyay, Anupam. _eeditor. _0(orcid) _10000-0002-8818-6983 _4edt _4http://id.loc.gov/vocabulary/relators/edt _9100024 |
|
700 | 1 |
_aBhasin, Shivam. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9100026 |
|
700 | 1 |
_aPicek, Stjepan. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9100028 |
|
700 | 1 |
_aRebeiro, Chester. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9100029 |
|
710 | 2 |
_aSpringerLink (Online service) _9100032 |
|
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 _923263 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-56235-8 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cEBK | ||
999 |
_c87763 _d87763 |