| Year | Venue | Title |
|---|
| 2012 | crypto | Homomorphic Evaluation of the AES Circuit |
| 2012 | crypto | Differential Privacy with Imperfect Randomness |
| 2012 | crypto | Securing Circuits against Constant-Rate Tampering |
| 2012 | crypto | New Preimage Attacks against Reduced SHA-1 |
| 2012 | crypto | Must You Know the Code of f to Securely Compute f? |
| 2012 | crypto | On the Distribution of Linear Biases: Three Instructive Examples |
| 2012 | crypto | Tweakable Blockciphers with Beyond Birthday-Bound Security |
| 2012 | crypto | Secret Sharing Schemes for Very Dense Graphs |
| 2012 | crypto | Black-Box Constructions of Composable Protocols without Set-Up |
| 2012 | crypto | The End of Crypto |
| 2012 | crypto | Crowd-Blending Privacy |
| 2012 | crypto | Tamper and Leakage Resilience in the Split-State Model |
| 2012 | crypto | Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority |
| 2012 | crypto | Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems |
| 2012 | crypto | New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation |
| 2012 | crypto | Public Keys |
| 2012 | crypto | Hash Functions Based on Three Permutations: A Generic Security Analysis |
| 2012 | crypto | Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs |
| 2012 | crypto | Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption |
| 2012 | crypto | A New Approach to Practical Active-Secure Two-Party Computation |
| 2012 | crypto | Semantic Security for the Wiretap Channel |
| 2012 | crypto | On the Security of TLS-DHE in the Standard Model |
| 2012 | crypto | Universal Composability from Essentially Any Trusted Setup |
| 2012 | crypto | Quantum to Classical Randomness Extractors |
| 2012 | crypto | Breaking and Repairing GCM Security Proofs |
| 2012 | crypto | To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC |
| 2012 | crypto | Secure Identity-Based Encryption in the Quantum Random Oracle Model |
| 2012 | crypto | Functional Encryption for Regular Languages |
| 2012 | crypto | An Enciphering Scheme Based on a Card Shuffle |
| 2012 | crypto | Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits |
| 2012 | crypto | Actively Secure Two-Party Evaluation of Any Quantum Operation |
| 2012 | crypto | Functional Encryption with Bounded Collusions via Multi-party Computation |
| 2012 | crypto | Resistance against Iterated Attacks by Decorrelation Revisited, |
| 2012 | crypto | Adaptively Secure Multi-Party Computation with Dishonest Majority |
| 2012 | crypto | On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups |
| 2012 | crypto | Impossibility Results for Static Input Secure Computation |
| 2012 | crypto | Collusion-Preserving Computation |
| 2012 | crypto | Multiparty Computation from Somewhat Homomorphic Encryption |
| 2012 | crypto | Efficient Padding Oracle Attacks on Cryptographic Hardware |
| 2012 | crypto | Tightly Secure Signatures and Public-Key Encryption |
| 2012 | crypto | The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives |
| 2012 | crypto | Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves |
| 2012 | crypto | Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP |
| 2012 | crypto | Multi-instance Security and Its Application to Password-Based Cryptography |
| 2012 | crypto | Stam's Conjecture and Threshold Phenomena in Collision Resistance |
| 2012 | eurocrypt | Cover and Decomposition Index Calculus on Elliptic Curves Made Practical - Application to a Previously Unreachable Curve over $F_(p^6)$ |
| 2012 | eurocrypt | Malleable Proof Systems and Applications |
| 2012 | eurocrypt | Robust Coin Flipping |
| 2012 | eurocrypt | Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation |
| 2012 | eurocrypt | Identity-Based (Lossy) Trapdoor Functions and Applications |
| 2012 | eurocrypt | Message Authentication, Revisited |
| 2012 | eurocrypt | All-But-Many Lossy Trapdoor Functions |
| 2012 | eurocrypt | Identity-Based Encryption Resilient to Continual Auxiliary Leakage |
| 2012 | eurocrypt | Concurrently Secure Computation in Constant Rounds |
| 2012 | eurocrypt | Quantum Proofs of Knowledge |
| 2012 | eurocrypt | Standard Security Does Not Imply Security against Selective-Opening |
| 2012 | eurocrypt | Pseudorandom Functions and Lattices |
| 2012 | eurocrypt | Efficient Zero-Knowledge Argument for Correctness of a Shuffle |
| 2012 | eurocrypt | Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers |
| 2012 | eurocrypt | Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers |
| 2012 | eurocrypt | Lattice Signatures without Trapdoors |
| 2012 | eurocrypt | Statistical Tools Flavor Side-Channel Collision Attacks |
| 2012 | eurocrypt | On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model |
| 2012 | eurocrypt | Incremental Deterministic Public-Key Encryption |
| 2012 | eurocrypt | Another Look at Provable Security |
| 2012 | eurocrypt | Cryptanalyses on a Merkle-Damgård Based MAC - Almost Universal Forgery and Distinguishing-H Attacks |
| 2012 | eurocrypt | Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security |
| 2012 | eurocrypt | Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE |
| 2012 | eurocrypt | Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations - (Extended Abstract) |
| 2012 | eurocrypt | Fair Computation with Rational Players |
| 2012 | eurocrypt | Narrow-Bicliques: Cryptanalysis of Full IDEA |
| 2012 | eurocrypt | Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding |
| 2012 | eurocrypt | Fully Homomorphic Encryption with Polylog Overhead |
| 2012 | eurocrypt | Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption |
| 2012 | eurocrypt | Tightly-Secure Signatures from Lossy Identification Schemes |
| 2012 | eurocrypt | Optimal Security Proofs for Full Domain Hash, Revisited |
| 2012 | eurocrypt | A Tutorial on High Performance Computing Applied to Cryptanalysis - (Invited Talk Abstract) |
| 2012 | eurocrypt | Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller |
| 2012 | eurocrypt | Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading |
| 2012 | eurocrypt | Property Preserving Symmetric Encryption |
| 2012 | eurocrypt | Unconditionally-Secure Robust Secret Sharing with Compact Shares |
| 2011 | crypto | Leftover Hash Lemma, Revisited |
| 2011 | crypto | Random Oracle Reducibility |
| 2011 | crypto | Time-Lock Puzzles in the Random Oracle Model |
| 2011 | crypto | Physically Uncloneable Functions in the Universal Composition Framework |
| 2011 | crypto | Computer-Aided Security Proofs for the Working Cryptographer |
| 2011 | crypto | Optimal Verification of Operations on Dynamic Sets |
| 2011 | crypto | Verifiable Delegation of Computation over Large Datasets |
| 2011 | crypto | Secure Computation on the Web: Computing without Simultaneous Interaction |
| 2011 | crypto | Memory Delegation |
| 2011 | crypto | Automatic Search of Attacks on Round-Reduced AES and Applications |
| 2011 | crypto | A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack |
| 2011 | crypto | The PHOTON Family of Lightweight Hash Functions |
| 2011 | crypto | Perfectly-Secure Multiplication for any $t |
| 2011 | crypto | The IPS Compiler: Optimizations, Variants and Concrete Efficiency |
| 2011 | crypto | $1/p$-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds |
| 2011 | crypto | Leakage-Resilient Zero Knowledge |
| 2011 | crypto | A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework |
| 2011 | crypto | Generic Side-Channel Distinguishers: Improvements and Limitations |
| 2011 | crypto | Cryptography with Tamperable and Leaky Memory |
| 2011 | crypto | Merkle Puzzles in a Quantum World |
| 2011 | crypto | Classical Cryptographic Protocols in a Quantum World |
| 2011 | crypto | Position-Based Quantum Cryptography: Impossibility and Constructions |
| 2011 | crypto | Analyzing Blockwise Lattice Algorithms using Dynamical Systems |
| 2011 | crypto | Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions |
| 2011 | crypto | Tor and Circumvention: Lessons Learned |
| 2011 | crypto | Fully Homomorphic Encryption over the Integers with Shorter Public Keys |
| 2011 | crypto | Bi-Deniable Public-Key Encryption |
| 2011 | crypto | The Collision Security of Tandem-DM in the Ideal Cipher Model |
| 2011 | crypto | Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions |
| 2011 | crypto | A New Variant of PMAC: Beyond the Birthday Bound |
| 2011 | crypto | Authenticated and Misuse-Resistant Encryption of Key-Dependent Data |
| 2011 | crypto | Round Optimal Blind Signatures in the Standard Model |
| 2011 | crypto | Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups |
| 2011 | crypto | Constant-Rate Oblivious Transfer from Noisy Channels |
| 2011 | crypto | The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing |
| 2011 | crypto | Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials |
| 2011 | crypto | Inverting HFE Systems is Quasi-Polynomial for All Fields |
| 2011 | crypto | Smaller Decoding Exponents: Ball-Collision Decoding |
| 2011 | crypto | McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks |
| 2010 | pkc | Identity-Based Aggregate and Multi-Signature Schemes Based on RSA |
| 2010 | pkc | Secure Network Coding over the Integers |
| 2010 | pkc | Solving a 676-Bit Discrete Logarithm Problem in $GF(3^{6n})$ |
| 2010 | pkc | Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions |
| 2010 | pkc | Preventing Pollution Attacks in Multi-source Network Coding |
| 2010 | pkc | Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA |
| 2010 | pkc | Confidential Signatures and Deterministic Signcryption |
| 2010 | pkc | Text Search Protocols with Simulation Based Security |
| 2010 | pkc | Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments |
| 2010 | pkc | Constant Size Ciphertexts in Threshold Attribute-Based Encryption |
| 2010 | pkc | Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes |
| 2010 | pkc | Faster Pairing Computations on Curves with High-Degree Twists |
| 2010 | pkc | CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model |
| 2010 | pkc | Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval |
| 2010 | pkc | Multi-query Computationally-Private Information Retrieval with Constant Communication Rate |
| 2010 | pkc | Security of Encryption Schemes in Weakened Random Oracle Models |
| 2010 | pkc | Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions |
| 2010 | pkc | Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem |
| 2010 | pkc | Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model |
| 2010 | pkc | More Constructions of Lossy and Correlation-Secure Trapdoor Functions |
| 2010 | pkc | Efficient Set Operations in the Presence of Malicious Adversaries |
| 2010 | pkc | On the Feasibility of Consistent Computations |
| 2010 | pkc | Functional Encryption for Inner Product: Achieving Constant-Size Ciphertexts with Adaptive Security or Support for Negation |
| 2010 | pkc | Efficient Arithmetic on Hessian Curves |
