International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques

Page	Title
1-23	On Ideal Lattices and Learning with Errors over Rings
24-43	Fully Homomorphic Encryption over the Integers
44-61	Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
62-91	Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption
92-112	Secure Obfuscation for Encrypted Signatures
113-134	Public-Key Encryption in the Bounded-Retrieval Model
135-156	Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases
157-176	Partial Fairness in Secure Two-Party Computation
177-196	Secure Message Transmission with Small Public Discussion
197-215	On the Impossibility of Three-Move Blind Signature Schemes
216-234	Efficient Device-Independent Quantum Key Distribution
235-256	New Generic Algorithms for Hard Knapsacks
257-278	Lattice Enumeration Using Extreme Pruning
279-298	Algebraic Cryptanalysis of McEliece Variants with Compact Keys
299-319	Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds
320-321	Cryptography between Wonderland and Underland
322-344	Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others
345-361	Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR
362-380	Computational Soundness, Co-induction, and Encryption Cycles
381-402	Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
403-422	Cryptographic Agility and Its Relation to Circular Encryption
423-444	Bounded Key-Dependent Message Security
445-465	Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
466-485	Adaptively Secure Broadcast
486-505	Universally Composable Quantum Multi-party Computation
506-522	A Simple BGN-Type Cryptosystem from LWE
523-552	Bonsai Trees, or How to Delegate a Lattice Basis
553-572	Efficient Lattice (H)IBE in the Standard Model
573-596	Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation
597-615	Stam's Collision Resistance Conjecture
616-637	Universal One-Way Hash Functions via Inaccessible Entropy
638-655	Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
656-672	Constructing Verifiable Random Functions with Large Input Spaces
673-692	Adaptive Trapdoor Functions and Chosen-Ciphertext Security