Message-Locked
Encryption for Lock-Dependent Messages
Martin Abadi
and Dan Boneh and Ilya Mironov and Ananth Raghunathan and Gil Segev
Functional
Encryption: New Perspectives and Lower Bounds
Shweta Agrawal and
Sergey Gorbunov and Vinod Vaikuntanathan
and Hoeteck Wee
Practical Bootstrapping in Quasilinear
time
Jacob Alperin-Sheriff and Chris Peikert
Learning with
Rounding, Revisited: New Reduction, Properties and Applications
Joel Alwen and Stephan Krenn
and Krzysztof Pietrzak and Daniel Wichs
On
the Indifferentiability of Key-Alternating Ciphers.
Elena Andreeva
and Andrey Bogdanov and Yevgeniy Dodis and Bart Mennink and John P. Steinberger
Encoding
Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
Benny Applebaum
and Yuval Ishai and Eyal Kushilevitz and Brent Waters
Instantiating
Random Oracles via UCEs
Mihir Bellare, Viet
Tung Hoang, and Sriram Keelveedhi
New Techniques for SPHFs and Efficient
One-Round PAKE Protocols
Fabrice Benhamouda
and Olivier Blazy and Céline Chevalier and David Pointcheval and Damien Vergnaud
SNARKs
for C: Verifying Program Executions Succinctly and in Zero Knowledge
Eli Ben-Sasson
and Alessandro Chiesa and Daniel Genkin and Eran Tromer and Madars Virza
Bounds
in Shallows and in Miseries
Celine Blondeau
and Andrey Bogdanov and
Gregor Leander
Limits of provable security for homomorphic encryption
Andrej Bogdanov and Chin Ho Lee
Key
Homomorphic PRFs and Their Applications
Dan Boneh and
Kevin Lewi and Hart Montgomery and Ananth Raghunathan
Function-Private
Identity-Based Encryption: Hiding the Function in Functional Encryption
Dan Boneh and Ananth Raghunathan and Gil Segev
Secure
Signatures and Chosen Ciphertext Security in a
Quantum Computing World
Dan Boneh and
Mark Zhandry
Secure
Computation Against Adaptive Auxiliary Information
Elette Boyle and Sanjam
Garg and Abhishek Jain
and Yael Tauman Kalai and
Amit Sahai
Obfuscating
Conjunctions
Zvika Brakerski and
Guy N. Rothblum
Quantum
one-time programs
Anne Broadbent and Gus Gutoski and Douglas Stebila
Sieve-in-the-Middle:
Improved MITM Attacks
Anne Canteaut
and Maria Naya-Plasencia and Bastien
Vayssiere
Highly-Scalable
Searchable Symmetric Encryption with Support for Boolean Queries
David Cash and Stanislaw Jarecki and Charanjit Jutla and Hugo Krawczyk and
Marcel Rosu and Michael Steiner
Fully,
(Almost) Tightly Secure IBE from Standard Assumptions and Dual System Groups
Jie Chen and Hoeteck
Wee
Efficient
Multiparty Protocols via Log-Depth Threshold Formulae
Gil Cohen and Ivan Bjerre
Damgard and Yuval Ishai
and Jonas Kolker and Peter Bro Miltersen
and Ran Raz and Ron D. Rothblum
Practical
Multilinear Maps over the Integers
Jean-Sebastien Coron and Tancrede Lepoint and Mehdi Tibouchi
On
the Achievability of Simulation-Based Security for Functional Encryption
Angelo De Caro and Vincenzo Iovino and Abhishek Jain and
Adam O'Neill and Omer Paneth and Giuseppe Persiano
Lattice Signatures and Bimodal Gaussians
Leo Ducas and Alain Durmus and Tancrede Lepoint and Vadim Lyubashevsky
Achieving
the limits of the noisy-storage model using entanglement sampling
Frédéric Dupuis and Omar Fawzi
and Stephanie Wehner
Non-Malleable
Codes from Two-Source Extractors
Stefan Dziembowski
and Tomasz Kazana and Maciej
Obremski
An
Algebraic Framework for Diffie-Hellman Assumptions
Alex Escala and
Gottfried Herold and Eike
Kiltz and Carla Rafols
and Jorge Villar
Hardcore
Predicates for a Diffie-Hellman Problem over Finite
Fields
Nelly Fazio and Rosario Gennaro and Irippuge Milinda Perera and William E. Skeith
Structural Evaluation of AES and Chosen-Key Distinguisher of 9-round AES-128
Pierre-Alain Fouque
and Jérémy Jean and Thomas Peyrin
Optimal
Coding for Streaming Authentication and Interactive Communication
Matthew Franklin and Ran Gelles and Rafail Ostrovsky and Leonard J. Schulman
Programmable
hash functions in the multilinear setting
Eduarda S.V. Freire
and Dennis Hofheinz and Kenneth G. Paterson and Christoph Striecks
Attribute-Based
Encryption for Circuits from Multilinear Maps
Sanjam Garg and Craig
Gentry and Shai Halevi and Amit Sahai
and Brent Waters
Plain
versus Randomized Cascading-Based Key-Length Extension for Block Ciphers
Peter Gazi
Homomorphic Encryption from
Learning with Errors: Conceptually-Simpler, Asymptotically-Faster,
Attribute-Based
Craig Gentry and Amit
Sahai and Brent Waters
How to Run Turing Machines on Encrypted Data
Shafi Goldwasser and
Yael Kalai and Raluca Ada
Popa and Vinod Vaikuntanathan
and Nickolai Zeldovich
On
the Function Field Sieve and the Impact of Higher Splitting Probabilities
Faruk Gologlu,
Robert Granger, Gary McGuire and Jens Zumbragel
What
Information is Leaked under Concurrent Composition?
Vipul Goyal and Divya Gupta and Abhishek Jain
Accuracy-Privacy
Tradeoffs for Two-party Differentially-Private Protocols.
Vipul Goyal and Ilya Mironov and Omkant Pandey and Amit Sahai
A
Dynamic Tradeoff Between Active and Passive Corruptions in Secure Multi-Party
Computation
Martin Hirt and
Christoph Lucas and Ueli
Maurer
Full
Domain Hash from (Leveled) Multilinear Maps and Identity-Based
Aggregate Signatures
Susan Hohenberger
and Amit Sahai and Brent
Waters
Efficient
Secure Two-Party Computation Using Symmetric Cut-and-Choose
Yan Huang and Jonathan Katz and Dave
Evans
Limits
on the Power of Cryptogaphic Cheap Talk
Pavel Hubacek
and Jesper Buus Nielsen
and Alon Rosen
Digital
Signatures with Minimal Overhead from Indifferentiable
Random Invertible Functions.
Eike Kiltz and
Krzysztof Pietrzak and Mario Szegedy
Improved
OT Extension for Transferring Short Secrets and Application to Secure
Multi-Party Computation
Vladimir Kolesnikov
and Ranjit Kumaresan
On
the Security of the TLS Protocol: A Systematic Analysis
Hugo Krawczyk
and Kenneth G. Paterson and Hoeteck Wee
Construction
of Differential Characteristics in ARX Designs -- Application to Skein
Gaëtan Leurent
Linearly
Homomorphic Structure-Preserving Signatures and
Their Applications
Benoit Libert
and Thomas Peters and Marc Joye and Moti Yung
Fast
Cut-and-Choose Based Protocols for Malicious and Covert Adversaries
Yehuda Lindell
Man-in-the-Middle
Secure Authentication Schemes from LPN and Weak PRFs
Vadim Lyubashevsky
and Daniel Masny
Secret
Sharing, Rank Inequalities and Information Inequalities
Sebastian Martin and Carles
Padro and An Yang
Hardness of SIS and LWE with Small Parameters
Daniele Micciancio
and Chris Peikert
Garbled
Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party
Computation
Payman Mohassel and
Ben Riva
On
Fair Exchange, Fair Coins and Fair Sampling
Manoj Prabhakaran
and Shashank Agrawal
The
Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries
Thomas Ristenpart
and Scott Yilek
Leakage-Resilient
Symmetric Cryptography Under Empirically Verifiable Assumptions
Francois-Xavier Standaert
and Olivier Pereira and Yu Yu
Counter-cryptanalysis: reconstructing Flame's
new variant collision attack
Marc Stevens
Fuming
Acid and Cryptanalysis: Handy Tools for Overcoming a Digital Locking and
Access Control System
Daehyun Strobel, Benedikt Driessen, Timo Kasper, David Oswald, Falk Schellenberg,
Gregor Leander, Christof Paar
Time-Optimal
Interactive Proofs for Circuit Evaluation
Justin Thaler
Everlasting
Multi-Party Computation
Dominique Unruh
A Uniform Min-Max Theorem with Applications in
Cryptography
Salil Vadhan and Colin Jia Zheng
Real Time Cryptanalysis of Bluetooth
Encryption with Condition Masking
Bin Zhang and Chao Xu