rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Advances in Cryptology - EUROCRYPT 2004
    sub title: International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004. Proceedings
  name:
    name part: Cachin, Christian.
    role:
      role term: editor.
  name:
    name part: Camenisch, Jan L.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2004
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XII, 630 p. online resource.
  abstract: These 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.
  table of contents: 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 -- P…
  note: edited by Christian Cachin, Jan L. Camenisch.
  subject:
    topic: Computer science
  subject:
    topic: Computer communication systems
  subject:
    topic: Operating systems (Computers)
  subject:
    topic: Data encryption (Computer science)
  subject:
    topic: Algorithms
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Management information systems
  subject:
    topic: Computer Science
  subject:
    topic: Data Encryption
  subject:
    topic: Computer Communication Networks
  subject:
    topic: Operating Systems
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Management of Computing and Information Systems
  classification: QA76.9.A25
  classification: 005.82
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 3027
  identifier: 9783540246763
  identifier: http://dx.doi.org/10.1007/b97182
  record info:
    record creation date: 121227
    record change date: 20151204160858.0
    record identifier: 978-3-540-24676-3