Public-Key Cryptography – PKC 2018: 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil, March 25-29, 2018, Proceedings, Part I

Description

The two-volume set LNCS 10769 and 10770 constitutes the refereed proceedings of the 21st IACR International Conference on the Practice and Theory of Public-Key Cryptography, PKC 2018, held in Rio de Janeiro, Brazil, in March 2018. The 49 revised papers presented were carefully reviewed and selected from 186 submissions. They are organized in topical sections such as Key-Dependent-Message and Selective-Opening Security; Searchable and Fully Homomorphic Encryption; Public-Key Encryption; Encryption with Bad Randomness; Subversion Resistance; Cryptanalysis; Composable Security; Oblivious Transfer; Multiparty Computation; Signatures; Structure-Preserving Signatures; Functional Encryption; Foundations; Obfuscation-Based Cryptographic Constructions; Protocols; Blockchain; Zero-Knowledge; Lattices. Front Matter ....Pages I-XIX Front Matter ....Pages 1-1 New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes (Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny)....Pages 3-31 Key Dependent Message Security and Receiver Selective Opening Security for Identity-Based Encryption (Fuyuki Kitagawa, Keisuke Tanaka)....Pages 32-61 Tightly SIM-SO-CCA Secure Public Key Encryption from Standard Assumptions (Lin Lyu, Shengli Liu, Shuai Han, Dawu Gu)....Pages 62-92 Front Matter ....Pages 93-93 Multi-Key Searchable Encryption, Revisited (Ariel Hamlin, Abhi Shelat, Mor Weiss, Daniel Wichs)....Pages 95-124 Fully Homomorphic Encryption from the Finite Field Isomorphism Problem (Yarkın Doröz, Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman, Berk Sunar, William Whyte et al.)....Pages 125-155 Front Matter ....Pages 157-157 Hybrid Encryption in a Multi-user Setting, Revisited (Federico Giacon, Eike Kiltz, Bertram Poettering)....Pages 159-189 KEM Combiners (Federico Giacon, Felix Heuer, Bertram Poettering)....Pages 190-218 Revisiting Proxy Re-encryption: Forward Secrecy, Improved Security, and Applications (David Derler, Stephan Krenn, Thomas Lorünser, Sebastian Ramacher, Daniel Slamanig, Christoph Striecks)....Pages 219-250 Front Matter ....Pages 251-251 Hedged Nonce-Based Public-Key Encryption: Adaptive Security Under Randomness Failures (Zhengan Huang, Junzuo Lai, Wenbin Chen, Man Ho Au, Zhen Peng, Jin Li)....Pages 253-279 Related Randomness Security for Public Key Encryption, Revisited (Takahiro Matsuda, Jacob C. N. Schuldt)....Pages 280-311 Front Matter ....Pages 313-313 Subversion-Zero-Knowledge SNARKs (Georg Fuchsbauer)....Pages 315-347 Public-Key Encryption Resistant to Parameter Subversion and Its Realization from Efficiently-Embeddable Groups (Benedikt Auerbach, Mihir Bellare, Eike Kiltz)....Pages 348-377 Front Matter ....Pages 379-379 A Practical Cryptanalysis of WalnutDSA\(^{\text {TM}}\) (Daniel Hart, DoHoon Kim, Giacomo Micheli, Guillermo Pascual-Perez, Christophe Petit, Yuxuan Quek)....Pages 381-406 Speed-Ups and Time–Memory Trade-Offs for Tuple Lattice Sieving (Gottfried Herold, Elena Kirshanova, Thijs Laarhoven)....Pages 407-436 Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem (Tadanori Teruya, Kenji Kashiwabara, Goichiro Hanaoka)....Pages 437-460 Front Matter ....Pages 461-461 Reusing Tamper-Proof Hardware in UC-Secure Protocols (Jeremias Mechler, Jörn Müller-Quade, Tobias Nilges)....Pages 463-493 On Composable Security for Digital Signatures (Christian Badertscher, Ueli Maurer, Björn Tackmann)....Pages 494-523 Front Matter ....Pages 525-525 Equational Security Proofs of Oblivious Transfer Protocols (Baiyu Li, Daniele Micciancio)....Pages 527-553 Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs (Peter Scholl)....Pages 554-583 Front Matter ....Pages 585-585 Committed MPC (Tore K. Frederiksen, Benny Pinkas, Avishay Yanai)....Pages 587-619 Fast Garbling of Circuits over 3-Valued Logic (Yehuda Lindell, Avishay Yanai)....Pages 620-643 Efficient Covert Two-Party Computation (Stanislaw Jarecki)....Pages 644-674 Towards Characterizing Securely Computable Two-Party Randomized Functions (Deepesh Data, Manoj Prabhakaran)....Pages 675-697 On the Message Complexity of Secure Multiparty Computation (Yuval Ishai, Manika Mittal, Rafail Ostrovsky)....Pages 698-711 Back Matter ....Pages 713-714