Pages that link to "Item:Q3600360"

The following pages link to Advances in Cryptology - ASIACRYPT 2008 (Q3600360):

Displaying 35 items.

• MPC vs. SFE : Unconditional and Computational Security (Q3600361) (← links)
• Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes (Q3600362) (← links)
• Graph Design for Secure Multiparty Computation over Non-Abelian Groups (Q3600363) (← links)
• Some Perspectives on Complexity-Based Cryptography (Q3600364) (← links)
• A Modular Security Analysis of the TLS Handshake Protocol (Q3600365) (← links)
• Ambiguous Optimistic Fair Exchange (Q3600366) (← links)
• Compact Proofs of Retrievability (Q3600367) (← links)
• On the Security of HB# against a Man-in-the-Middle Attack (Q3600368) (← links)
• Hash Functions from Sigma Protocols and Improvements to VSH (Q3600369) (← links)
• Slide Attacks on a Class of Hash Functions (Q3600370) (← links)
• Basing PRFs on Constant-Query Weak PRFs: Minimizing Assumptions for Efficient Symmetric Cryptography (Q3600371) (← links)
• Universally Composable Adaptive Oblivious Transfer (Q3600372) (← links)
• Universally Composable Adaptive Oblivious Transfer (Q3600373) (← links)
• A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting (Q3600375) (← links)
• Towards Robust Computation on Encrypted Data (Q3600376) (← links)
• Efficient Protocols for Set Membership and Range Proofs (Q3600378) (← links)
• Preimage Attacks on 3, 4, and 5-Pass HAVAL (Q3600379) (← links)
• How to Fill Up Merkle-Damgård Hash Functions (Q3600380) (← links)
• Limits of Constructive Security Proofs (Q3600381) (← links)
• Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption (Q3600382) (← links)
• Twisted Edwards Curves Revisited (Q3600383) (← links)
• On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols (Q3600384) (← links)
• Chosen Ciphertext Security with Optimal Ciphertext Overhead (Q3600385) (← links)
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (Q3600386) (← links)
• Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
• Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits (Q3600388) (← links)
• An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity (Q3600389) (← links)
• An Improved Impossible Differential Attack on MISTY1 (Q3600390) (← links)
• Generalized Identity Based and Broadcast Encryption Schemes (Q3600391) (← links)
• Speeding Up the Pollard Rho Method on Prime Fields (Q3600392) (← links)
• Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems (Q3600393) (← links)
• OAEP Is Secure under Key-Dependent Messages (Q3600394) (← links)
• Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear Masks (Q3600395) (← links)
• A New Attack on the LEX Stream Cipher (Q3600396) (← links)
• Breaking the F-FCSR-H Stream Cipher in Real Time (Q3600397) (← links)