Pages that link to "Item:Q3612540"

The following pages link to Advances in Cryptology - CRYPTO 2007 (Q3612540):

Displaying 50 items.

• Practical Cryptanalysis of SFLASH (Q3612541) (← links)
• Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5 (Q3612542) (← links)
• How Should We Solve Search Problems Privately? (Q3612543) (← links)
• Public Key Encryption That Allows PIR Queries (Q3612544) (← links)
• Cryptography with Constant Input Locality (Q3612545) (← links)
• Universally-Composable Two-Party Computation in Two Rounds (Q3612546) (← links)
• Indistinguishability Amplification (Q3612547) (← links)
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU (Q3612548) (← links)
• Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm (Q3612549) (← links)
• Domain Extension of Public Random Functions: Beyond the Birthday Barrier (Q3612550) (← links)
• Random Oracles and Auxiliary Input (Q3612551) (← links)
• Security-Amplifying Combiners for Collision-Resistant Hash Functions (Q3612552) (← links)
• Hash Functions and the (Amplified) Boomerang Attack (Q3612553) (← links)
• Amplifying Collision Resistance: A Complexity-Theoretic Treatment (Q3612554) (← links)
• How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? (Q3612555) (← links)
• Simulatable VRFs with Applications to Multi-theorem NIZK (Q3612556) (← links)
• Cryptography in the Multi-string Model (Q3612557) (← links)
• Secure Identification and QKD in the Bounded-Quantum-Storage Model (Q3612558) (← links)
• A Tight High-Order Entropic Quantum Uncertainty Relation with Applications (Q3612559) (← links)
• Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach (Q3612560) (← links)
• A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073 (Q3612561) (← links)
• Invertible Universal Hashing and the TET Encryption Mode (Q3612562) (← links)
• Reducing Trust in the PKG in Identity Based Cryptosystems (Q3612563) (← links)
• Pirate Evolution: How to Make the Most of Your Traitor Keys (Q3612564) (← links)
• A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator (Q3612565) (← links)
• A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness (Q3612566) (← links)
• Chernoff-Type Direct Product Theorems (Q3612567) (← links)
• Rerandomizable RCCA Encryption (Q3612568) (← links)
• Deterministic and Efficiently Searchable Encryption (Q3612569) (← links)
• Secure Hybrid Encryption from Weakened Key Encapsulation (Q3612570) (← links)
• Scalable and Unconditionally Secure Multiparty Computation (Q3612571) (← links)
• On Secure Multi-party Computation in Black-Box Groups (Q3612572) (← links)
• A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra (Q3612573) (← links)
• Publication:3612541 (← links)
• Publication:3612542 (← links)
• Publication:3612543 (← links)
• Publication:3612544 (← links)
• Publication:3612545 (← links)
• Publication:3612546 (← links)
• Publication:3612547 (← links)
• Publication:3612548 (← links)
• Publication:3612549 (← links)
• Publication:3612550 (← links)
• Publication:3612551 (← links)
• Publication:3612552 (← links)
• Publication:3612553 (← links)
• Publication:3612554 (← links)
• Publication:3612555 (← links)
• Publication:3612556 (← links)
• Publication:3612557 (← links)