Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/informatique/public-key-cryptography-pkc-2016/cheng/descriptif_3361077
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=3361077

0 article 

 Frais de port 0,01€*

Exclusivité web : à partir de 35 euros d’achat, frais de port à 1 centime pour les expéditions vers la France métropolitaine, la Suisse et l’UE avec Colissimo ou GLS

Public-Key Cryptography - PKC 2016, 1st ed. 2016 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6-9, 2016, Proceedings, Part I Security and Cryptology Series

Langue : Anglais

Coordonnateurs : Cheng Chen-Mou, Chung Kai-Min, Persiano Giuseppe, Yang Bo-Yin

Couverture de l’ouvrage Public-Key Cryptography - PKC 2016

The two-volume set LNCS 9614 and 9615 constitutes the refereed proceedings of the 19th IACR International Conference on the Practice and Theory in Public-Key Cryptography, PKC 2016, held in Taipei, Taiwan, in March 2016.
The 34 revised papers presented were carefully reviewed and selected from 143 submissions. 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.

Trading Plaintext-Awareness for Simulatability to Achieve Chosen Cipher Text Security.- Chosen-Cipher Text Security from Subset Sum.- 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">On the Hardness of Proving CCA-Security of Signed ElGamal.- CA-Secure Keyed-Fully Homomorphic Encryption.- On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions.- Extended Nested Dual System Groups, Revisited.- Functional Encryption for Inner Product with Full Function Privacy.- Deniable Functional Encryption.- Identity-Based Cryptosystems and Quadratic Residuosity.- Identity-based Hierarchical Key-insulated Encryption without Random Oracles.- Attribute-Based Signatures for Circuits from Bilinear Map.- Efficient Unlinkable Sanitizable Signatures from Signatures with Re-Randomizable Keys.- Fault-Tolerant Aggregate Signatures.- Delegatable Functional Signatures.- Mitigating Multi-Target Attacks in Hash-based Signatures.- Nearly Optimal Verifiable Data Streaming.- ARMed SPHINCS Computing a 41 KB signature in 16 KB of RAM.

Includes supplementary material: sn.pub/extras