August 16-20, 2015  
  Santa Barbara, CA, USA  

General Information


NEW 2015!!! We are running dual tracks for most sessions. Track A will be in the University Center (UCEN) Corwin Pavilion and Track B will be in Lotte Lehmann hall, right across from the UCEN. See the map below. All single-track sessions are in Corwin Pavilion.




Sunday, August 16

17:00 - 20:00 Registration, Anacapa Formal Lounge
17:30 - 21:30 Reception Dinner, Anacapa Lawn

Monday, August 17

7:30 - 8:45 Breakfast, Ortega Dining Commons
8:45 - 8:55 Opening remarks, Corwin Pavilion, General Chair Thomas Ristenpart

Track A: Lattice-Based Cryptography
Chair: Zvika Brakerski

Track B: Multiparty Computation I
Chair: Sanjam Garg
9:00 - 9:25 Sieving for Shortest Vectors in Lattices Using Angular Locality-sensitive Hashing
Thijs Laarhoven
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
Ran Canetti, Asaf Cohen, Yehuda Lindell
9:25-9:50 Coded-BKW: Solving LWE Using Lattice Codes
Qian Guo, Thomas Johansson, Paul Stankovski
Concurrent Secure Computation via Non-Black Box Simulation
Vipul Goyal, Divya Gupta, Amit Sahai
Track-switch break
9:55-10:20 An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
Paul Kirchner, Pierre-Alain Fouque
Concurrent Secure Computation with Optimal Query Complexity
Ran Canetti, Vipul Goyal, Abhishek Jain
10:20-10:45 Provably Weak Instances of Ring-LWE
Yara Elias, Kristin E. Lauter, Ekin Ozman, Katherine E. Stange
Constant-Round MPC with Fairness and Guarantee of Output Delivery
S. Dov Gordon, Feng-Hao Liu, Elaine Shi
10:45-11:15 Break - University Center Lagoon Plaza

Invited Talk 1, Corwin Pavilion
The state of cryptographic multilinear maps
Shai Halevi

Chair: Rosario Gennaro

12:30-1:45 Lunch, Ortega Dining Commons
  Track A: Cryptanalytic Insights
Chair: Thomas Johansson
Track B: Zero-Knowledge
Chair: Masa Abe
1:45 - 2:10 Links Among Impossible Differential, Integral and Zero Correlation Linear Cryptanalysis
Bing Sun, Zhiqiang Liu, Vincent Rijmen, Ruilin Li, Lei Cheng, Qingju Wang, Hoda Alkhzaimi, Chao Li
Statistical Concurrent Non-malleable Zero-knowledge from One-way Functions
Susumu Kiyoshima
2:10-2:35 On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure
Alex Biryukov, Léo Perrin
Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting
Fabrice Benhamouda, Geoffroy Couteau, David Pointcheval, Hoeteck Wee
Track-switch break
2:40-3:05 Capacity and Data Complexity in Multidimensional Linear Attack
Jialin Huang, Serge Vaudenay, Xuejia Lai, Kaisa Nyberg
Impossibility of Black-Box Simulation Against Leakage Attacks
Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti
3:05-3:30 Observations on the SIMON Block Cipher Family
Stefan Kölbl, Gregor Leander, Tyge Tiessen
Efficient Zero-Knowledge Proofs of Non-Algebraic Statements with Sublinear Amortized Cost
Zhangxiang Hu, Payman Mohassel, Mike Rosulek
3:30-4:00 Break - University Center Lagoon Plaza
  Track A: Modes and Constructions
