1 option
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 / edited by Chen-Mou Cheng, Kai-Min Chung, Giuseppe Persiano, Bo-Yin Yang.
- Format:
- Book
- Series:
- Computer Science (SpringerNature-11645)
- LNCS sublibrary. Security and cryptology ; SL 4, 9614
- Security and Cryptology ; 9614
- Language:
- English
- Subjects (All):
- Cryptography.
- Data encryption (Computer science).
- Data protection.
- Coding theory.
- Information theory.
- Algorithms.
- Electronic data processing-Management.
- Cryptology.
- Data and Information Security.
- Coding and Information Theory.
- IT Operations.
- Local Subjects:
- Cryptology.
- Data and Information Security.
- Coding and Information Theory.
- Algorithms.
- IT Operations.
- Physical Description:
- 1 online resource (XIV, 472 pages) : 46 illustrations in color.
- Edition:
- 1st ed. 2016.
- Contained In:
- Springer Nature eBook
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2016.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-662-49384-7
- 9783662493847
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.