Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Theory of Cryptography

11th International Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014, Proceedings

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Yehuda Lindell

    1. Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 8349)

Part of the book sub series: Security and Cryptology (LNSC)

Included in the following conference series:

Conference proceedings info: TCC 2014.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Keywords

Table of contents (30 papers)

  1. Front Matter

    Pages I-XVI
    Download chapter PDF

  2. Obfuscation

    1. Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding

      • Zvika Brakerski, Guy N. Rothblum
      Pages 1-25

    2. Obfuscation for Evasive Functions

      • Boaz Barak, Nir Bitansky, Ran Canetti, Yael Tauman Kalai, Omer Paneth, Amit Sahai
      Pages 26-51

    3. On Extractability Obfuscation

      • Elette Boyle, Kai-Min Chung, Rafael Pass
      Pages 52-73

  3. Applications of Obfuscation

    1. Two-Round Secure MPC from Indistinguishability Obfuscation

      • Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova
      Pages 74-94

    2. Chosen Ciphertext Security via Point Obfuscation

      • Takahiro Matsuda, Goichiro Hanaoka
      Pages 95-120

  4. Zero Knowledge

    1. Probabilistically Checkable Proofs of Proximity with Zero-Knowledge

      • Yuval Ishai, Mor Weiss
      Pages 121-145

    2. Achieving Constant Round Leakage-Resilient Zero-Knowledge

      • Omkant Pandey
      Pages 146-166

    3. Statistical Concurrent Non-malleable Zero Knowledge

      • Claudio Orlandi, Rafail Ostrovsky, Vanishree Rao, Amit Sahai, Ivan Visconti
      Pages 167-191

    4. 4-Round Resettably-Sound Zero Knowledge

      • Kai-Min Chung, Rafail Ostrovsky, Rafael Pass, Muthuramakrishnan Venkitasubramaniam, Ivan Visconti
      Pages 192-216

  5. Black-Box Separations

    1. Can Optimally-Fair Coin Tossing Be Based on One-Way Functions?

      • Dana Dachman-Soled, Mohammad Mahmoody, Tal Malkin
      Pages 217-239

    2. On the Power of Public-Key Encryption in Secure Computation

      • Mohammad Mahmoody, Hemanta K. Maji, Manoj Prabhakaran
      Pages 240-264

    3. On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations

      • Takahiro Matsuda
      Pages 265-290

  6. Secure Computation

    1. Towards Characterizing Complete Fairness in Secure Two-Party Computation

      • Gilad Asharov
      Pages 291-316

    2. On the Cryptographic Complexity of the Worst Functions

      • Amos Beimel, Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz
      Pages 317-342

    3. Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol

      • Susumu Kiyoshima, Yoshifumi Manabe, Tatsuaki Okamoto
      Pages 343-367

    4. One-Sided Adaptively Secure Two-Party Computation

      • Carmit Hazay, Arpita Patra
      Pages 368-393

    5. Multi-linear Secret-Sharing Schemes

      • Amos Beimel, Aner Ben-Efraim, Carles Padró, Ilya Tyomkin
      Pages 394-418

    6. Broadcast Amplification

      • Martin Hirt, Ueli Maurer, Pavel Raykov
      Pages 419-439

  7. Coding and Cryptographic Applications

    1. Non-malleable Coding against Bit-Wise and Split-State Tampering

      • Mahdi Cheraghchi, Venkatesan Guruswami
      Pages 440-464
Back to top

Other volumes

  1. Theory of Cryptography

Editors and Affiliations

  • Department of Computer Science, Bar-Ilan University, Ramat Gan, Israel

    Yehuda Lindell

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation