Provable and Practical Security: 14th International Conference, ProvSec 2020, Singapore, November 29 – December 1, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12505
Editat de Khoa Nguyen, Wenling Wu, Kwok Yan Lam, Huaxiong Wangen Limba Engleză Paperback – 30 oct 2020
Din seria Lecture Notes in Computer Science
- 20%
Preț: 323.37 lei - 20%
Preț: 461.65 lei - 20%
Preț: 461.32 lei - 20%
Preț: 390.69 lei - 20%
Preț: 527.36 lei - 15%
Preț: 388.50 lei - 20%
Preț: 461.52 lei - 20%
Preț: 390.35 lei - 20%
Preț: 496.64 lei - 20%
Preț: 461.52 lei - 20%
Preț: 389.72 lei - 15%
Preț: 461.85 lei - 20%
Preț: 389.90 lei - 20%
Preț: 497.04 lei - 20%
Preț: 462.05 lei - 20%
Preț: 252.15 lei - 20%
Preț: 391.14 lei - 20%
Preț: 532.54 lei - 20%
Preț: 461.83 lei - 20%
Preț: 255.91 lei - 20%
Preț: 498.46 lei - 20%
Preț: 497.55 lei - 20%
Preț: 499.36 lei - 20%
Preț: 390.12 lei - 20%
Preț: 391.20 lei - 20%
Preț: 532.41 lei - 20%
Preț: 391.20 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ț: 390.94 lei - 20%
Preț: 391.86 lei - 20%
Preț: 389.85 lei - 20%
Preț: 498.32 lei - 20%
Preț: 462.67 lei - 20%
Preț: 460.98 lei - 20%
Preț: 424.26 lei - 20%
Preț: 639.72 lei - 15%
Preț: 535.92 lei - 20%
Preț: 532.28 lei - 20%
Preț: 535.77 lei - 5%
Preț: 516.27 lei - 20%
Preț: 461.57 lei - 20%
Preț: 498.50 lei - 20%
Preț: 461.83 lei - 20%
Preț: 249.95 lei
Preț: 381.34 lei
Nou
Puncte Express: 572
Preț estimativ în valută:
67.48€ • 79.13$ • 59.26£
67.48€ • 79.13$ • 59.26£
Carte tipărită la comandă
Livrare economică 04-18 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783030625757
ISBN-10: 3030625753
Pagini: 423
Ilustrații: XIII, 423 p. 123 illus., 14 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.61 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: 3030625753
Pagini: 423
Ilustrații: XIII, 423 p. 123 illus., 14 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.61 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
Signature Schemes.- Group Signature without Random Oracles from Randomizable Signatures.- Constant-size Lattice-Based Group Signature with Forward Security in the Standard Model.- A Lattice-based Provably Secure Multisignature Scheme in Quantum Random Oracle Model.- Achieving Pairing-Free Aggregate Signatures using Pre-Communication between Signers.- Short Lattice Signatures in the Standard Model with Efficient Tag Generation.- One-Time Delegation of Unlinkable Signing Rights and Its Application.- Watermarkable Signature with Computational Function Preserving.- Privacy-Preserving Authentication for Tree-Structured Data with Designated Verification in Outsourced Environments.- Encryption Schemes and NIZKs.- Semi-Adaptively Secure Offine Witness Encryption from Puncturable Witness PRF.-Improved Indistinguishability for Searchable Symmetric Encryption.- Receiver Selective Opening CCA Secure Public Key Encryption from Various Assumptions.- A Practical NIZK Argument for Confidential Transactions over Account-model Blockchain.- Secure Machine Learning and Multiparty Computation.- Secure Cumulative Reward Maximization in Linear Stochastic Bandits.- Secure Transfer Learning for Machine Fault Diagnosis under Different Operating Conditions.- Private Decision Tree Evaluation with Constant Rounds via (Only) SS-3PC over Ring.- Dispelling Myths on Superposition Attacks: Formal Security Model and Attack Analyses.- Secret Sharing Schemes.- Fair and Sound Secret Sharing from Homomorphic Time-Lock Puzzles.- Optimal Threshold Changeable Secret Sharing with New Threshold Change Range.- Security Analyses.- Key Recovery under Plaintext Checking Attack on LAC.- Security of Two NIST Candidates in the Presence of Randomness Reuse.