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 - ASIACRYPT 2002
    sub title: 8th International Conference on the Theory and Application of Cryptology and Information Security, Queenstown, New Zealand, December 1-5, 2002, Proceedings
  name:
    name part: Zheng, Yuliang.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2002
    edition: 1st ed. 2002.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XIV, 582 p. online resource.
  abstract: This book constitutes the refereed proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2002, held in Singapore, in December 2002. The 34 revised full papers presented together with two invited contributions were carefully reviewed and selected from 173 submissions on the basis of 875 review reports. The papers are organized in topical sections on public key cryptography, authentication, theory, block ciphers, distributed cryptography, cryptanalysis, public key cryptanalysis, secret sharing, digital signatures, applications, Boolean functions, key management, and ID-based cryptography.
  table of contents: Analysis of Bernstein's Factorization Circuit -- A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order -- Looking beyond XTR -- Bounds for Robust Metering Schemes and Their Relationship with A2-code -- Unconditionally Secure Anonymous Encryption and Group Authentication -- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model -- On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives -- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order -- Efficient Oblivious Transfer in the Bounded-Storage Model -- In How Many Ways Can You Write Rijndael? -- On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis -- Threshold Cryptosystems Based on Factoring -- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments -- Asynchronous Secure Communication Tolerating Mixed Adversaries -- Amplified Boomerang Attack against Reduced-Round SHACAL -- Enhancing Differential-Linear Cryptanalysis -- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations -- Analysis of Neural Cryptography -- The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm -- A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2 -- A General Formula of the (t, n)-Threshold Visual Secret Sharing Scheme -- On Unconditionally Secure Robust Distributed Key Distribution Centers -- Short Signatures in the Random Oracle Model -- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes -- Transitive Signatures Based on Factoring and RSA -- 1-out-of-n Signatures from a Variety of Keys -- A Revocation Scheme with Minimal Storage at Receivers -- Optimistic Mixing for Exit-Polls -- Improved Construction of Nonlinear Resilient S-Boxes -- An Upper Bound on the Number of m-Resilient Boolean Functions -- Group Diffie-Hellman Key Exchang…
  note: edited by Yuliang Zheng.
  subject:
    topic: Coding theory
  subject:
    topic: Information theory
  subject:
    topic: Data encryption (Computer science)
  subject:
    topic: Computer communication systems
  subject:
    topic: Operating systems (Computers)
  subject:
    topic: Algorithms
  subject:
    topic: Computer science-Mathematics
  subject:
    topic: Coding and Information Theory
  subject:
    topic: Cryptology
  subject:
    topic: Computer Communication Networks
  subject:
    topic: Operating Systems
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Discrete Mathematics in Computer Science
  classification: QA268
  classification: Q350-390
  classification: 003.54
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 2501
  identifier: 9783540361787
  identifier: https://doi.org/10.1007/3-540-36178-2
  record info:
    record creation date: 121227
    record change date: 20191220130922.0
    record identifier: 978-3-540-36178-7