Pages that link to "Item:Q3058645"

The following pages link to Advances in Cryptology - ASIACRYPT 2010 (Q3058645):

Displaying 35 items.

• Rotational Rebound Attacks on Reduced Skein (Q3058646) (← links)
• Finding Second Preimages of Short Messages for Hamsi-256 (Q3058647) (← links)
• Non-full-active Super-Sbox Analysis: Applications to ECHO and Grøstl (Q3058648) (← links)
• Advanced Meet-in-the-Middle Preimage Attacks: First Results on Full Tiger, and Improved Results on MD4 and SHA-2 (Q3058649) (← links)
• Collision Attacks against the Knudsen-Preneel Compression Functions (Q3058650) (← links)
• Improved Generic Attacks on Unbalanced Feistel Schemes with Expanding Functions (Q3058651) (← links)
• The World Is Not Enough: Another Look on Second-Order DPA (Q3058652) (← links)
• Conditional Differential Cryptanalysis of NLFSR-Based Cryptosystems (Q3058653) (← links)
• A Byte-Based Guess and Determine Attack on SOSEMANUK (Q3058654) (← links)
• Improved Single-Key Attacks on 8-Round AES-192 and AES-256 (Q3058655) (← links)
• Constant-Size Commitments to Polynomials and Their Applications (Q3058656) (← links)
• Computationally Secure Pattern Matching in the Presence of Malicious Adversaries (Q3058657) (← links)
• Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model (Q3058658) (← links)
• Generic Compilers for Authenticated Key Exchange (Q3058659) (← links)
• A Forward-Secure Symmetric-Key Derivation Protocol (Q3058660) (← links)
• Efficient String-Commitment from Weak Bit-Commitment (Q3058661) (← links)
• On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields (Q3058662) (← links)
• Random Oracles with(out) Programmability (Q3058663) (← links)
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments (Q3058664) (← links)
• Short Non-interactive Zero-Knowledge Proofs (Q3058665) (← links)
• Optimistic Concurrent Zero Knowledge (Q3058666) (← links)
• Faster Fully Homomorphic Encryption (Q3058667) (← links)
• A Group Signature Scheme from Lattice Assumptions (Q3058668) (← links)
• Lattice-Based Blind Signatures (Q3058669) (← links)
• The Round Complexity of Verifiable Secret Sharing: The Statistical Case (Q3058670) (← links)
• General Perfectly Secure Message Transmission Using Linear Codes (Q3058672) (← links)
• On Invertible Sampling and Adaptive Security (Q3058673) (← links)
• Multiparty Computation for Modulo Reduction without Bit-Decomposition and a Generalization to Bit-Decomposition (Q3058674) (← links)
• A Closer Look at Anonymity and Robustness in Encryption Schemes (Q3058675) (← links)
• Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures (Q3058676) (← links)
• The Semi-Generic Group Model and Applications to Pairing-Based Cryptography (Q3058677) (← links)
• The Degree of Regularity of HFE Systems (Q3058679) (← links)
• Structured Encryption and Controlled Disclosure (Q3058680) (← links)
• Leakage Resilient ElGamal Encryption (Q3058681) (← links)
• Efficient Public-Key Cryptography in the Presence of Key Leakage (Q3058682) (← links)