Pages that link to "Item:Q3183553"

The following pages link to Advances in Cryptology - CRYPTO 2009 (Q3183553):

Displaying 38 items.

• Reconstructing RSA Private Keys from Random Key Bits (Q3183554) (← links)
• Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model (Q3183555) (← links)
• Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate (Q3183556) (← links)
• Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1 (Q3183557) (← links)
• Private Mutual Authentication and Conditional Oblivious Transfer (Q3183558) (← links)
• Randomizable Proofs and Delegatable Anonymous Credentials (Q3183560) (← links)
• Computational Differential Privacy (Q3183561) (← links)
• Probabilistically Checkable Arguments (Q3183562) (← links)
• On the Amortized Complexity of Zero-Knowledge Protocols (Q3183564) (← links)
• Linear Algebra with Sub-linear Zero-Knowledge Arguments (Q3183565) (← links)
• New Birthday Attacks on Some MACs Based on Block Ciphers (Q3183566) (← links)
• Distinguisher and Related-Key Attack on the Full AES-256 (Q3183567) (← links)
• Cryptanalysis of C2 (Q3183568) (← links)
• Message Authentication Codes from Unpredictable Block Ciphers (Q3183569) (← links)
• How to Encipher Messages on a Small Domain (Q3183570) (← links)
• How to Hash into Elliptic Curves (Q3183571) (← links)
• Batch Binary Edwards (Q3183572) (← links)
• Solving Hidden Number Problem with One Bit Oracle and Advice (Q3183573) (← links)
• Computational Indistinguishability Amplification: Tight Product Theorems for System Composition (Q3183574) (← links)
• Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle (Q3183575) (← links)
• Position Based Cryptography (Q3183576) (← links)
• Improving the Security of Quantum Protocols via Commit-and-Open (Q3183577) (← links)
• Practical Cryptanalysis of iso/iec 9796-2 and emv Signatures (Q3183578) (← links)
• How Risky Is the Random-Oracle Model? (Q3183579) (← links)
• Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field (Q3183580) (← links)
• The Round Complexity of Verifiable Secret Sharing Revisited (Q3183581) (← links)
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer (Q3183582) (← links)
• Collusion-Free Multiparty Computation in the Mediated Model (Q3183583) (← links)
• Privacy-Enhancing Auctions Using Rational Cryptography (Q3183584) (← links)
• Utility Dependence in Correct and Fair Rational Secret Sharing (Q3183585) (← links)
• On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem (Q3183586) (← links)
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems (Q3183587) (← links)
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions (Q3183588) (← links)
• The Group of Signed Quadratic Residues and Applications (Q3183589) (← links)
• Short and Stateless Signatures from the RSA Assumption (Q3183590) (← links)
• Smooth Projective Hashing for Conditionally Extractable Commitments (Q3183591) (← links)
• Public-Key Cryptosystems Resilient to Key Leakage (Q5895111) (← links)
• On the Composition of Public-Coin Zero-Knowledge Protocols (Q5895112) (← links)