Theory of Cryptography

14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I

  • Hirt Martin 
  • Smith Adam 
Conference proceedings TCC 2016

DOI: 10.1007/978-3-662-53641-4

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

Table of contents (25 papers)

  1. Front Matter
    Pages I-XVI
  2. TCC Test-of-Time Award

    1. Front Matter
      Pages 1-1
  3. Foundations

    1. Front Matter
      Pages 25-25
    2. Fast Pseudorandom Functions Based on Expander Graphs
      Benny Applebaum, Pavel Raykov
      Pages 27-56
    3. 3-Message Zero Knowledge Against Human Ignorance
      Nir Bitansky, Zvika Brakerski, Yael Kalai, Omer Paneth, Vinod Vaikuntanathan
      Pages 57-83
    4. On the (In)Security of SNARKs in the Presence of Oracles
      Dario Fiore, Anca Nitulescu
      Pages 108-138
    5. Simulating Auxiliary Inputs, Revisited
      Maciej Skórski
      Pages 159-179
  4. Unconditional Security

    1. Front Matter
      Pages 181-181
    2. Pseudoentropy: Lower-Bounds for Chain Rules and Transformations
      Krzysztof Pietrzak, Maciej Skórski
      Pages 183-203
    3. Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement
      Ignacio Cascudo, Ivan Damgård, Felipe Lacerda, Samuel Ranellucci
      Pages 204-234
    4. Simultaneous Secrecy and Reliability Amplification for a General Channel Model
      Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Bruce M. Kapron, Valerie King, Stefano Tessaro
      Pages 235-261
    5. Proof of Space from Stacked Expanders
      Ling Ren, Srinivas Devadas
      Pages 262-285
    6. Perfectly Secure Message Transmission in Two Rounds
      Gabriele Spini, Gilles Zémor
      Pages 286-304
  5. Foundations of Multi-Party Protocols

    1. Front Matter
      Pages 305-305
    2. Binary AMD Circuits from Secure Multiparty Computation
      Daniel Genkin, Yuval Ishai, Mor Weiss
      Pages 336-366
    3. Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
      Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
      Pages 367-399

Other volumes

  1. Theory of Cryptography
    14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I
  2. Theory of Cryptography
    14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part II

About these proceedings

Introduction

The two-volume set LNCS 9985 and LNCS 9986 constitutes the refereed proceedings of the 14th International Conference on Theory of Cryptography, TCC 2016-B, held in Beijing, China, in November 2016.

The total of 45 revised full papers presented in the proceedings were carefully reviewed and selected from 113 submissions. The papers were organized in topical sections named: TCC test-of-time award; foundations; unconditional security; foundations of multi-party protocols; round complexity and efficiency of multi-party computation; differential privacy; delegation and IP; public-key encryption; obfuscation and multilinear maps; attribute-based encryption; functional encryption; secret sharing; new models.


Keywords

adaptive secure computation cloud computing cryptocurrency oblivious transfer verifiable delegation of computation algebraic manipulation detection bitcoin coin-tossing humancoin leakage-resilient cryptography lossy encryption minimal assumptions proof of human work public-key encryption quantum secure computation secure data outsourcing secure multiparty computation security definitions stream ciphers

Editors and affiliations

  • Hirt Martin 
    • 1
  • Smith Adam 
    • 2
  1. 1.Department of Computer ScienceETH ZurichZurichSwitzerland
  2. 2.Pennsylvania State UniversityUniversity ParkUSA

Bibliographic information

  • Copyright Information International Association for Cryptologic Research 2016
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-662-53640-7
  • Online ISBN 978-3-662-53641-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349