Advances in Cryptology, CRYPTO 2016


The information below was collected semi-automatically. The authors have not yet been given the opportunity to verify the data.
[?] We ask all authors to verify the information we have about their papers, in particular the location of any supporting artifacts. We send out emails to authors asking them to update or verify this information incrementally, one conference at a time. For conferences where these emails have yet to be sent out we present the information in gray text.
Title/Authors Title Research Artifacts
[?] A research artifact is any by-product of a research project that is not directly included in the published research paper. In Computer Science research this is often source code and data sets, but it could also be media, documentation, inputs to proof assistants, shell-scripts to run experiments, etc.
Details

Lightweight Multiplication in GF(2^n) with Applications to MDS Matrices

Christof Beierle, Thorsten Kranz, Gregor Leander

Lightweight Multiplication in GF(2^n) with Applications to MDS Matrices

Details
Discussion Comments: 0
Verification: Authors have not verified information

A 2^70 Attack on the Full MISTY1

Achiya Bar-On, Nathan Keller

A 2^70 Attack on the Full MISTY1

Details
Discussion Comments: 0
Verification: Authors have not verified information

The Magic of ELFs

Mark Zhandry

The Magic of ELFs

Details
Discussion Comments: 0
Verification: Author has not verified information

EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC

Benoît Cogliati, Yannick Seurin

EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC

Details
Discussion Comments: 0
Verification: Authors have not verified information

Big-Key Symmetric Encryption: Resisting Key Exfiltration

Mihir Bellare, Daniel Kane, Phillip Rogaway

Big-Key Symmetric Encryption: Resisting Key Exfiltration

Details
Discussion Comments: 0
Verification: Authors have not verified information

Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN

Yu Yu, Jiang Zhang

Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN

Details
Discussion Comments: 0
Verification: Authors have not verified information

The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3

Mihir Bellare, Björn Tackmann

The Multi-user Security of Authenticated Encryption: AES-GCM in TLS 1.3

Details
Discussion Comments: 0
Verification: Authors have not verified information

Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case

Taechan Kim, Razvan Barbulescu

Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case

Details
Discussion Comments: 0
Verification: Authors have not verified information

A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case

Thomas Shrimpton, Martijn Stam, Bogdan Warinschi

A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case

Details
Discussion Comments: 0
Verification: Authors have not verified information

A Practical Cryptanalysis of the Algebraic Eraser

Adi Ben-Zvi, Simon R. Blackburn, Boaz Tsaban

A Practical Cryptanalysis of the Algebraic Eraser

Details
Discussion Comments: 0
Verification: Authors have not verified information

Cryptanalysis of the FLIP Family of Stream Ciphers

Sébastien Duval, Virginie Lallemand, Yann Rotella

Cryptanalysis of the FLIP Family of Stream Ciphers

Details
Discussion Comments: 0
Verification: Authors have not verified information

Message Transmission with Reverse Firewalls - Secure Communication on Corrupted Machines

Yevgeniy Dodis, Ilya Mironov, Noah Stephens-Davidowitz

Message Transmission with Reverse Firewalls - Secure Communication on Corrupted Machines

Details
Discussion Comments: 0
Verification: Authors have not verified information

Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results

Jean Paul Degabriele, Kenneth G. Paterson, Jacob C. N. Schuldt, Joanne Woodage

Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results

Details
Discussion Comments: 0
Verification: Authors have not verified information

Indifferentiability of 8-Round Feistel Networks

Yuanxi Dai, John P. Steinberger

Indifferentiability of 8-Round Feistel Networks

Details
Discussion Comments: 0
Verification: Authors have not verified information

New Insights on AES-Like SPN Ciphers

Bing Sun, Meicheng Liu, Jian Guo, Longjiang Qu, Vincent Rijmen

New Insights on AES-Like SPN Ciphers

Details
Discussion Comments: 0
Verification: Authors have not verified information

Another View of the Division Property

