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 /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Cheng, Chen-Mou (Επιμελητής έκδοσης), Chung, Kai-Min (Επιμελητής έκδοσης), Persiano, Giuseppe (Επιμελητής έκδοσης), Yang, Bo-Yin (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2016.
• Έκδοση: 1st ed. 2016.
• Σειρά: Lecture Notes in Computer Science, 9614
• Θέματα: Computer science.; Computer security.; Data encryption (Computer science).; Coding theory.; Algorithms.; Management information systems.; Computer Science.; Data Encryption.; Systems and Data Security.; Coding and Information Theory.; Algorithm Analysis and Problem Complexity.; Management of Computing and Information Systems.

 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.