Advances in Cryptology - EUROCRYPT 2004

Private Computation.- Efficient Private Matching and Set Intersection.- Positive Results and Techniques for Obfuscation.- Secure Computation of the k th -Ranked Element.- Signatures I.- Short Signatures Without Random Oracles.- Sequential Aggregate Signatures from Trapdoor Permutations.- Unconditional Security.- On the Key-Uncertainty of Quantum Ciphers and the Computational Security of One-Way Quantum Transmission.- The Exact Price for Unconditionally Secure Asymmetric Cryptography.- On Generating the Initial Key in the Bounded-Storage Model.- Distributed Cryptography.- Practical Large-Scale Distributed Key Generation.- Optimal Communication Complexity of Generic Multicast Key Distribution.- Foundations I.- An Uninstantiable Random-Oracle-Model Scheme for a Hybrid-Encryption Problem.- Black-Box Composition Does Not Imply Adaptive Security.- Identity-Based Encryption.- Chosen-Ciphertext Security from Identity-Based Encryption.- Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles.- Elliptic Curves.- Construction of Secure Random Curves of Genus 2 over Prime Fields.- Projective Coordinates Leak.- Signatures II.- Security Proofs for Identity-Based Identification and Signature Schemes.- Concurrent Signatures.- The Hierarchy of Key Evolving Signatures and a Characterization of Proxy Signatures.- Public-Key Cryptography.- Public-Key Steganography.- Immunizing Encryption Schemes from Decryption Errors.- Secure Hashed Diffie-Hellman over Non-DDH Groups.- Foundations II.- On Simulation-Sound Trapdoor Commitments.- Hash Function Balance and Its Impact on Birthday Attacks.- Multiparty Computation.- Multi-party Computation with Hybrid Security.- On the Hardness of Information-Theoretic Multiparty Computation.- Dining Cryptographers Revisited.-Cryptanalysis.- Algebraic Attacks and Decomposition of Boolean Functions.- Finding Small Roots of Bivariate Integer Polynomial Equations Revisited.- New Applications.- Public Key Encryption with Keyword Search.-