EUROCRYPT 2017:

Jesper Buus Nielsen and Jean-Sébastien Coron (Eds.):
Advances in Cryptology - EUROCRYPT 2017
36th Annual International Conference on the
Theory and Applications of Cryptographic Techniques,
Paris, France,
April 30 - May 4, 2017,
Proceedings, Parts I-III

• Lattice attacks and constructions 1
• Revisiting Lattice Attacks on Overstretched NTRU Parameters , 3-26, Pierre-Alain Fouque , Paul Kirchner
  bib info , video
• Short Generators Without Quantum Computers: The Case of Multiquadratics , 27-59, Daniel J. Bernstein , Tanja Lange , Christine van Vredendaal , Jens Bauch , Henry de Valence
  bib info , video
• Computing Generator in Cyclotomic Integer Rings - A Subfield Algorithm for the Principal Ideal Problem in L _|Δ𝕂| (½) and Application to the Cryptanalysis of a FHE Scheme , 60-88, Pierre-Alain Fouque , Paul Kirchner , Thomas Espitau , Jean-François Biasse , Alexandre Gélin
  bib info , video
• Obfuscation and functional encryption
• Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption , 91-121, Amit Sahai , Prabhanjan Ananth , Aayush Jain
  bib info , video
• From Minicrypt to Obfustopia via Private-Key Functional Encryption , 122-151, Gil Segev , Ilan Komargodski
  bib info , video
• Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps , 152-181, Amit Sahai , Prabhanjan Ananth
  bib info , video
• Discrete logarithm
• Computation of a 768-Bit Prime Field Discrete Logarithm , 185-201, Arjen K. Lenstra , Claus Diem , Thorsten Kleinjung , Christine Priplata , Colin Stahlke
  bib info
• A Kilobit Hidden SNFS Discrete Logarithm Computation , 202-231, Pierrick Gaudry , Emmanuel Thomé , Nadia Heninger , Joshua Fried
  bib info , video
• Multiparty computation 1
• Improved Private Set Intersection Against Malicious Adversaries , 235-259, Mike Rosulek , Peter Rindal
  bib info , video
• Formal Abstractions for Attested Execution Secure Processors , 260-289, Rafael Pass , Elaine Shi , Florian Tramèr
  bib info , video
• Invited talk: Advances in Computer-Aided Cryptography , Gilles Barthe
• Lattice attacks and constructions 2
• One-Shot Verifiable Encryption from Lattices , 293-323, Gregory Neven , Vadim Lyubashevsky
  bib info , video
• Short Stickelberger Class Relations and Application to Ideal-SVP , 324-348, Ronald Cramer , Léo Ducas , Benjamin Wesolowski
  bib info , video
• Universal composability
• Concurrently Composable Security with Shielded Super-Polynomial Simulators , 351-381, Jörn Müller-Quade , Nico Döttling , Gunnar Hartung , Brandon Broadnax , Matthias Nagel
  bib info , video
• Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs , 382-411, Ivan Visconti , Rafail Ostrovsky , Dakshita Khurana , Saikrishna Badrinarayanan
  bib info , video
• Lattice attacks and constructions 3
• Private Puncturable PRFs from Standard Lattice Assumptions , 415-445, Dan Boneh , Hart William Montgomery , Sam Kim
  bib info , video
• Constraint-Hiding Constrained PRFs for NC ¹ from LWE , 446-476, Ran Canetti , Yilei Chen
  bib info , video
• Zero knowledge 1
• Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack , 479-500, Ronald Cramer , Ivan Damgård , Chaoping Xing , Chen Yuan
  bib info , video
• Sublinear Zero-Knowledge Arguments for RAM Programs , 501-531, Payman Mohassel , Mike Rosulek , Alessandra Scafuro
  bib info , video
• Side-channel attacks and countermeasures
• Parallel Implementations of Masking Schemes and the Bounded Moment Leakage Model , 535-566, François-Xavier Standaert , Sebastian Faust , Gilles Barthe , Pierre-Yves Strub , François Dupressoir , Benjamin Grégoire
  bib info , video
