Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part III: Lecture Notes in Computer Science, cartea 12552
Editat de Rafael Pass, Krzysztof Pietrzaken Limba Engleză Paperback – 13 dec 2020
The total of 71 full papers presented in this three-volume set was carefully reviewed and selected from 167 submissions. Amongst others they cover the following topics: study of known paradigms, approaches, and techniques, directed towards their better understanding and utilization; discovery of new paradigms, approaches and techniques that overcome limitations of the existing ones, formulation and treatment of new cryptographic problems; study of notions of security and relations among them; modeling and analysis of cryptographic algorithms; and study of the complexity assumptions used in cryptography.
Due to the Corona pandemic this event was held virtually.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (3) | 397.09 lei 6-8 săpt. | |
| Springer International Publishing – 15 dec 2020 | 397.09 lei 6-8 săpt. | |
| Springer International Publishing – 13 dec 2020 | 397.25 lei 6-8 săpt. | |
| Springer International Publishing – 13 dec 2020 | 634.07 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20%
Preț: 461.83 lei - 20%
Preț: 461.57 lei - 20%
Preț: 424.26 lei - 20%
Preț: 390.69 lei - 20%
Preț: 498.50 lei - 15%
Preț: 388.50 lei - 20%
Preț: 390.35 lei - 20%
Preț: 460.98 lei - 20%
Preț: 461.52 lei - 20%
Preț: 497.55 lei - 20%
Preț: 389.72 lei - 20%
Preț: 461.83 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 391.14 lei - 20%
Preț: 389.85 lei - 20%
Preț: 461.32 lei - 20%
Preț: 498.32 lei - 20%
Preț: 496.64 lei - 20%
Preț: 532.28 lei - 20%
Preț: 527.36 lei - 20%
Preț: 498.46 lei - 15%
Preț: 461.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 532.41 lei - 20%
Preț: 462.24 lei - 20%
Preț: 391.14 lei - 20%
Preț: 461.77 lei - 20%
Preț: 390.35 lei - 20%
Preț: 461.06 lei - 20%
Preț: 461.65 lei - 20%
Preț: 390.18 lei - 20%
Preț: 392.64 lei - 20%
Preț: 252.15 lei - 20%
Preț: 390.94 lei - 20%
Preț: 461.52 lei - 20%
Preț: 391.86 lei - 20%
Preț: 532.54 lei - 20%
Preț: 462.67 lei - 20%
Preț: 461.65 lei - 20%
Preț: 639.72 lei - 20%
Preț: 255.91 lei - 15%
Preț: 535.92 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 499.36 lei - 20%
Preț: 391.20 lei - 20%
Preț: 391.20 lei - 20%
Preț: 249.95 lei
Preț: 634.07 lei
Preț vechi: 745.96 lei
-15% Nou
Puncte Express: 951
Preț estimativ în valută:
112.22€ • 131.60$ • 98.39£
112.22€ • 131.60$ • 98.39£
Carte tipărită la comandă
Livrare economică 26 ianuarie-09 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030643805
ISBN-10: 3030643808
Pagini: 673
Ilustrații: XII, 673 p. 395 illus., 11 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.95 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology
Locul publicării:Cham, Switzerland
ISBN-10: 3030643808
Pagini: 673
Ilustrații: XII, 673 p. 395 illus., 11 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.95 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology
Locul publicării:Cham, Switzerland
Cuprins
Universal Composition with Global Subroutines: Capturing Global Setup within plain UC.- Security analysis of SPAKE2+.- Schrödinger's Pirate: How To Trace a Quantum Decoder.- Quantum Encryption with Certified Deletion.- Secure Quantum Extraction Protocols.- Non-interactive Classical Verification of Quantum Computation.- Classical Verification of Quantum Computations with Efficient Verifier.- Coupling of Random Systems.- Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity.- Zero-Communication Reductions.- Lower Bounds on the Time/Memory Tradeoff of Function Inversion.- Super-Linear Time-Memory Trade-Offs for Symmetric Encryption.- Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions.- On the Security of Time-Lock Puzzles and Timed Commitments.- Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness.- On the Complexity of Arithmetic Secret Sharing.- Robust Secret Sharing with AlmostOptimal Share Size and Security Against Rushing Adversaries.- The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs.- Transparent Error Correcting in a Computationally Bounded World.- New Techniques in Replica Encodings with Client Setup.