Public Key Cryptography PKC 2018:

Michel Abdalla (Ed.):

Rio de Janeiro, Brazil
March 25-28, 2018
Proceedings.

• Key-Dependent-Message and Selective-Opening Security
  • New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes, 3-31, Sanjam Garg, Nico Döttling, Mohammad Hajiabadi, Daniel Masny
    bib info
  • Key Dependent Message Security and Receiver Selective Opening Security for Identity-Based Encryption, 32-61, Keisuke Tanaka, Fuyuki Kitagawa
    bib info
  • Tightly SIM-SO-CCA Secure Public Key Encryption from Standard Assumptions, 62-92, Shengli Liu, Dawu Gu, Shuai Han, Lin Lyu
    bib info
• Searchable and Fully Homomorphic Encryption
  • Multi-Key Searchable Encryption, Revisited, 95-124, Abhi Shelat, Daniel Wichs, Mor Weiss, Ariel Hamlin
    bib info
  • Fully Homomorphic Encryption from the Finite Field Isomorphism Problem, 125-155, Joseph H. Silverman, Jeffrey Hoffstein, Berk Sunar, William Whyte, Jill Pipher, Yarkın Doröz, Zhenfei Zhang
    bib info
• Invited Talk: Oblivious Pseudo-Random Functions and Their Applications to Password Protocols by Hugo Krawczyk
  bib info
• Public-Key Encryption
  • Hybrid Encryption in a Multi-user Setting, Revisited, 159-189, Eike Kiltz, Bertram Poettering, Federico Giacon
    bib info
  • Revisiting Proxy Re-encryption: Forward Secrecy, Improved Security, and Applications, 219-250, Stephan Krenn, Christoph Striecks, Daniel Slamanig, David Derler, Thomas Lorünser, Sebastian Ramacher
    bib info
  • KEM Combiners, 190-218, Bertram Poettering, Felix Heuer, Federico Giacon
    bib info
• Encryption with Bad Randomness
  • Hedged Nonce-Based Public-Key Encryption: Adaptive Security Under Randomness Failures, 253-279, Junzuo Lai, Man Ho Au, Jin Li, Zhengan Huang, Wenbin Chen, Zhen Peng
    bib info
  • Related Randomness Security for Public Key Encryption, Revisited, 280-311, Jacob C. N. Schuldt, Takahiro Matsuda
    bib info
• Subversion Resistance
  • Subversion-Zero-Knowledge SNARKs, 315-347, Georg Fuchsbauer
    bib info
  • Public-Key Encryption Resistant to Parameter Subversion and Its Realization from Efficiently-Embeddable Groups, 348-377, Mihir Bellare, Eike Kiltz, Benedikt Auerbach
    bib info
• Cryptanalysis
  • A Practical Cryptanalysis of WalnutDSA^TM, 381-406, Christophe Petit, Daniel Hart, DoHoon Kim, Giacomo Micheli, Guillermo Pascual-Perez, Yuxuan Quek
    bib info
  • Speed-Ups and Time-Memory Trade-Offs for Tuple Lattice Sieving, 407-436, Gottfried Herold, Elena Kirshanova, Thijs Laarhoven
    bib info
  • Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem, 437-460, Goichiro Hanaoka, Tadanori Teruya, Kenji Kashiwabara
    bib info
• Composable Security
  • Reusing Tamper-Proof Hardware in UC-Secure Protocols, 463-493, Jörn Müller-Quade, Tobias Nilges, Jeremias Mechler
    bib info
  • On Composable Security for Digital Signatures, 494-523, Björn Tackmann, Christian Badertscher, Ueli Maurer
    bib info
• Oblivious Transfer
  • Equational Security Proofs of Oblivious Transfer Protocols, 527-553, Daniele Micciancio, Baiyu Li
    bib info
  • Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs, 554-583, Peter Scholl
    bib info
• Multiparty Computation
  • Committed MPC, 587-619, Benny Pinkas, Avishay Yanai, Tore K. Frederiksen
    bib info
  • Fast Garbling of Circuits over 3-Valued Logic, 620-643, Yehuda Lindell, Avishay Yanai
    bib info
  • Efficient Covert Two-Party Computation, 644-674, Stanislaw Jarecki
    bib info
  • Towards Characterizing Securely Computable Two-Party Randomized Functions, 675-697, Manoj Prabhakaran, Deepesh Data
    bib info
  • On the Message Complexity of Secure Multiparty Computation, 698-711, Rafail Ostrovsky, Yuval Ishai, Manika Mittal
    bib info
