Advances in Cryptology - CRYPTO 2021: Security and Cryptology
Editat de Tal Malkin, Chris Peikerten Limba Engleză Paperback – 8 aug 2021
Part I: Award Papers; Signatures; Quantum Cryptography; Succinct Arguments.
Part II: Multi-Party Computation; Lattice Cryptography; and Lattice Cryptanalysis.
Part III: Models; Applied Cryptography and Side Channels; Cryptanalysis; Codes and Extractors; Secret Sharing.
Part IV: Zero Knowledge; Encryption++; Foundations; Low-Complexity Cryptography; Protocols.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (4) | 699.50 lei 6-8 săpt. | |
| Springer – 8 aug 2021 | 699.50 lei 6-8 săpt. | |
| Springer – 8 aug 2021 | 703.36 lei 6-8 săpt. | |
| Springer – 8 aug 2021 | 758.27 lei 6-8 săpt. | |
| Springer – 10 aug 2021 | 758.91 lei 6-8 săpt. |
Din seria Security and Cryptology
- 20%
Preț: 327.36 lei - 20%
Preț: 325.30 lei - 20%
Preț: 330.54 lei - 20%
Preț: 524.32 lei - 20%
Preț: 329.74 lei - 20%
Preț: 495.22 lei - 15%
Preț: 499.72 lei -
Preț: 383.23 lei -
Preț: 376.75 lei - 20%
Preț: 323.41 lei -
Preț: 385.06 lei - 15%
Preț: 672.87 lei - 20%
Preț: 317.85 lei - 20%
Preț: 390.12 lei - 20%
Preț: 317.85 lei - 20%
Preț: 497.84 lei - 20%
Preț: 327.36 lei - 20%
Preț: 321.03 lei - 15%
Preț: 497.51 lei -
Preț: 379.15 lei -
Preț: 374.34 lei - 20%
Preț: 326.55 lei - 20%
Preț: 321.81 lei -
Preț: 368.43 lei - 20%
Preț: 319.42 lei -
Preț: 372.15 lei - 20%
Preț: 321.81 lei -
Preț: 380.46 lei - 20%
Preț: 319.75 lei -
Preț: 376.75 lei -
Preț: 371.00 lei -
Preț: 377.68 lei - 20%
Preț: 390.46 lei -
Preț: 379.51 lei - 20%
Preț: 250.79 lei - 20%
Preț: 493.97 lei -
Preț: 395.25 lei - 20%
Preț: 461.90 lei - 20%
Preț: 323.41 lei - 20%
Preț: 329.74 lei - 20%
Preț: 320.55 lei -
Preț: 381.55 lei - 20%
Preț: 647.15 lei -
Preț: 432.39 lei -
Preț: 376.75 lei -
Preț: 373.40 lei - 20%
Preț: 329.60 lei - 20%
Preț: 642.40 lei -
Preț: 374.91 lei -
Preț: 376.75 lei
Preț: 699.50 lei
Preț vechi: 874.37 lei
-20% Nou
Puncte Express: 1049
Preț estimativ în valută:
123.78€ • 145.15$ • 108.70£
123.78€ • 145.15$ • 108.70£
Carte tipărită la comandă
Livrare economică 11-25 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030842581
ISBN-10: 3030842584
Pagini: 748
Ilustrații: XV, 732 p. 112 illus., 24 illus. in color.
Dimensiuni: 155 x 235 x 40 mm
Greutate: 1.11 kg
Ediția:1st edition 2021
Editura: Springer
Seria Security and Cryptology
Locul publicării:Cham, Switzerland
ISBN-10: 3030842584
Pagini: 748
Ilustrații: XV, 732 p. 112 illus., 24 illus. in color.
Dimensiuni: 155 x 235 x 40 mm
Greutate: 1.11 kg
Ediția:1st edition 2021
Editura: Springer
Seria Security and Cryptology
Locul publicării:Cham, Switzerland
Cuprins
Zero Knowledge.- Witness Authenticating NIZKs and Applications.- Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs.- Compressing Proofs of k-Out-Of-n Partial Knowledge.- Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions.- Time- and Space-Efficient Arguments from Groups of Unknown Order.- Encryption++.- Broadcast Encryption with Size N1/3 and More from k-Lin.- Fine-grained Secure Attribute-based Encryption.- Multi-Input Quadratic Functional Encryption from Pairings.- Functional Encryption for Turing Machines with Dynamic Bounded Collusion from LWE.- Receiver-Anonymity in Reradomizable RCCA-Secure Cryptosystems Resolved.- Foundations.- White Box Traitor Tracing.- Does Fiat-Shamir Require a Cryptographic Hash Function?.- Composition with Knowledge Assumptions.- Non-Interactive Batch Arguments for NP from Standard Assumptions.- Targeted Lossy Functions and Applications.- The t-wise Independence of Substitution-Permutation Networks.- Low-Complexity Cryptography.- Low-Complexity Weak Pseudorandom Functions in AC0[MOD2].- MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and Applications.- No Time to Hash: On Super-Efficient Entropy Accumulation.- Protocols.- A Logarithmic Lower Bound for Oblivious RAM (for all parameters).- Oblivious RAM with Worst-Case Logarithmic Overhead.- Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time.- Authenticated Key Exchange and Signatures with Tight Security in the Standard Model.- KHAPE: Asymmetric PAKE from Key-Hiding Key Exchange.