Cantitate/Preț
Produs
Total produse
Vezi coșul
Provable and Practical Security de Qiong Huang

Provable and Practical Security: Lecture Notes in Computer Science, cartea 13059

Editat de Qiong Huang, Yu Yu
en Limba Engleză Paperback – 27 oct 2021
This book constitutes the refereed proceedings of the 15th International Conference on Provable Security, ProvSec 2021, held in Guangzhou, China, in November 2021.  The 21 full papers presented were carefully reviewed and selected from 67 submissions. The papers focus on provable security as an essential tool for analyzing security of modern cryptographic primitives. They are divided in the following topical sections: Searchable Encryption, Key Exchange & Zero Knowledge Proof, Post Quantum Cryptography, Functional Encryption, Digital Signature, and Practical Security Protocols.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 49229 lei

Preț vechi: 61535 lei
-20%

Puncte Express: 738
Preț estimativ în valută:
8705€ • 9982$ • 7524£

Carte tipărită la comandă

Livrare economică 27 aprilie-11 mai

 Adaugă în coș

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

Specificații

ISBN-13: 9783030904012
ISBN-10: 3030904016
Pagini: 408
Ilustrații: XIII, 393 p. 70 illus., 30 illus. in color.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1st edition 2021
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

Searchable Encryption.- Public Key Based Searchable Encryption with Fine-Grained Sender Permission Control.- Improved Security Model for Public-key Authenticated Encryption with Keyword Search.- Public Key Encryption with Fuzzy Matching.- Partitioned Searchable Encryption.- Key Exchange & Zero Knowledge Proof.- Key Exposure Resistant Group Key Agreement Protocol.- NIKE from Affine Determinant Programs.- OrBit: OR-Proof Identity-Based Identification with Tight Security for (as low as) 1-bit Loss.- Card-based Zero-knowledge Proof Protocols for Graph Problems and Their Computational Model.- Post Quantum Cryptography.- Recovery Attack on Bob's Reused Randomness in CRYSTALS-KYBER and SABERA Lattice Reduction Algorithm Based on Sublattice BKZ.- On the (M)iNTRU assumption in the integer case.- Functional Encryption.- Verifiable Functional Encryption using Intel SGX.- Fully Secure Unbounded Zero Inner Product Encryption with Short Ciphertexts and Keys.- Inner-Product Functional Encryption from Random Linear Codes: Trial and Challenges.- Digital Signature.- A CCA-full-anonymous Group Signature with Verifiable Controllable Linkability in the Standard Model.- Cryptanalysis of LRainbow: The Lifted Rainbow Signature Scheme.- Identification Scheme and Forward-Secure Signature in Identity-Based Setting from Isogenies.- Linearly Homomorphic Signatures with Designated Combiner.- Efficient Attribute-Based Signature for monotone predicates.- Practical Security Protocols.- Spatial Steganalysis Based on Gradient-Based Neural Architecture Search.- Turn-Based Communication Channels.-