Year | Title | Venue |

2016 | Breaking the Circuit Size Barrier for Secure Computation Under DDH | crypto |

2016 | Integrals Go Statistical: Cryptanalysis of Full Skipjack Variants | fse |

2016 | Efficient Design Strategies Based on the AES Round Function | fse |

2016 | Analysis of the Kupyna-256 Hash Function | fse |

2016 | White-Box Cryptography in the Gray Box - - A Hardware Implementation and its Side Channels - | fse |

2016 | A MAC Mode for Lightweight Block Ciphers | fse |

2016 | New Bounds for Keyed Sponges with Extendable Output: Independence Between Capacity and Message Length | fse |

2016 | There Is Wisdom in Harnessing the Strengths of Your Enemy: Customized Encoding to Thwart Side-Channel Attacks | fse |

2016 | Note on Impossible Differential Attacks | fse |

2016 | RIV for Robust Authenticated Encryption | fse |

2016 | Automatic Search for the Best Trails in ARX: Application to Block Cipher Speck | fse |

2016 | Related-Key Almost Universal Hash Functions: Definitions, Constructions and Applications | fse |

2016 | On the Construction of Lightweight Circulant Involutory MDS Matrices | fse |

2016 | Automatic Search for Key-Bridging Technique: Applications to LBlock and TWINE | fse |

2016 | Verifiable Side-Channel Security of Cryptographic Implementations: Constant-Time MEE-CBC | fse |

2016 | Cryptanalysis of the Full Spritz Stream Cipher | fse |

2016 | Detecting Flawed Masking Schemes with Leakage Detection Tests | fse |

2016 | Optimizing S-Box Implementations for Several Criteria Using SAT Solvers | fse |

2016 | Modeling Random Oracles Under Unpredictable Queries | fse |

2016 | Bit-Based Division Property and Application to Simon Family | fse |

2016 | Key Recovery Attack Against 2.5-Round \pi -Cipher | fse |

2016 | Cryptanalysis of Reduced NORX | fse |

2016 | Attacks Against Filter Generators Exploiting Monomial Mappings | fse |

2016 | Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression | fse |

2016 | Algebraic Insights into the Secret Feistel Network | fse |

2016 | Practical Order-Revealing Encryption with Limited Leakage | fse |

2016 | Improved Linear Hull Attack on Round-Reduced Simon with Dynamic Key-Guessing Techniques | fse |

2016 | Lightweight MDS Generalized Circulant Matrices | fse |

2016 | Strengthening the Known-Key Security Notion for Block Ciphers | fse |

2016 | MILP-Based Automatic Search Algorithms for Differential and Linear Trails for Speck | fse |

2016 | Fast Software Encryption - 23rd International Conference, FSE 2016, Bochum, Germany, March 20-23, 2016, Revised Selected Papers | fse |

2016 | Functional Encryption for Turing Machines | tcc |

2016 | Oblivious Parallel RAM and Applications | tcc |

2016 | Perfect Structure on the Edge of Chaos - Trapdoor Permutations from Indistinguishability Obfuscation | tcc |

2016 | Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM | tcc |

2016 | Information-Theoretic Local Non-malleable Codes and Their Applications | tcc |

2016 | How to Avoid Obfuscation Using Witness PRFs | tcc |

2016 | Non-Malleable Encryption: Simpler, Shorter, Stronger | tcc |

2016 | On the Correlation Intractability of Obfuscated Pseudorandom Functions | tcc |

2016 | Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs | tcc |

2016 | On Basing Private Information Retrieval on NP-Hardness | tcc |

2016 | Cutting-Edge Cryptography Through the Lens of Secret Sharing | tcc |

2016 | Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part II | tcc |

2016 | On the Hardness of Learning with Rounding over Small Modulus | tcc |

2016 | Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography | tcc |

2016 | Verifiable Random Functions from Standard Assumptions | tcc |

2016 | From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back | tcc |

2016 | Cryptographic Assumptions: A Position Paper | tcc |

