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: Topics in Cryptology - CT-RSA 2010
    sub title: The Cryptographers’ Track at the RSA Conference 2010, San Francisco, CA, USA, March 1-5, 2010. Proceedings
  name:
    name part: Pieprzyk, Josef.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2010
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: 397 p. 43 illus. online resource.
  table of contents: Invited Talk -- The First 30 Years of Cryptographic Hash Functions and the NIST SHA-3 Competition -- Public-Key Cryptography -- Errors Matter: Breaking RSA-Based PIN Encryption with Thirty Ciphertext Validity Queries -- Efficient CRT-RSA Decryption for Small Encryption Exponents -- Resettable Public-Key Encryption: How to Encrypt on a Virtual Machine -- Plaintext-Awareness of Hybrid Encryption -- Speed Records for NTRU -- High-Speed Parallel Software Implementation of the ? T Pairing -- Refinement of Miller’s Algorithm Over Edwards Curves -- Probabilistic Public Key Encryption with Equality Test -- Efficient CCA-Secure PKE from Identity-Based Techniques -- Anonymity from Asymmetry: New Constructions for Anonymous HIBE -- Making the Diffie-Hellman Protocol Identity-Based -- On Extended Sanitizable Signature Schemes -- Side-Channel Attacks -- Unrolling Cryptographic Circuits: A Simple Countermeasure Against Side-Channel Attacks -- Fault Attacks Against emv Signatures -- Revisiting Higher-Order DPA Attacks: -- Differential Cache-Collision Timing Attacks on AES with Applications to Embedded CPUs -- Cryptographic Protocols -- Usable Optimistic Fair Exchange -- Hash Function Combiners in TLS and SSL -- Improving Efficiency of an ‘On the Fly’ Identification Scheme by Perfecting Zero-Knowledgeness -- Cryptanalysis -- Linear Cryptanalysis of Reduced-Round PRESENT -- Dependent Linear Approximations: The Algorithm of Biryukov and Others Revisited -- Practical Key Recovery Attack against Secret-IV Edon- -- Rebound Attacks on the Reduced Grøstl Hash Function -- Symmetric Cryptography -- The Sum of CBC MACs Is a Secure PRF -- On Fast Verification of Hash Chains.
  note: edited by Josef Pieprzyk.
  subject:
    topic: Computer science
  subject:
    topic: Computer communication systems
  subject:
    topic: Computer security
  subject:
    topic: Data encryption (Computer science)
  subject:
    topic: Algorithms
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Data Encryption
  subject:
    topic: Discrete Mathematics in Computer Science
  subject:
    topic: Systems and Data Security
  subject:
    topic: Computer Communication Networks
  subject:
    topic: Algorithm Analysis and Problem Complexity
  classification: QA76.9.A25
  classification: 005.82
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 5985
  identifier: 9783642119255
  identifier: http://dx.doi.org/10.1007/978-3-642-11925-5
  record info:
    record creation date: 100306
    record change date: 20151204152930.0
    record identifier: 978-3-642-11925-5