Christina Boura, Anne Canteaut

Another View of the Division Property

Details
Discussion Comments: 0
Verification: Authors have not verified information

Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers

Thomas Peyrin, Yannick Seurin

Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers

Details
Discussion Comments: 0
Verification: Authors have not verified information

A Subfield Lattice Attack on Overstretched NTRU Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes

Martin R. Albrecht, Shi Bai, Léo Ducas

A Subfield Lattice Attack on Overstretched NTRU Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes

Details
Discussion Comments: 0
Verification: Authors have not verified information

Encryption Switching Protocols

Geoffroy Couteau, Thomas Peters, David Pointcheval

Encryption Switching Protocols

Details
Discussion Comments: 0
Verification: Authors have not verified information

Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts

Zvika Brakerski, Renen Perlman

Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts

Details
Discussion Comments: 0
Verification: Authors have not verified information

XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees

Bart Mennink

XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees

Details
Discussion Comments: 0
Verification: Author has not verified information

Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security

Viet Tung Hoang, Stefano Tessaro

Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security

Details
Discussion Comments: 0
Verification: Authors have not verified information

Efficient Algorithms for Supersingular Isogeny Diffie-Hellman

Craig Costello, Patrick Longa, Michael Naehrig

Efficient Algorithms for Supersingular Isogeny Diffie-Hellman

Details
Discussion Comments: 0
Verification: Authors have not verified information

Breaking the Circuit Size Barrier for Secure Computation Under DDH

Elette Boyle, Niv Gilboa, Yuval Ishai

Breaking the Circuit Size Barrier for Secure Computation Under DDH

Details
Discussion Comments: 0
Verification: Authors have not verified information

Optimal Security Proofs for Signatures from Identification Schemes

Eike Kiltz, Daniel Masny, Jiaxin Pan

Optimal Security Proofs for Signatures from Identification Schemes

Details
Discussion Comments: 0
Verification: Authors have not verified information

Circular Security Separations for Arbitrary Length Cycles from LWE

Venkata Koppula, Brent Waters

Circular Security Separations for Arbitrary Length Cycles from LWE

Details
Discussion Comments: 0
Verification: Authors have not verified information

Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE

Navid Alamati, Chris Peikert

Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE

Details
Discussion Comments: 0
Verification: Authors have not verified information

Network Oblivious Transfer

Ranjit Kumaresan, Srinivasan Raghuraman, Adam Sealfon

Network Oblivious Transfer

Details
Discussion Comments: 0
Verification: Authors have not verified information

Obfuscation Combiners

Marc Fischlin, Amir Herzberg, Hod Bin Noon, Haya Shulman

Obfuscation Combiners

Details
Discussion Comments: 0
Verification: Authors have not verified information

Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium

Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan

Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium

Details
Discussion Comments: 0
Verification: Authors have not verified information

Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem

Léo Perrin, Aleksei Udovenko, Alex Biryukov

Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem

Details
Discussion Comments: 0
Verification: Authors have not verified information

Breaking Symmetric Cryptosystems Using Quantum Period Finding

Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, María Naya-Plasencia

Breaking Symmetric Cryptosystems Using Quantum Period Finding

Details
Discussion Comments: 0
Verification: Authors have not verified information

Network-Hiding Communication and Applications to Multi-party Protocols

Martin Hirt, Ueli Maurer, Daniel Tschudi, Vassilis Zikas

Network-Hiding Communication and Applications to Multi-party Protocols

Details
Discussion Comments: 0
Verification: Authors have not verified information

ParTI - Towards Combined Hardware Countermeasures Against Side-Channel and Fault-Injection Attacks

Tobias Schneider, Amir Moradi, Tim Güneysu

ParTI - Towards Combined Hardware Countermeasures Against Side-Channel and Fault-Injection Attacks

Details
Discussion Comments: 0
Verification: Authors have not verified information

Secure Protocol Transformations

