Publications by Conference

Page	Title
1-20	BKZ 2.0: Better Lattice Security Estimates
21-40	Functional Encryption for Inner Product Predicates from Learning with Errors
41-69	Random Oracles in a Quantum World
70-88	Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
89-106	Structure Preserving CCA Secure Encryption and Applications
107-124	Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
125-142	Lower and Upper Bounds for Deniable Public-Key Encryption
143-160	Bridging Broadcast Encryption and Group Key Agreement
161-178	On the Joint Security of Encryption and Signature, Revisited
179-196	Polly Cracker, Revisited
197-214	Oblivious RAM with O((logN)3) Worst-Case Cost
215-232	Noiseless Database Privacy
233-251	The Preimage Security of Double-Block-Length Compression Functions
252-269	Rebound Attack on JH42
270-287	Second-Order Differential Collisions for Reduced SHA-256
288-307	Finding SHA-2 Characteristics: Searching through a Minefield of Contradictions
308-326	Cryptanalysis of ARMADILLO2
327-343	An Experimentally Verified Attack on Full Grain-128 Using Dedicated Reconfigurable Hardware
344-371	Biclique Cryptanalysis of the Full AES
372-389	Tag Size Does Matter: Attacks and Proofs for the TLS Record Protocol
390-406	Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge
407-430	Two Provers in Isolation
431-448	Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments
449-467	A Framework for Practical Universally Composable Zero-Knowledge Protocols
468-485	Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
486-503	Cryptography Secure against Related-Key Attacks and Tampering
504-519	Counting Points on Genus 2 Curves with Real Multiplication
520-537	On the Efficiency of Bit Commitment Reductions
538-555	Secure Communication in Multicast Graphs
556-571	Constant-Round Private Function Evaluation with Linear Complexity
572-589	Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
590-609	Computational Verifiable Secret Sharing Revisited
610-627	Natural Generalizations of Threshold Secret Sharing
628-646	Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
647-666	Short Signatures from Weaker Assumptions
667-685	Practical Key-Recovery for All Possible Parameters of SFLASH
686-701	The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy
702-721	Leakage-Resilient Cryptography from the Inner-Product Extractor
722-739	Program Obfuscation with Leaky Hardware
740-758	BiTR: Built-in Tamper Resilience