2016 | On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models | tcc |

2016 | Oblivious Parallel RAM: Improved Efficiency and Generic Constructions | tcc |

2016 | Characterization of Secure Multiparty Computation Without Broadcast | tcc |

2016 | Adaptive Security with Quasi-Optimal Rate | tcc |

2016 | Optimal Computational Split-state Non-malleable Codes | tcc |

2016 | Optimal Amplification of Noisy Leakages | tcc |

2016 | Output-Compressing Randomized Encodings and Applications | tcc |

2016 | Theory of Cryptography - 13th International Conference, TCC 2016-A, Tel Aviv, Israel, January 10-13, 2016, Proceedings, Part I | tcc |

2016 | Indistinguishability Obfuscation: From Approximate to Exact | tcc |

2016 | Simplified Universal Composability Framework | tcc |

2016 | Functional Encryption Without Obfuscation | tcc |

2016 | Lower Bounds on Assumptions Behind Indistinguishability Obfuscation | tcc |

2016 | Déjà Q: Encore! Un Petit IBE | tcc |

2016 | Standard Security Does Imply Security Against Selective Opening for Markov Distributions | tcc |

2016 | Two-Round Man-in-the-Middle Security from LPN | tcc |

2016 | Homomorphic Evaluation Requires Depth | tcc |

2016 | Reconfigurable Cryptography: A Flexible Approach to Long-Term Security | tcc |

2016 | Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits | tcc |

2016 | On Constructing One-Way Permutations from Indistinguishability Obfuscation | tcc |

2016 | Rational Sumchecks | tcc |

2016 | A Study of Pair Encodings: Predicate Encryption in Prime Order Groups | tcc |

2016 | Contention in Cryptoland: Obfuscation, Leakage and UCE | tcc |

2016 | Point-Function Obfuscation: A Framework and Generic Constructions | tcc |

2016 | Order-Revealing Encryption and the Hardness of Private Learning | tcc |

2016 | Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings | tcc |

2016 | A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles | tcc |

2016 | Multilinear Maps from Obfuscation | tcc |

2016 | The Complexity of Computing the Optimal Composition of Differential Privacy | tcc |

2016 | On the Complexity of Additively Homomorphic UC Commitments | tcc |

2016 | Interactive Coding for Interactive Proofs | tcc |

2016 | Improved OR-Composition of Sigma-Protocols | tcc |

2016 | Non-Malleable Functions and Their Applications | pkc |

2016 | Functional Encryption for Inner Product with Full Function Privacy | pkc |

2016 | On the Hardness of Proving CCA-Security of Signed ElGamal | pkc |

2016 | CCA-Secure Keyed-Fully Homomorphic Encryption | pkc |

2016 | Extended Nested Dual System Groups, Revisited | pkc |

2016 | Robust Secret Sharing Schemes Against Local Adversaries | pkc |

2016 | Easing Coppersmith Methods Using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness | pkc |

2016 | Attribute-Based Signatures for Circuits from Bilinear Map | pkc |

2016 | ARMed SPHINCS - Computing a 41 KB Signature in 16 KB of RAM | pkc |

2016 | Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security | pkc |

2016 | Leakage-Resilient Public-Key Encryption from Obfuscation | pkc |

2016 | Indistinguishability Obfuscation with Non-trivial Efficiency | pkc |

2016 | Fault-Tolerant Aggregate Signatures | pkc |

2016 | Very-Efficient Simulatable Flipping of Many Coins into a Well - (and a New Universally-Composable Commitment Scheme) | pkc |

2016 | Delegatable Functional Signatures | pkc |

2016 | Public-Key Cryptography - PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6-9, 2016, Proceedings, Part I | pkc |

2016 | How to Generalize RSA Cryptanalyses | pkc |

2016 | KDM-Security via Homomorphic Smooth Projective Hashing | pkc |

2016 | On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions | pkc |

2016 | Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE) | pkc |

2016 | Asynchronous Secure Multiparty Computation in Constant Time | pkc |