Cantitate/Preț
Produs

Public-Key Cryptography – PKC 2016: 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6-9, 2016, Proceedings, Part I: Lecture Notes in Computer Science, cartea 9614

Editat de Chen-Mou Cheng, Kai-Min Chung, Giuseppe Persiano, Bo-Yin Yang
en Limba Engleză Paperback – 23 feb 2016
Thetwo-volume set LNCS 9614 and 9615 constitutes the refereed proceedings of the 19thIACR International Conference on the Practiceand Theory in Public-Key Cryptography, PKC 2016, held in Taipei, Taiwan, in March2016.
The34 revised papers presented were carefully reviewed and selected from 143submissions. They are organized in topical sections named: CCA security,functional encryption, identity-based encryption, signatures, cryptanalysis,leakage-resilient and circularly secure encryption, protocols, and primitives.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 39073 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 18 feb 2016 39073 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 23 feb 2016 39109 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 39109 lei

Nou

Puncte Express: 587

Preț estimativ în valută:
7487 7782$ 6208£

Carte tipărită la comandă

Livrare economică 06-20 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783662493830
ISBN-10: 3662493837
Pagini: 465
Ilustrații: XIV, 472 p. 46 illus. in color.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.68 kg
Ediția:1st ed. 2016
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Security and Cryptology

Locul publicării:Berlin, Heidelberg, Germany

Cuprins

Trading Plaintext-Awareness for Simulatability toAchieve Chosen Cipher Text Security.- Chosen-Cipher Text Security from SubsetSum.-mso-fareast-theme-font:minor-latin;mso-hansi-theme-font:minor-latin;mso-bidi-font-family:CMR10;mso-ansi-language:EN-US;mso-fareast-language:EN-US;mso-bidi-language:AR-SA">Onthe Hardness of Proving CCA-Security of Signed ElGamal.- CA-Secure Keyed-FullyHomomorphic Encryption.- On the Key Dependent Message Security of theFujisaki-Okamoto Constructions.- Extended Nested Dual System Groups,Revisited.- Functional Encryption for Inner Product with Full FunctionPrivacy.- Deniable Functional Encryption.- Identity-Based Cryptosystems andQuadratic Residuosity.- Identity-based Hierarchical Key-insulated Encryptionwithout Random Oracles.- Attribute-Based Signatures for Circuits from BilinearMap.- Efficient Unlinkable Sanitizable Signatures from Signatures withRe-Randomizable Keys.- Fault-Tolerant Aggregate Signatures.- DelegatableFunctional Signatures.- Mitigating Multi-Target Attacks in Hash-basedSignatures.- Nearly Optimal Verifiable Data Streaming.- ARMed SPHINCS Computinga 41 KB signature in 16 KB of RAM.

Caracteristici

Includes supplementary material: sn.pub/extras