Pages that link to "Item:Q3563826"

The following pages link to Advances in Cryptology – EUROCRYPT 2010 (Q3563826):

Displaying 34 items.

• On Ideal Lattices and Learning with Errors over Rings (Q3563827) (← links)
• Fully Homomorphic Encryption over the Integers (Q3563828) (← links)
• Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups (Q3563829) (← links)
• Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption (Q3563830) (← links)
• Secure Obfuscation for Encrypted Signatures (Q3563831) (← links)
• Public-Key Encryption in the Bounded-Retrieval Model (Q3563832) (← links)
• Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases (Q3563833) (← links)
• Partial Fairness in Secure Two-Party Computation (Q3563834) (← links)
• Secure Message Transmission with Small Public Discussion (Q3563835) (← links)
• On the Impossibility of Three-Move Blind Signature Schemes (Q3563836) (← links)
• Efficient Device-Independent Quantum Key Distribution (Q3563837) (← links)
• New Generic Algorithms for Hard Knapsacks (Q3563838) (← links)
• Lattice Enumeration Using Extreme Pruning (Q3563839) (← links)
• Algebraic Cryptanalysis of McEliece Variants with Compact Keys (Q3563840) (← links)
• Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds (Q3563841) (← links)
• Cryptography between Wonderland and Underland (Q3563842) (← links)
• Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others (Q3563843) (← links)
• Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR (Q3563844) (← links)
• Computational Soundness, Co-induction, and Encryption Cycles (Q3563845) (← links)
• Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks (Q3563846) (← links)
• Cryptographic Agility and Its Relation to Circular Encryption (Q3563847) (← links)
• Bounded Key-Dependent Message Security (Q3563848) (← links)
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography (Q3563850) (← links)
• Adaptively Secure Broadcast (Q3563851) (← links)
• Universally Composable Quantum Multi-party Computation (Q3563852) (← links)
• A Simple BGN-Type Cryptosystem from LWE (Q3563853) (← links)
• Bonsai Trees, or How to Delegate a Lattice Basis (Q3563854) (← links)
• Efficient Lattice (H)IBE in the Standard Model (Q3563855) (← links)
• Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation (Q3563856) (← links)
• Stam’s Collision Resistance Conjecture (Q3563857) (← links)
• Universal One-Way Hash Functions via Inaccessible Entropy (Q3563858) (← links)
• Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions (Q3563859) (← links)
• Constructing Verifiable Random Functions with Large Input Spaces (Q3563860) (← links)
• Adaptive Trapdoor Functions and Chosen-Ciphertext Security (Q3563861) (← links)