Pages that link to "Item:Q4911572"

The following pages link to Advances in Cryptology – ASIACRYPT 2012 (Q4911572):

Displaying 45 items.

• Pairing-Based Cryptography: Past, Present, and Future (Q4911573) (← links)
• Some Mathematical Mysteries in Lattices (Q4911574) (← links)
• Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions (Q4911575) (← links)
• Dual Form Signatures: An Approach for Proving Security from Static Assumptions (Q4911576) (← links)
• Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397) (Q4911577) (← links)
• On the (Im)possibility of Projecting Property in Prime-Order Setting (Q4911578) (← links)
• Optimal Reductions of Some Decisional Problems to the Rank Problem (Q4911579) (← links)
• Signature Schemes Secure against Hard-to-Invert Leakage (Q4911580) (← links)
• Completeness for Symmetric Two-Party Functionalities - Revisited (Q4911581) (← links)
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing (Q4911582) (← links)
• The Generalized Randomized Iterate and Its Application to New Efficient Constructions of UOWHFs from Regular One-Way Functions (Q4911584) (← links)
• Perfect Algebraic Immune Functions (Q4911585) (← links)
• Differential Analysis of the LED Block Cipher (Q4911586) (← links)
• PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications (Q4911587) (← links)
• Analysis of Differential Attacks in ARX Constructions (Q4911588) (← links)
• Integral and Multidimensional Linear Distinguishers with Correlation Zero (Q4911589) (← links)
• Differential Attacks against Stream Cipher ZUC (Q4911590) (← links)
• An Asymptotically Tight Security Analysis of the Iterated Even-Mansour Cipher (Q4911591) (← links)
• 3kf9: Enhancing 3GPP-MAC beyond the Birthday Bound (Q4911592) (← links)
• Understanding Adaptivity: Random Systems Revisited (Q4911593) (← links)
• RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures (Q4911594) (← links)
• Fully Secure Unbounded Inner-Product and Attribute-Based Encryption (Q4911595) (← links)
• Computing on Authenticated Data: New Privacy Definitions and Constructions (Q4911596) (← links)
• A Coding-Theoretic Approach to Recovering Noisy RSA Keys (Q4911597) (← links)
• Certifying RSA (Q4911598) (← links)
• Faster Gaussian Lattice Sampling Using Lazy Floating-Point Arithmetic (Q4911599) (← links)
• Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures (Q4911600) (← links)
• On Polynomial Systems Arising from a Weil Descent (Q4911601) (← links)
• ECM at Work (Q4911602) (← links)
• IND-CCA Secure Cryptography Based on a Variant of the LPN Problem (Q4911603) (← links)
• Provable Security of the Knudsen-Preneel Compression Functions (Q4911604) (← links)
• Optimal Collision Security in Double Block Length Hashing with Single Length Key (Q4911605) (← links)
• Bicliques for Permutations: Collision and Preimage Attacks in Stronger Settings (Q4911606) (← links)
• Investigating Fundamental Security Requirements on Whirlpool: Improved Preimage and Collision Attacks (Q4911607) (← links)
• Generic Related-Key Attacks for HMAC (Q4911608) (← links)
• The Five-Card Trick Can Be Done with Four Cards (Q4911610) (← links)
• A Mix-Net from Any CCA2 Secure Cryptosystem (Q4911611) (← links)
• How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios (Q4911612) (← links)
• Sequential Aggregate Signatures with Lazy Verification from Trapdoor Permutations (Q4911613) (← links)
• Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise (Q4911614) (← links)
• Calling Out Cheaters: Covert Security with Public Verifiability (Q4911615) (← links)
• A Unified Framework for UC from Only OT (Q4911616) (← links)
• Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication (Q4911617) (← links)
• Shuffling against Side-Channel Attacks: A Comprehensive Study with Cautionary Note (Q4911618) (← links)
• Theory and Practice of a Leakage Resilient Masking Scheme (Q4911619) (← links)