Yuval Ishai, Eyal Kushilevitz, Manoj Prabhakaran, Amit Sahai, Ching-Hua Yu

Secure Protocol Transformations

Details
Discussion Comments: 0
Verification: Authors have not verified information

Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks

Patrick Derbez, Pierre-Alain Fouque

Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks

Details
Discussion Comments: 0
Verification: Authors have not verified information

Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13

Eric Miles, Amit Sahai, Mark Zhandry

Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13

Details
Discussion Comments: 0
Verification: Authors have not verified information

Memory-Efficient Algorithms for Finding Needles in Haystacks

Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir

Memory-Efficient Algorithms for Finding Needles in Haystacks

Details
Discussion Comments: 0
Verification: Authors have not verified information

The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS

Christof Beierle, Jérémy Jean, Stefan Kölbl, Gregor Leander, Amir Moradi, Thomas Peyrin, Yu Sasaki, Pascal Sasdrich, Siang Meng Sim

The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS

Details
Discussion Comments: 0
Verification: Authors have not verified information

On Statistically Secure Obfuscation with Approximate Correctness

Zvika Brakerski, Christina Brzuska, Nils Fleischhacker

On Statistically Secure Obfuscation with Approximate Correctness

Details
Discussion Comments: 0
Verification: Authors have not verified information

Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems

Stefan Dziembowski, Sebastian Faust, Gottfried Herold, Anthony Journault, Daniel Masny, François-Xavier Standaert

Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems

Details
Discussion Comments: 0
Verification: Authors have not verified information

Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption

Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai, Eylon Yogev

Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption

Details
Discussion Comments: 0
Verification: Authors have not verified information

On the Communication Required for Unconditionally Secure Multiplication

Ivan Damgård, Jesper Buus Nielsen, Antigoni Polychroniadou, Michael A. Raskin

On the Communication Required for Unconditionally Secure Multiplication

Details
Discussion Comments: 0
Verification: Authors have not verified information

Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli

Takashi Yamakawa, Shota Yamada, Goichiro Hanaoka, Noboru Kunihiro

Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli

Details
Discussion Comments: 0
Verification: Authors have not verified information

Cryptanalysis of GGH15 Multilinear Maps

Jean-Sébastien Coron, Moon Sung Lee, Tancrède Lepoint, Mehdi Tibouchi

Cryptanalysis of GGH15 Multilinear Maps

Details
Discussion Comments: 0
Verification: Authors have not verified information

Efficiently Computing Data-Independent Memory-Hard Functions

Joël Alwen, Jeremiah Blocki

Efficiently Computing Data-Independent Memory-Hard Functions

Details
Discussion Comments: 0
Verification: Authors have not verified information

On the Power of Secure Two-Party Computation

Carmit Hazay, Muthuramakrishnan Venkitasubramaniam

On the Power of Secure Two-Party Computation

Details
Discussion Comments: 0
Verification: Authors have not verified information

FHE Circuit Privacy Almost for Free

Florian Bourse, Rafaël Del Pino, Michele Minelli, Hoeteck Wee

FHE Circuit Privacy Almost for Free

Details
Discussion Comments: 0
Verification: Authors have not verified information

Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security

Zvika Brakerski, Vinod Vaikuntanathan

Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security

Details
Discussion Comments: 0
Verification: Authors have not verified information

Adaptively Secure Garbled Circuits from One-Way Functions

Brett Hemenway, Zahra Jafargholi, Rafail Ostrovsky, Alessandra Scafuro, Daniel Wichs

Adaptively Secure Garbled Circuits from One-Way Functions

Details
Discussion Comments: 0
Verification: Authors have not verified information

Spooky Encryption and Its Applications

Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum, Daniel Wichs

Spooky Encryption and Its Applications

Details
Discussion Comments: 0
Verification: Authors have not verified information

How to Prove Knowledge of Small Secrets

Carsten Baum, Ivan Damgård, Kasper Green Larsen, Michael Nielsen

