Publications by Conference

Page	Title
1	Pairing-Based Cryptography: Past, Present, and Future
2-3	Some Mathematical Mysteries in Lattices
4-24	Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
25-42	Dual Form Signatures: An Approach for Proving Security from Static Assumptions
43-60	Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
61-79	On the (Im)possibility of Projecting Property in Prime-Order Setting
80-97	Optimal Reductions of Some Decisional Problems to the Rank Problem
98-115	Signature Schemes Secure against Hard-to-Invert Leakage
116-133	Completeness for Symmetric Two-Party Functionalities - Revisited
134-153	Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
154-171	The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions
172-189	Perfect Algebraic Immune Functions
190-207	Differential Analysis of the LED Block Cipher
208-225	PRINCE - A Low-Latency Block Cipher for Pervasive Computing Applications - Extended Abstract
226-243	Analysis of Differential Attacks in ARX Constructions
244-261	Integral and Multidimensional Linear Distinguishers with Correlation Zero
262-277	Differential Attacks against Stream Cipher ZUC
278-295	An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher
296-312	3kf9: Enhancing 3GPP-MAC beyond the Birthday Bound
313-330	Understanding Adaptivity: Random Systems Revisited
331-348	RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures
349-366	Fully Secure Unbounded Inner-Product and Attribute-Based Encryption
367-385	Computing on Authenticated Data: New Privacy Definitions and Constructions
386-403	A Coding-Theoretic Approach to Recovering Noisy RSA Keys
404-414	Certifying RSA
415-432	Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic
433-450	Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures
451-466	On Polynomial Systems Arising from a Weil Descent
467-484	ECM at Work
485-503	IND-CCA Secure Cryptography Based on a Variant of the LPN Problem
504-525	Provable Security of the Knudsen-Preneel Compression Functions
526-543	Optimal Collision Security in Double Block Length Hashing with Single Length Key
544-561	Bicliques for Permutations: Collision and Preimage Attacks in Stronger Settings
562-579	Investigating Fundamental Security Requirements on Whirlpool: Improved Preimage and Collision Attacks
580-597	Generic Related-Key Attacks for HMAC
598-606	The Five-Card Trick Can Be Done with Four Cards
607-625	A Mix-Net from Any CCA2 Secure Cryptosystem
626-643	How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios
644-662	Sequential Aggregate Signatures with Lazy Verification from Trapdoor Permutations - (Extended Abstract)
663-680	Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
681-698	Calling Out Cheaters: Covert Security with Public Verifiability
699-717	A Unified Framework for UC from Only OT
718-739	Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication
740-757	Shuffling against Side-Channel Attacks: A Comprehensive Study with Cautionary Note
758-775	Theory and Practice of a Leakage Resilient Masking Scheme