Public-Key Cryptography – PKC 2018

Chapter 1 New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes

Chapter 2 Key Dependent Message Security and Receiver Selective Opening Security for Identity-Based Encryption

Chapter 3 Tightly SIM-SO-CCA Secure Public Key Encryption from Standard Assumptions

Chapter 4 Multi-Key Searchable Encryption, Revisited

Chapter 5 Fully Homomorphic Encryption from the Finite Field Isomorphism Problem

Chapter 6 Hybrid Encryption in a Multi-user Setting, Revisited

Chapter 7 KEM Combiners

Chapter 8 Revisiting Proxy Re-encryption: Forward Secrecy, Improved Security, and Applications

Chapter 9 Hedged Nonce-Based Public-Key Encryption: Adaptive Security Under Randomness Failures

Chapter 10 Related Randomness Security for Public Key Encryption, Revisited

Chapter 11 Subversion-Zero-Knowledge SNARKs

Chapter 12 Public-Key Encryption Resistant to Parameter Subversion and Its Realization from Efficiently-Embeddable Groups

Chapter 13 A Practical Cryptanalysis of WalnutDSA$$^{\text {}}$$

Chapter 14 Speed-Ups and Time–Memory Trade-Offs for Tuple Lattice Sieving

Chapter 15 Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem

Chapter 16 Reusing Tamper-Proof Hardware in UC-Secure Protocols

Chapter 17 On Composable Security for Digital Signatures

Chapter 18 Equational Security Proofs of Oblivious Transfer Protocols

Chapter 19 Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs

Chapter 20 Committed MPC

Chapter 21 Fast Garbling of Circuits over 3-Valued Logic

Chapter 22 Efficient Covert Two-Party Computation

Chapter 23 Towards Characterizing Securely Computable Two-Party Randomized Functions

Chapter 24 On the Message Complexity of Secure Multiparty Computation