Chair: Michel Abdalla
Track B: Theory
Chair: Yehuda Lindell
4:00 - 4:25 Tweaking Even-Mansour Ciphers
Benoît Cogliati, Rodolphe Lampe, Yannick Seurin
Parallel Hashing via List Recoverability
Iftach Haitner, Yuval Ishai, Eran Omri, Ronen Shaltiel
4:25-4:50 Multi-Key Security: The Even-Mansour Construction Revisited
Nicky Mouha, Atul Luykx
Cryptography with One-Way Communication
Sanjam Garg, Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai
4:50-5:15 Reproducible Circularly-Secure Bit Encryption: Applications and Realizations
Mohammad Hajiabadi, Bruce M. Kapron
(Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-way Functions and Beyond
Yu Yu, Dawu Gu, Xiangxue Li, Jian Weng
7:00-9:00 Dinner, Anacapa Lawn

Tuesday, August 18

7:30-8:45 Breakfast, Ortega Dining Commons
  Track A: Multilinear Maps and IO
Chair: Brent Waters
Track B: Signatures
Chair: Marc Fischlin
9:00 - 9:25 Zeroizing Without Low-level Zeroes: New Attacks on Multilinear Maps and Their Limitations
Jean-Sébastien Coron, Craig Gentry, Shai Halevi, Tancrède Lepoint, Hemanta K. Maji, Eric Miles, Mariana Raykova, Amit Sahai, Mehdi Tibouchi
Practical Round-Optimal Blind Signatures in the Standard Model
Georg Fuchsbauer, Christian Hanser, Daniel Slamanig
9:25-9:50 New Multilinear Maps over the Integers
Jean-Sébastien Coron, Tancrède Lepoint, Mehdi Tibouchi
Programmable Hash Functions go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
Dario Catalano, Dario Fiore, Luca Nizzardo
Track-switch break
9:55-10:20 Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation
Kai-Min Chung, Huijia Lin, Rafael Pass
Structure-Preserving Signatures from Standard Assumptions, Revisited
Eike Kiltz, Jiaxin Pan, Hoeteck Wee
10:20-10:45 Indistinguishability Obfuscation from Compact Functional Encryption
Prabhanjan Ananth, Abhishek Jain
Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
Benoît Libert, Thomas Peters, Moti Yung
10:45-11:15 Break - University Center Lagoon Plaza
  Track A: Pseudorandomness
Chair: Dario Fiore
Track B: Multiparty Computation II
Chair: Tal Rabin
11:15 - 11:40 Efficient Pseudorandom Functions via On-the-Fly Adaptation
Nico Döttling, Dominique Schröder
Efficient Constant Round Multi-Party Computation Combining BMR and SPDZ
Yehuda Lindell, Benny Pinkas, Nigel Smart, Avishay Yanay
11:40-12:05 The Iterated Random Permutation Problem with Applications to Cascade Encryption
Brice Minaud, Yannick Seurin
Round-Optimal Black-Box Two-Party Computation
Rafail Ostrovsky, Silas Richelson, Alessandra Scafuro
Track-switch break
12:10-12:35 The Exact PRF Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC
Peter Gaži, Krzysztof Pietrzak, Stefano Tessaro
Secure Computation with Minimal Interaction, Revisited
Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz, Anat Paskin-Cherniavsky
12:35-1:00 An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security
Michel Abdalla, Fabrice Benhamouda, Alain Passelègue
PoW-Based Distributed Cryptography with no Trusted Setup
Marcin Andrychowicz, Stefan Dziembowski
1:00-2:15 Lunch, Ortega Dining Commons
2:30-6:00 Free afternoon
6:00-9:00 Dinner Reception, University Center Lagoon Plaza
7:00-7:15 IACR Award Ceremony, University Center Corwin Pavilion
7:15-11:00 Rump Session, University Center Corwin Pavilion

Wednesday, August 19

7:30 - 8:45 Breakfast, Ortega Dining Commons
  Track A: Block Cipher Cryptanalysis
Chair: Mitsuru Matsui
Track B: Non-Signaling & Information-Theoretic Crypto
Chair: Stefano Tessaro
9:00 - 9:25

Integral Cryptanalysis on Full MISTY1
Yosuke Todo

Best Paper Award and Best Young Researcher Award

Multi-Prover Commitments Against Non-Signaling Attacks
Serge Fehr, Max Fillinger
9:25-9:50 New Attacks on Feistel Structures with Improved Memory Complexities
Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir
Arguments of Proximity
Yael Tauman Kalai, Ron D. Rothblum
Track-switch break
9:55-10:20 Known-key Distinguisher on Full PRESENT
Céline Blondeau, Thomas Peyrin, Lei Wang
Distributions Attaining Secret Key at a Rate of the Conditional Mutual Information
Eric Chitambar, Ben Fortescue, Min-Hsiu Hsieh
10:20-10:45 Key-Recovery Attack on the ASASA Cryptosystem with Expanding S-boxes
Henri Gilbert, Jérôme Plût, Joana Treger
Privacy with Imperfect Randomness
Yevgeniy Dodis, Yanqing Yao
10:45-11:15 Break - University Center Lagoon Plaza

Invited Talk 2, Corwin Pavilion
Cryptography, Security, and Public Safety: A Policy Perspective
Edward Felten

Chair: Matt Robshaw

12:15-1:45 Lunch, Ortega Dining Commons
  Track A: Integrity
Chair: Kaisa Nyberg
Track B: Attribute-based Encryption
Chair: Nigel Smart
1:45 - 2:10 Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance
Viet Tung Hoang, Reza Reyhanitabar, Phillip Rogaway, Damian Vizár
Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption
Romain Gay, Iordanis Kerenidis, Hoeteck Wee
2:10-2:35 Relational Hash: Probabilistic Hash for Verifying Relations, Secure against Forgery and More
Avradip Mandal, Arnab Roy
Predicate Encryption for Circuits from LWE
Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
2:35-3:00 Explicit Non-malleable Codes against Bit-wise Tampering and Permutations
Shashank Agrawal, Divya Gupta, Hemanta K. Maji, Omkant Pandey, Manoj Prabhakaran
Bilinear Entropy Expansion from the Decisional Linear Assumption
Lucas Kowalczyk, Allison B. Lewko
3:00-3:30 Break - University Center Lagoon Plaza
  Track A: Assumptions
Chair: Emmaneul Bresson
Track B: New Primitives
Chair: Melissa Chase
3:30 - 3:55 A Quasipolynomial Reduction for Generalized Selective Decryption on Trees
Georg Fuchsbauer, Zahra Jafargholi, Krzysztof Pietrzak
Data Is a Stream: Security of Stream-Based Channels
Marc Fischlin, Felix Günther, Giorgia Azzurra Marson, Kenneth G. Paterson
3:55-4:20 Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP
Ming-Deh A. Huang, Michiel Kosters, Sze Ling Yeo
Bloom Filters in Adversarial Environments
Moni Naor, Eylon Yogev
4:20-4:45 Cryptanalysis of the Co-ACD Assumption
Pierre-Alain Fouque, Moon Sung Lee, Tancrède Lepoint, Mehdi Tibouchi
Proofs of Space
Stefan Dziembowski, Sebastian Faust, Vladimir Kolmogorov, Krzysztof Pietrzak
4:50-5:50 IACR Membership meeting
6:00-7:30 Beach Barbeque, Goleta Beach
7:30-10:30 Crypto Cafe, Anacapa Formal Lounge

Thursday, August 20

7:30-8:45 Breakfast, Ortega Dining Commons
  Track A: Hash Functions and Stream Cipher Cryptanalysis
Chair: Bart Preneel
Track B: FHE/FE
Chair: Rachel Lin
9:00 - 9:25 Practical Free-Start Collision Attacks on 76-Step SHA-1
Pierre Karpman, Thomas Peyrin, Marc Stevens
Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
Anne Broadbent, Stacey Jeffery
9:25-9:50 Fast Correlation Attacks over Extension Fields, Large-unit Linear Approximation and Cryptanalysis of SNOW 2.0
Bin Zhang, Chao Xu, Willi Meier
Multi-Identity and Multi-Key Leveled FHE from Learning with Errors
Michael Clear, Ciaran McGoldrick
Track-switch break
9:55-10:20 Cryptanalysis of Full Sprout
Virginie Lallemand, María Naya-Plasencia
A Punctured Programming Approach to Adaptively Secure Functional Encryption
Brent Waters
10:20-10:45 Higher-Order Differential Meet-in-The-Middle Preimage Attacks on SHA-1 and BLAKE
Thomas Espitau, Pierre-Alain Fouque, Pierre Karpman
From Selective to Adaptive Security in Functional Encryption
Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan
10:45-11:15 Break - University Center Lagoon Plaza
  Track A: Implementations
Chair: Matt Robshaw
Track B: Multiparty Computation III
Chair: Rosario Gennaro
11:15 - 11:40 Decaf: Eliminating Cofactors Through Point Compression
Mike Hamburg
Secure Computation from Leaky Correlated Randomness
Divya Gupta, Yuval Ishai, Hemanta K. Maji, Amit Sahai
11:40-12:05 Actively Secure OT Extension with Optimal Overhead
Marcel Keller, Emmanuela Orsini, Peter Scholl
Efficient Multi-Party Computation, From Passive to Active Security via Secure SIMD Circuits
Daniel Genkin, Yuval Ishai, Antigoni Polychroniadou
Track-switch break
12:10-12:35 Algebraic Decomposition for Probing Security
Claude Carlet, Emmanuel Prouff, Matthieu Rivain, Thomas Roche
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
Elette Boyle, Kai-Min Chung, Rafael Pass
12:35-1:00 Consolidating Masking Schemes
Oscar Reparaz, Begül Bilgin, Svetla Nikova, Benedikt Gierlichs, Ingrid Verbauwhede
Incoercible Multi-Party Computation and Universally Composable Receipt-Free Voting
Joël Alwen, Rafail Ostrovsky, Hong-Sheng Zhou, Vassilis Zikas
1:00-2:15 Lunch, Ortega Dining Commons