Cantitate/Preț
Produs
Total produse
Vezi coșul
Progress in Cryptology - LATINCRYPT 2023 de Abdelrahaman Aly

Progress in Cryptology - LATINCRYPT 2023: Lecture Notes in Computer Science, cartea 14168

Editat de Abdelrahaman Aly, Mehdi Tibouchi
en Limba Engleză Paperback – 26 sep 2023
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 49250 lei

Preț vechi: 61562 lei
-20%

Puncte Express: 739

Carte tipărită la comandă

Livrare economică 17-31 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783031444685
ISBN-10: 303144468X
Pagini: 412
Ilustrații: XIII, 398 p. 152 illus., 29 illus. in color.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1st edition 2023
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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