Year | Title | Venue |

2014 | Towards Characterizing Complete Fairness in Secure Two-Party Computation | |

2014 | On the Cryptographic Complexity of the Worst Functions | |

2014 | Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol | |

2014 | One-Sided Adaptively Secure Two-Party Computation | |

2014 | Multi-Linear Secret-Sharing Schemes | |

2014 | Broadcast Amplification | |

2014 | Non-Malleable Coding Against Bit-wise and Split-State Tampering | |

2014 | Continuous Non-malleable Codes | |

2014 | Locally Updatable and Locally Decodable Codes | |

2014 | Leakage Resilient Fully Homomorphic Encryption | |

2014 | Securing Circuits and Protocols Against 1/poly(k) Tampering Rate | |

2014 | How to Fake Auxiliary Input | |

2014 | Standard versus Selective Opening Security: Separation and Equivalence Results | |

2014 | Dual System Encryption via Predicate Encodings | |

2014 | General Versus Specific Hardness Assumptions in Cryptography | |

2014 | (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens | |

2014 | Lower Bounds in the Hardware Token Model | |

2014 | Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures | |

2014 | On the Impossibility of Structure-Preserving Deterministic Primitives | |

2014 | Collusion and Privacy in Mechanism Design | |

2014 | Probabilistically Checkable Proofs of Proximity with Zero-Knowledge | |

2014 | Achieving Constant Round Leakage-Resilient Zero-Knowledge | |

2014 | Statistical Concurrent Non-Malleable Zero Knowledge | |

2014 | 4-Round Resettably-Sound Zero Knowledge | |

2014 | Can Optimally-Fair Coin Tossing be Based on One-Way Functions? | |

2014 | On the Power of Public-key Encryption in Secure Computation | |

2014 | On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations | |

2014 | Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding | |

2014 | Obfuscation for Evasive Functions | |

2014 | On Extractability Obfuscation | |

2014 | Two-round Secure MPC from Indistinguishability Obfuscation | |

2014 | Chosen Ciphertext Security via Point Obfuscation | |

2013 | On Symmetric Encryption with Distinguishable Decryption Failures | fse |

2013 | Reflection Cryptanalysis of PRINCE-Like Ciphers | fse |

2013 | Collision Attacks on Up to 5 Rounds of SHA-3 Using Generalized Internal Differentials | fse |

2013 | Security Analysis of PRINCE | fse |

2013 | Masking Tables - An Underestimated Security Risk | fse |

2013 | Related-Key Attacks Against Full Hummingbird-2 | fse |

2013 | A Low Data Complexity Attack on the GMR-2 Cipher Used in the Satellite Phones | fse |

2013 | On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes | fse |

2013 | On the Wrong Key Randomisation and Key Equivalence Hypotheses in Matsui's Algorithm 2 | fse |

2013 | Cryptanalysis of WIDEA | fse |

2013 | Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks | fse |

2013 | Towards Secure Distance Bounding | fse |

2013 | Complementing Feistel Ciphers | fse |

2013 | Secure Message Authentication Against Related-Key Attack | fse |

2013 | ALE: AES-Based Lightweight Authenticated Encryption | fse |

2013 | Partial-Collision Attack on the Round-Reduced Compression Function of Skein-256 | fse |

2013 | A Framework for Automated Independent-Biclique Cryptanalysis | fse |

2013 | Cryptanalysis of Round-Reduced \mathttLED | fse |

2013 | Exhausting Demirci-Selçuk Meet-in-the-Middle Attacks Against Reduced-Round AES | fse |

2013 | Time-Memory Trade-Offs for Near-Collisions | fse |

2013 | A New Criterion for Avoiding the Propagation of Linear Relations Through an Sbox | fse |

2013 | Minimalism of Software Implementation - Extensive Performance Analysis of Symmetric Primitives on the RL78 Microcontroller | fse |

2013 | Attacks and Security Proofs of EAX-Prime | fse |

2013 | Smashing WEP in a Passive Attack | fse |

2013 | Tweakable Blockciphers with Asymptotically Optimal Security | fse |

2013 | Near Collision Attack on the Grain v1 Stream Cipher | fse |

2013 | Higher-Order Side Channel Security and Mask Refreshing | fse |

2013 | Towards Understanding the Known-Key Security of Block Ciphers | fse |

2013 | Rotational Cryptanalysis of Round-Reduced Keccak | fse |

2013 | Full Plaintext Recovery Attack on Broadcast RC4 | fse |

2013 | Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces | asiacrypt |

2013 | Candidate Multilinear Maps from Ideal Lattices | eurocrypt |

2013 | On the Function Field Sieve and the Impact of Higher Splitting Probabilities | crypto |

2013 | Counter-cryptanalysis: reconstructing Flame's new variant collision attack | crypto |

2013 | Lambda Coordinates for Binary Elliptic Curves | ches |

2013 | Locally Computable UOWHF with Linear Shrinkage | eurocrypt |

2013 | Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists | eurocrypt |

2013 | Regularity of Lossy RSA on Subdomains and Its Applications | eurocrypt |

2013 | How to Garble RAM Programs | eurocrypt |

2013 | MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions | eurocrypt |

2013 | Amplification of Chosen-Ciphertext Security | eurocrypt |

2013 | Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions | eurocrypt |

2013 | Practical Homomorphic MACs for Arithmetic Circuits | eurocrypt |

2013 | Streaming Authenticated Data Structures | eurocrypt |

2013 | Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields | eurocrypt |

2013 | How to Watermark Cryptographic Functions | eurocrypt |

2013 | Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption | eurocrypt |

2013 | Practical Signatures from Standard Assumptions | eurocrypt |

2013 | Message-Locked Encryption and Secure Deduplication | eurocrypt |

2013 | Improving Local Collisions: New Attacks on Reduced SHA-256 | eurocrypt |

2013 | Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions | eurocrypt |

2013 | Circular Chosen-Ciphertext Security with Compact Ciphertexts | eurocrypt |

2013 | Efficient Cryptosystems from 2^{ k }-th Power Residue Symbols | eurocrypt |

2013 | Graph-Theoretic Algorithms for the "Isomorphism of Polynomials" Problem | eurocrypt |

2013 | Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions | eurocrypt |

2013 | A Toolkit for Ring-LWE Cryptography | eurocrypt |

2013 | Advances in Cryptology - EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings | eurocrypt |

2013 | Dynamic Proofs of Retrievability via Oblivious RAM | eurocrypt |

2013 | Keccak | eurocrypt |

2013 | Masking against Side-Channel Attacks: A Formal Security Proof | eurocrypt |

2013 | New Collision Attacks on SHA-1 Based on Optimal Joint Local-Collision Analysis | eurocrypt |

2013 | One-Sided Device-Independent QKD and Position-Based Cryptography from Monogamy Games | eurocrypt |

2013 | Multi-party Computation of Polynomials and Branching Programs without Simultaneous Interaction | eurocrypt |

2013 | Resource-Restricted Indifferentiability | eurocrypt |

2013 | Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures | eurocrypt |

2013 | How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation | eurocrypt |

2013 | Lossy Codes and a New Variant of the Learning-With-Errors Problem | eurocrypt |

2013 | Improved Key Recovery Attacks on Reduced-Round AES in the Single-Key Setting | eurocrypt |