Advances in Cryptology – EUROCRYPT 2010 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30 – June 3, 2010. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Gilbert, Henri (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Σειρά: Lecture Notes in Computer Science, 6110
• Θέματα: Computer science.; Computer communication systems.; Computer security.; Data encryption (Computer science).; Algorithms.; Computer science > Mathematics.; Management information systems.; Computer Science.; Data Encryption.; Systems and Data Security.; Computer Communication Networks.; Management of Computing and Information Systems.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.

 These are the proceedings of Eurocrypt 2010, the 29th in the series of Eu- pean conferences on the Theory and Application of Cryptographic Techniques. The conference was sponsored by the International Association for Cryptologic Research and held on the French Riviera, May 30–June 3, 2010. A total of 191 papers were received of which 188 were retained as valid submissions. These were each assigned to at least three Program Committee members and a total of 606 review reports were produced. The printed record of the reviews and extensive online discussions that followed would be almost as voluminous as these proceedings. In the end 35 submissions were accepted with twosubmissionpairsbeingmergedtogive33paperspresentedattheconference. The ?nal papers in these proceedings were not subject to a second review before publication and the authors are responsible for their contents. The ProgramCommittee, listed on the next page, deservesparticular thanks for all their hard work, their outstanding expertise, and their constant c- mitment to all aspects of the evaluation process. These thanks are of course extended to the very many external reviewers who took the time to help out during the evaluation process.It was also a greatpleasure to honor and welcome Moti Yung who gave the 2010 IACR Distinguished Lecture. 

 Cryptosystems I -- On Ideal Lattices and Learning with Errors over Rings -- Fully Homomorphic Encryption over the Integers -- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups -- Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption -- Obfuscation and Side Channel Security -- Secure Obfuscation for Encrypted Signatures -- Public-Key Encryption in the Bounded-Retrieval Model -- Protecting Circuits from Leakage: the Computationally-Bounded and Noisy Cases -- 2-Party Protocols -- Partial Fairness in Secure Two-Party Computation -- Secure Message Transmission with Small Public Discussion -- On the Impossibility of Three-Move Blind Signature Schemes -- Efficient Device-Independent Quantum Key Distribution -- Cryptanalysis -- New Generic Algorithms for Hard Knapsacks -- Lattice Enumeration Using Extreme Pruning -- Algebraic Cryptanalysis of McEliece Variants with Compact Keys -- Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds -- IACR Distinguished Lecture -- Cryptography between Wonderland and Underland -- Automated Tools and Formal Methods -- Automatic Search for Related-Key Differential Characteristics in Byte-Oriented Block Ciphers: Application to AES, Camellia, Khazad and Others -- Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR -- Computational Soundness, Co-induction, and Encryption Cycles -- Models and Proofs -- Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks -- Cryptographic Agility and Its Relation to Circular Encryption -- Bounded Key-Dependent Message Security -- Multiparty Protocols -- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography -- Adaptively Secure Broadcast -- Universally Composable Quantum Multi-party Computation -- Cryptosystems II -- A Simple BGN-Type Cryptosystem from LWE -- Bonsai Trees, or How to Delegate a Lattice Basis -- Efficient Lattice (H)IBE in the Standard Model -- Hash and MAC -- Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation -- Stam’s Collision Resistance Conjecture -- Universal One-Way Hash Functions via Inaccessible Entropy -- Foundational Primitives -- Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions -- Constructing Verifiable Random Functions with Large Input Spaces -- Adaptive Trapdoor Functions and Chosen-Ciphertext Security.