• How Fast Can Higher-Order Masking Be in Software? , 567-597, Matthieu Rivain , Dahmun Goudarzi
  bib info , video
• Functional encryption 1
• Multi-input Inner-Product Functional Encryption from Pairings , 601-626, Michel Abdalla , Hoeteck Wee , Mariana Raykova , Romain Gay
  bib info , video
• Simplifying Design and Analysis of Complex Predicate Encryption Schemes , 627-656, Melissa Chase , Shashank Agrawal
  bib info , video
• Elliptic curves
• Twisted μ ₄ -Normal Form for Elliptic Curves , 659-678, David Kohel
  bib info , video
• Efficient Compression of SIDH Public Keys , 679-706, David Jao , Michael Naehrig , Patrick Longa , Craig Costello , Joost Renes , David Urbanik
  bib info
• Functional encryption 2
• On Removing Graded Encodings from Functional Encryption , 3-29, Huijia Lin , Nir Bitansky , Omer Paneth
  bib info , video
• Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions , 30-61, Shashank Agrawal , David J. Wu
  bib info , video
• Lattice attacks and constructions 4
• Random Sampling Revisited: Lattice Enumeration with Discrete Pruning , 65-102, Phong Q. Nguyen , Yoshinori Aono
  bib info , video
• On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL , 103-129, Martin R. Albrecht
  bib info , video
• Small CRT-Exponent RSA Revisited , 130-159, Yao Lu , Liqiang Peng , Atsushi Takayasu
  bib info , video
• Multiparty computation 2
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation , 163-193, Yuval Ishai , Niv Gilboa , Elette Boyle
  bib info
• On the Exact Round Complexity of Self-composable Two-Party Computation , 194-224, Omkant Pandey , Sanjam Garg , Susumu Kiyoshima
  bib info , video
• High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority , 225-255, Jun Furukawa , Yehuda Lindell , Ariel Nof , Or Weinstein
  bib info , video
• Symmetric cryptanalysis 1
• Conditional Cube Attack on Reduced-Round Keccak Sponge Function , 259-288, Xiaoyun Wang , Guangwu Xu , Meiqin Wang , Jingyuan Zhao , Senyang Huang
  bib info , video
• A New Structural-Differential Property of 5-Round AES , 289-317, Christian Rechberger , Sondre Rønjom , Lorenzo Grassi
  bib info , video
• Zero knowledge 2
• Removing the Strong RSA Assumption from Arguments over the Integers , 321-350, David Pointcheval , Thomas Peters , Geoffroy Couteau
  bib info , video
• Magic Adversaries Versus Individual Reduction: Science Wins Either Way , 351-377, Yi Deng
  bib info
• Provable Security for Symmetric Cryptography 1
• The Multi-user Security of Double Encryption , 381-411, Stefano Tessaro , Viet Tung Hoang
  bib info , video
• Public-Seed Pseudorandom Permutations , 412-441, Stefano Tessaro , Pratik Soni
  bib info , video
• Security models 1
• Cryptography with Updates , 445-472, Abhishek Jain , Prabhanjan Ananth , Aloni Cohen
  bib info , video
• Fixing Cracks in the Concrete: Random Oracles with Auxiliary Input, Revisited , 473-495, Jonathan Katz , Yevgeniy Dodis , Siyao Guo
  bib info , video
• Provable Security for Symmetric Cryptography 2
• Modifying an Enciphering Scheme After Deployment , 499-527, Thomas Ristenpart , Yuval Yarom , Paul Grubbs
  bib info , video
• Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption , 528-557, Brent Waters , Venkata Koppula , Rishab Goyal
  bib info , video
• Security models 2
• Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions , 561-591, Mohammad Hajiabadi , Bruce M. Kapron
  bib info , video
• A Note on Perfect Correctness by Derandomization , 592-606, Vinod Vaikuntanathan , Nir Bitansky
  bib info , video
• Blockchain
• Decentralized Anonymous Micropayments , 609-642, Matthew Green , Alessandro Chiesa , Ian Miers , Peihan Miao , Jingcheng Liu , Pratyush Mishra
  bib info , video