• Signatures
  • SOFIA: MQ-Based Signatures in the QROM, 3-33, Peter Schwabe, Ming-Shing Chen, Simona Samardjiska, Andreas Hülsing, Joost Rijneveld
    bib info
  • A Unified Framework for Trapdoor-Permutation-Based Sequential Aggregate Signatures, 34-57, Leonid Reyzin, Craig Gentry, Adam O'Neill
    bib info
  • Constant-Size Group Signatures from Lattices, 58-88, Huaxiong Wang, San Ling, Khoa Nguyen, Yanhong Xu
    bib info
  • Attribute-Based Signatures for Unbounded Circuits in the ROM and Efficient Instantiations from Lattices, 89-119, Shuichi Katsumata, Ali El Kaafarani
    bib info
• Structure-Preserving Signatures
  • Improved (Almost) Tightly-Secure Structure-Preserving Signatures , 123-152, Miyako Ohkubo, Charanjit S. Jutla, Arnab Roy
    bib info
  • Weakly Secure Equivalence-Class Signatures from Standard Assumptions, 153-183, Georg Fuchsbauer, Romain Gay
    bib info
• Invited Talk: How (and Why) to Compute on Secret-Shared Values, by Elette Boyle
  bib info
• Functional Encryption
  • Simple and Generic Constructions of Succinct Functional Encryption, 187-217, Keisuke Tanaka, Ryo Nishimaki, Fuyuki Kitagawa
    bib info
  • Making Public Key Functional Encryption Function Private, Distributively, 218-244, Qiang Tang, Xiong Fan
    bib info
  • Full-Hiding (Unbounded) Multi-input Inner Product Functional Encryption from the k-Linear Assumption, 245-277, Tatsuaki Okamoto, Pratish Datta, Junichi Tomida
    bib info
• Foundations
  • Local Non-malleable Codes in the Bounded Retrieval Model, 281-311, Dana Dachman-Soled, Aria Shahverdi, Mukul Kulkarni
    bib info
  • Non-malleability vs. CCA-Security: The Case of Commitments, 312-337, Andy Rupp, Jörn Müller-Quade, Brandon Broadnax, Valerie Fetzer
    bib info
• Obfuscation-Based Cryptographic Constructions
  • Interactively Secure Groups from Obfuscation, 341-370, Dennis Hofheinz, Thomas Agrikola
    bib info
  • Graded Encoding Schemes from Obfuscation, 371-400, Dennis Hofheinz, Pooya Farshim, Julia Hesse, Enrique Larraia
    bib info
• Protocols
  • Hashing Solutions Instead of Generating Problems: On the Interactive Certification of RSA Moduli, 403-430, Bertram Poettering, Benedikt Auerbach
    bib info
  • Two-Factor Authentication with End-to-End Password Security, 431-461, Stanislaw Jarecki, Hugo Krawczyk, Nitesh Saxena, Maliheh Shirvanian
    bib info
• Blockchain
  • Bootstrapping the Blockchain, with Applications to Consensus and Fast PKI Setup, 465-495, Aggelos Kiayias, Juan A. Garay, Giorgos Panagiotakos, Nikos Leonardos
    bib info
• Zero-Knowledge
  • Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits, 499-529, Arpita Patra, Chaya Ganesh, Yashvanth Kondi, Pratik Sarkar
    bib info
  • Compact Zero-Knowledge Proofs of Small Hamming Weight, 530-560, Peter Scholl, Mark Simkin, Ivan Damgârd, Ji Luo, Sabine Oechsner
    bib info
  • Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials, 561-588, Jens Groth, Jonathan Bootle
    bib info
  • On the Security of Classic Protocols for Unique Witness Relations, 589-615, Yi Deng, Yu Chen, Xuyang Song, Jingyue Yu
    bib info
• Lattices
  • New (and Old) Proof Systems for Lattice Problems, 619-643, Chris Peikert, Noah Stephens-Davidowitz, Navid Alamati
    bib info
  • Hash Proof Systems over Lattices Revisited, 644-674, Olivier Blazy, Léo Ducas, Fabrice Benhamouda, Willy Quach
    bib info
  • Privately Constraining and Programming PRFs, the LWE Way, 675-701, Chris Peikert, Sina Shiehian
    bib info
  • Learning with Errors and Extrapolated Dihedral Cosets, 702-727, Damien Stehlé, Zvika Brakerski, Elena Kirshanova, Weiqiang Wen
    bib info
  • Rounded Gaussians, 728-757, Tanja Lange, Andreas Hülsing, Kit Smeets
    bib info