How to Prove Knowledge of Small Secrets

Details
Discussion Comments: 0
Verification: Authors have not verified information

Linicrypt: A Model for Practical Cryptography

Brent Carmer, Mike Rosulek

Linicrypt: A Model for Practical Cryptography

Details
Discussion Comments: 0
Verification: Authors have not verified information

Probabilistic Termination and Composability of Cryptographic Protocols

Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas

Probabilistic Termination and Composability of Cryptographic Protocols

Details
Discussion Comments: 0
Verification: Authors have not verified information

Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications

Frédéric Dupuis, Serge Fehr, Philippe Lamontagne, Louis Salvail

Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications

Details
Discussion Comments: 0
Verification: Authors have not verified information

Semantic Security and Indistinguishability in the Quantum World

Tommaso Gagliardoni, Andreas Hülsing, Christian Schaffner

Semantic Security and Indistinguishability in the Quantum World

Details
Discussion Comments: 0
Verification: Authors have not verified information

On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings

Benny Applebaum, Pavel Raykov

On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings

Details
Discussion Comments: 0
Verification: Authors have not verified information

Bounded Indistinguishability and the Complexity of Recovering Secrets

Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson

Bounded Indistinguishability and the Complexity of Recovering Secrets

Details
Discussion Comments: 0
Verification: Authors have not verified information

Fully Secure Functional Encryption for Inner Products, from Standard Assumptions

Shweta Agrawal, Benoît Libert, Damien Stehlé

Fully Secure Functional Encryption for Inner Products, from Standard Assumptions

Details
Discussion Comments: 0
Verification: Authors have not verified information

Concurrent Non-Malleable Commitments (and More) in 3 Rounds

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti

Concurrent Non-Malleable Commitments (and More) in 3 Rounds

Details
Discussion Comments: 0
Verification: Authors have not verified information

TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption

Sanjam Garg, Payman Mohassel, Charalampos Papamanthou

TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption

Details
Discussion Comments: 0
Verification: Authors have not verified information

Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes

Jiang Zhang, Yu Chen, Zhenfeng Zhang

Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes

Details
Discussion Comments: 0
Verification: Authors have not verified information

Fine-Grained Cryptography

Akshay Degwekar, Vinod Vaikuntanathan, Prashant Nalini Vasudevan

Fine-Grained Cryptography

Details
Discussion Comments: 0
Verification: Authors have not verified information

UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens

Jan Camenisch, Maria Dubovitskaya, Alfredo Rial

UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens

Details
Discussion Comments: 0
Verification: Authors have not verified information

Two-Message, Oblivious Evaluation of Cryptographic Functionalities

Nico Döttling, Nils Fleischhacker, Johannes Krupp, Dominique Schröder

Two-Message, Oblivious Evaluation of Cryptographic Functionalities

Details
Discussion Comments: 0
Verification: Authors have not verified information

Rate-1, Linear Time and Additively Homomorphic UC Commitments

Ignacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Jesper Buus Nielsen

Rate-1, Linear Time and Additively Homomorphic UC Commitments

Details
Discussion Comments: 0
Verification: Authors have not verified information

Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming

Masayuki Abe, Fumitaka Hoshino, Miyako Ohkubo

Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer Programming

Details
Discussion Comments: 0
Verification: Authors have not verified information

Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials

Melissa Chase, Chaya Ganesh, Payman Mohassel

Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials

Details
Discussion Comments: 0
Verification: Authors have not verified information

Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems

Cynthia Dwork, Moni Naor, Guy N. Rothblum

Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems

Details
Discussion Comments: 0
Verification: Authors have not verified information

Quantum Homomorphic Encryption for Polynomial-Sized Circuits

Yfke Dulek, Christian Schaffner, Florian Speelman

Quantum Homomorphic Encryption for Polynomial-Sized Circuits

Details
Discussion Comments: 0
Verification: Authors have not verified information