• Analysis of the Blockchain Protocol in Asynchronous Networks , 643-673, Rafael Pass , Abhi Shelat , Lior Seeman
  bib info
• Memory hard functions
• Depth-Robust Graphs and Their Cumulative Memory Complexity , 3-32, Joël Alwen , Krzysztof Pietrzak , Jeremiah Blocki
  bib info , video
• Scrypt Is Maximally Memory-Hard , 33-62, Leonid Reyzin , Joël Alwen , Krzysztof Pietrzak , Stefano Tessaro , Binyi Chen
  bib info , video
• Symmetric-key constructions
• Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts , 65-93, Alexander Russell , Gorjan Alagic
  bib info , video
• Boolean Searchable Symmetric Encryption with Worst-Case Sub-linear Complexity , 94-124, Seny Kamara , Tarik Moataz
  bib info , video
• Obfuscation 1
• Patchable Indistinguishability Obfuscation: i O for Evolving Software , 127-155, Amit Sahai , Abhishek Jain , Prabhanjan Ananth
  bib info , video
• Breaking the Sub-Exponential Barrier in Obfustopia , 156-181, Omkant Pandey , Sanjam Garg , Mark Zhandry , Akshayaram Srinivasan
  bib info , video
• Symmetric cryptanalysis 2
• New Impossible Differential Search Tool from Design and Cryptanalysis Aspects - Revealing Structural Properties of Several Ciphers , 185-215, Yu Sasaki , Yosuke Todo
  bib info , video
• New Collision Attacks on Round-Reduced Keccak , 216-243, Jian Guo , Meicheng Liu , Kexin Qiao , Ling Song
  bib info , video
• Obfuscation 2
• Lattice-Based SNARGs and Their Application to More Efficient Obfuscation , 247-277, Dan Boneh , Amit Sahai , Yuval Ishai , David J. Wu
  bib info , video
• Cryptanalyses of Candidate Branching Program Obfuscators , 278-307, Shai Halevi , Craig Gentry , Yilei Chen
  bib info , video
• Quantum cryptography
• Quantum Authentication and Encryption with Key Recycling - Or: How to Re-use a One-Time Pad Even if P=NP - Safely & Feasibly , 311-338, Serge Fehr , Louis Salvail
  bib info , video
• Quantum Authentication with Key Recycling , 339-368, Christopher Portmann
  bib info , video
• Relativistic (or 2-Prover 1-Round) Zero-Knowledge Protocol for NP Secure Against Quantum Adversaries , 369-396, André Chailloux , Anthony Leverrier
  bib info , video
• Multiparty computation 3
• Faster Secure Two-Party Computation in the Single-Execution Setting , 399-424, Jonathan Katz , Alex J. Malozemoff , Xiao Wang
  bib info , video
• Non-interactive Secure 2PC in the Offline/Online and Batch Settings , 425-455, Payman Mohassel , Mike Rosulek
  bib info , video
• Hashing Garbled Circuits for Free , 456-485, Vladimir Kolesnikov , Xiong Fan , Chaya Ganesh
  bib info , video
• Public-key encryption and key-exchange
• Adaptive Partitioning , 489-518, Dennis Hofheinz
  bib info , video
• 0-RTT Key Exchange with Full Forward Secrecy , 519-548, Tibor Jager , Felix Günther , Britta Hale , Sebastian Lauer
  bib info , video
• Multiparty computation 4
• Computational Integrity with a Public Random String from Quasi-Linear PCPs , 551-579, Eran Tromer , Alessandro Chiesa , Eli Ben-Sasson , Daniel Genkin , Madars Virza , Ariel Gabizon , Iddo Bentov , Matan Hamilis , Evgenya Pergament , Michael Riabzev , Mark Silberstein
  bib info , video
• Ad Hoc PSM Protocols: Secure Computation Without Coordination , 580-608, Eyal Kushilevitz , Yuval Ishai , Amos Beimel
  bib info , video
• Topology-Hiding Computation Beyond Logarithmic Diameter , 609-637, Tal Moran , Adi Akavia
  bib info