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: Theory of Cryptography
    sub title: 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings
  name:
    name part: Lindell, Yehuda.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2014
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XVI, 739 p. 59 illus. online resource.
  abstract: This book constitutes the refereed proceedings of the 11th Theory of Cryptography Conference, TCC 2014, held in San Diego, CA, USA, in February 2014. The 30 revised full papers presented were carefully reviewed and selected from 90 submissions. The papers are organized in topical sections on obfuscation, applications of obfuscation, zero knowledge, black-box separations, secure computation, coding and cryptographic applications, leakage, encryption, hardware-aided secure protocols, and encryption and signatures.
  table of contents: Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding -- Obfuscation for Evasive Functions -- On Extractability Obfuscation -- Two-Round Secure MPC from Indistinguishability Obfuscation -- Chosen Ciphertext Security via Point Obfuscation -- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge -- Achieving Constant Round Leakage-Resilient Zero-Knowledge -- Statistical Concurrent Non-malleable Zero Knowledge -- 4-Round Resettably-Sound Zero Knowledge -- Can Optimally-Fair Coin Tossing Be Based on One-Way Functions? -- On the Power of Public-Key Encryption in Secure Computation -- On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations -- Towards Characterizing Complete Fairness in Secure Two-Party Computation -- On the Cryptographic Complexity of the Worst Functions -- Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol -- One-Sided Adaptively Secure Two-Party Computation -- Multi-linear Secret-Sharing -- Broadcast Amplification -- Non-malleable Coding against Bit-Wise and Split-State Tampering -- Continuous Non-malleable Codes -- Locally Updatable and Locally Decodable Codes -- Leakage Resilient Fully Homomorphic Encryption -- Securing Circuits and Protocols against 1/ poly(k) Tampering Rate -- How to Fake Auxiliary Input -- Standard versus Selective Opening Security: Separation and Equivalence Results -- Dual System Encryption via Predicate Encodings -- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens -- Lower Bounds in the Hardware Token Model -- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures -- On the Impossibility of Structure-Preserving Deterministic Primitives.
  note: edited by Yehuda Lindell.
  subject:
    topic: Computer science
  subject:
    topic: Computer security
  subject:
    topic: Data encryption (Computer science)
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Computer science
    topic: Mathematics
  subject:
    topic: Computer Science
  subject:
    topic: Data Encryption
  subject:
    topic: Systems and Data Security
  subject:
    topic: Computation by Abstract Devices
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Discrete Mathematics in Computer Science
  classification: QA76.9.A25
  classification: 005.82
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 8349
  identifier: 9783642542428
  identifier: http://dx.doi.org/10.1007/978-3-642-54242-8
  record info:
    record creation date: 140203
    record change date: 20151204164728.0
    record identifier: 978-3-642-54242-8