Del 14168 i serien Lecture Notes in Computer Science

Progress in Cryptology – LATINCRYPT 2023

8th International Conference on Cryptology and Information Security in Latin America, LATINCRYPT 2023, Quito, Ecuador, October 3–6, 2023, Proceedings

Häftad, Engelska, 2023

1 079 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This 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.

Produktinformation

Utgivningsdatum2023-09-26
Mått155 x 235 x 23 mm
Vikt622 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor398
FörlagSpringer International Publishing AG
ISBN9783031444685

Tillhör följande kategorier

Tillämpad datateknik inom Data och IT
Referensverk och tvärvetenskap inom Samhälle och politik
IT-säkerhet inom Data och IT

Symmetric-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.