001481329 000__ 04568cam\\22005777i\4500
001481329 001__ 1481329
001481329 003__ OCoLC
001481329 005__ 20231031003333.0
001481329 006__ m\\\\\o\\d\\\\\\\\
001481329 007__ cr\un\nnnunnun
001481329 008__ 231004s2023\\\\sz\a\\\\o\\\\\101\0\eng\d
001481329 019__ $$a1400013273$$a1401057097
001481329 020__ $$a9783031444692$$q(electronic bk.)
001481329 020__ $$a3031444698$$q(electronic bk.)
001481329 020__ $$z9783031444685
001481329 020__ $$z303144468X
001481329 0247_ $$a10.1007/978-3-031-44469-2$$2doi
001481329 035__ $$aSP(OCoLC)1401758841
001481329 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dYDX$$dEBLCP
001481329 049__ $$aISEA
001481329 050_4 $$aQA76.9.D335
001481329 08204 $$a005.8/2$$223/eng/20231004
001481329 1112_ $$aInternational Conference on Cryptology and Information Security in Latin America$$n(8th :$$d2023 :$$cQuito, Ecuador)
001481329 24510 $$aProgress in cryptology -- LATINCRYPT 2023 :$$b8th International Conference on Cryptology and Information Security in Latin America, LATINCRYPT 2023, Quito, Ecuador, October 3-6, 2023, Proceedings /$$cAbdelrahaman Aly, Mehdi Tibouchi, editors.
001481329 2463_ $$aLATINCRYPT 2023
001481329 264_1 $$aCham, Switzerland :$$bSpringer,$$c2023.
001481329 300__ $$a1 online resource (xiii, 398 pages) :$$billustrations (some color).
001481329 336__ $$atext$$btxt$$2rdacontent
001481329 337__ $$acomputer$$bc$$2rdamedia
001481329 338__ $$aonline resource$$bcr$$2rdacarrier
001481329 4901_ $$aLecture notes in computer science,$$x1611-3349 ;$$v14168
001481329 500__ $$aIncludes author index.
001481329 5050_ $$aSymmetric-Key Cryptography -- On the Algebraic Immunity of Weightwise Perfectly Balanced Functions -- ACE-HoT: Accelerating an Extreme Amount of Symmetric Cipher Evaluations for High-order Avalanche Tests -- Multi-Party Computation -- On Fully-Secure Honest Majority MPC without nˆ2 Round Overhead -- Privacy-Preserving Edit Distance Computation Using Secret-Sharing Two-Party Computation -- Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels -- Isogeny-Based Cryptography -- Effective Pairings in Isogeny-based Cryptography -- Fast and Frobenius: Rational Isogeny Evaluation over Finite Fields -- Towards a Quantum-resistant Weak Verifiable Delay Function -- Discrete Logarithm Problem -- Making the Identity-Based Diffie-Hellman Key Exchange Efficiently Revocable -- On the Discrete Logarithm Problem in the Ideal Class Group of Multiquadratic Fields -- Cryptographic Protocols -- Stronger Lower Bounds for Leakage-Resilient Secret Sharing -- Folding Schemes with Selective Verification -- Composable Oblivious Pseudo-Random Functions via Garbled Circuits -- Real-World Cryptography -- Quotable Signatures for Authenticating Shared Quotes -- Post-Quantum Hybrid KEMTLS Performance in Simulated and Real Network Environments -- Zero-Knowledge Proofs -- Physical Zero-Knowledge Proofs for Five Cells -- Testudo: Linear Time Prover SNARKs with Constant Size Proofs and Square Root Size Universal Setup -- Set (Non-)Membership NIZKs from Determinantal Accumulators -- Benchmarking the Setup of Updatable zk-SNARKs.
001481329 506__ $$aAccess limited to authorized users.
001481329 520__ $$aThis book constitutes the refereed proceedings of the 8th International Conference on Progress in Cryptology, LATINCRYPT 2023, held in Quito, Ecuador, in October 2023. The 19 full papers included in this book were carefully reviewed and selected from 59 submissions. They were organized in topical sections as follows: Symmetric-Key Cryptography; Multi-Party Computation; Isogeny-Based Cryptography; Discrete Logarithm Problem; Cryptographic Protocols; Real-World Cryptography; and Zero-Knowledge Proofs.
001481329 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed October 4, 2023).
001481329 650_0 $$aData encryption (Computer science)$$vCongresses.$$vCongresses$$0(DLC)sh2008102033
001481329 650_0 $$aComputer security$$vCongresses.
001481329 655_0 $$aElectronic books.
001481329 7001_ $$aAly, Abdelrahaman,$$eeditor.$$0(orcid)0000-0003-2038-5668$$1https://orcid.org/0000-0003-2038-5668
001481329 7001_ $$aTibouchi, Mehdi.$$eeditor.$$1https://orcid.org/0000-0002-2736-2963
001481329 77608 $$iPrint version: $$z303144468X$$z9783031444685$$w(OCoLC)1394891352
001481329 830_0 $$aLecture notes in computer science ;$$v14168.$$x1611-3349
001481329 852__ $$bebk
001481329 85640 $$3Springer Nature$$uhttps://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-031-44469-2$$zOnline Access$$91397441.1
001481329 909CO $$ooai:library.usi.edu:1481329$$pGLOBAL_SET
001481329 980__ $$aBIB
001481329 980__ $$aEBOOK
001481329 982__ $$aEbook
001481329 983__ $$aOnline
001481329 994__ $$a92$$bISE