06140nam a22006015i 4500001001800000003000900018005001700027007001500044008004100059020003700100024002400137041000800161050001500169072001600184072002300200082001500223100003200238245025600270260006100526264006100587300003400648336002600682337002600708338003600734347002400770490005800794505245600852520150303308650002204811650003704833650003504870650004004905650002304945650003004968650002504998650002205023650002105045650003705066650002305103650004705126650004605173650005305219700003105272710003405303773002005337776003605357830005805393856003705451912001405488912001405502942000705516999001505523978-3-540-24676-3DE-He21320141014114341.0cr nn 008mamaa121227s2004 gw | s |||| 0|eng d a97835402467639978-3-540-24676-37 a10.1007/b971822doi aeng 4aQA76.9.A25 7aURY2bicssc 7aCOM0530002bisacsh04a005.822231 aCachin, Christian.eeditor.10aAdvances in Cryptology - EUROCRYPT 2004h[electronic resource] :bInternational Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004. Proceedings /cedited by Christian Cachin, Jan L. Camenisch. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2004. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2004. aXII, 630 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v30270 aPrivate 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 -- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data -- Algorithms and Implementation -- Merkle Tree Traversal in Log Space and Time -- Can We Trust Cryptographic Software? Cryptographic Flaws in GNU Privacy Guard v1.2.3 -- Anonymity -- Traceable Signatures -- Handcuffing Big Brother: an Abuse-Resilient Transaction Escrow Scheme -- Anonymous Identification in Ad Hoc Groups. aThese are the proceedings of Eurocrypt 2004, the 23rd Annual Eurocrypt C- ference. The conference was organized by members of the IBM Zurich Research Laboratory in cooperation with IACR, the International Association for Cr- tologic Research. Theconferencereceivedarecordnumberof206submissions,outofwhichthe program committee selected 36 for presentation at the conference (three papers were withdrawn by the authors shortly after submission). These proceedings contain revised versions of the accepted papers. These revisions have not been checked for correctness, and the authors bear full responsibility for the contents of their papers. The conference program also featured two invited talks. The ?rst one was the 2004 IACR Distinguished Lecture given by Whit?eld Di?e. The second invited talk was by Ivan Damg? ard who presented “Paradigms for Multiparty Computation. ” The traditional rump session with short informal talks on recent results was chaired by Arjen Lenstra. The reviewing process was a challenging task, and many good submissions had to be rejected. Each paper was reviewed independently by at least three members of the program committee, and papers co-authored by a member of the program committee were reviewed by at least six (other) members. The individual reviewing phase was followed by profound and sometimes lively d- cussions about the papers, which contributed a lot to the quality of the ?nal selection. Extensive comments were sent to the authors in most cases. 0aComputer science. 0aComputer Communication Networks. 0aOperating systems (Computers). 0aData encryption (Computer science). 0aComputer software. 0aComputational complexity. 0aInformation Systems.14aComputer Science.24aData Encryption.24aComputer Communication Networks.24aOperating Systems.24aAlgorithm Analysis and Problem Complexity.24aDiscrete Mathematics in Computer Science.24aManagement of Computing and Information Systems.1 aCamenisch, Jan L.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540219354 0aLecture Notes in Computer Science,x0302-9743 ;v302740uhttp://dx.doi.org/10.1007/b97182 aZDB-2-SCS aZDB-2-LNC cEB c5537d5537