Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC, USA, November 16–19, 2020, Proceedings, Part I: Lecture Notes in Computer Science, cartea 12550
Editat de Rafael Pass, Krzysztof Pietrzaken Limba Engleză Paperback – 15 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.27 lei 6-8 săpt. | |
Springer International Publishing – 15 dec 2020 | 397.27 lei 6-8 săpt. | |
Springer International Publishing – 13 dec 2020 | 397.43 lei 6-8 săpt. | |
Springer International Publishing – 13 dec 2020 | 634.59 lei 6-8 săpt. |
Din seria Lecture Notes in Computer Science
- 20% Preț: 1021.30 lei
- 20% Preț: 337.03 lei
- 20% Preț: 340.22 lei
- 20% Preț: 256.27 lei
- 20% Preț: 324.32 lei
- 20% Preț: 438.69 lei
- 20% Preț: 315.78 lei
- 20% Preț: 327.52 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 557.41 lei
- 20% Preț: 561.37 lei
- 15% Preț: 558.56 lei
- 20% Preț: 238.01 lei
- 20% Preț: 504.57 lei
- 20% Preț: 329.09 lei
- 20% Preț: 563.75 lei
- 20% Preț: 630.24 lei
- 20% Preț: 321.96 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.19 lei
- 20% Preț: 985.59 lei
- 20% Preț: 620.87 lei
- 20% Preț: 436.22 lei
- 20% Preț: 734.34 lei
- 20% Preț: 1034.49 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 573.92 lei
- 20% Preț: 301.95 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 327.52 lei
- 20% Preț: 794.65 lei
- 20% Preț: 569.16 lei
- Preț: 395.43 lei
- 20% Preț: 1138.26 lei
- 20% Preț: 734.34 lei
- 20% Preț: 315.78 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 397.27 lei
Nou
Puncte Express: 596
Preț estimativ în valută:
76.03€ • 80.21$ • 63.36£
76.03€ • 80.21$ • 63.36£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030643744
ISBN-10: 3030643743
Pagini: 707
Ilustrații: XVI, 707 p. 54 illus., 3 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 1 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: 3030643743
Pagini: 707
Ilustrații: XVI, 707 p. 54 illus., 3 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 1 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
Lossiness and Entropic Hardness for Ring-LWE.- Multi-key Fully-Homomorphic Encryption in the Plain Model.- Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions.- Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and CP-ABE for Circuits (and more) in the Symmetric Key Setting.- Optimal Broadcast Encryption from LWE and Pairings in the Standard Model.- Equipping Public-Key Cryptographic Primitives with Watermarking (or: A Hole Is to Watermark).- Functional Encryption for Quadratic Functions from k-Lin, Revisited.- On Perfect Correctness in (Lockable) Obfuscation.- Can a Public Blockchain Keep a Secret.- Blockchains from Non-Idealized Hash Functions.- Ledger Combiners for Fast Asynchronous Byzantine Agreement with Subquadratic Communication.- Expected Constant Round Byzantine Broadcast under Dishonest Majority.- Round-Efficient Byzantine Broadcast under Strongly Adaptive and Majority Corruptions.- A Lower Bound for One-Round Oblivious RAM.- Lower Bounds for Multi-Server Oblivious RAMs.- On Computational Shortcuts for Information-Theoretic PIR.- Characterizing Deterministic-Prover Zero Knowledge.- NIZK from SNARG.- Weakly Extractable One-Way Functions.- Towards Non-Interactive Witness Hiding.- FHE-Based Bootstrapping of Designated-Prover NIZK.- Perfect Zero Knowledge: New Upperbounds and Relativized Separations.