Book Volume 9985 2016

Theory of Cryptography

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

Editors:

ISBN: 978-3-662-53640-7 (Print) 978-3-662-53641-4 (Online)

Table of contents (25 chapters)

previous Page of 2
  1. Front Matter

    Pages I-XVI

  2. TCC Test-of-Time Award

    1. Front Matter

      Pages 1-1

    2. No Access

      Chapter

      Pages 3-24

      From Indifferentiability to Constructive Cryptography (and Back)

  3. Foundations

    1. Front Matter

      Pages 25-25

    2. No Access

      Chapter

      Pages 27-56

      Fast Pseudorandom Functions Based on Expander Graphs

    3. No Access

      Chapter

      Pages 57-83

      3-Message Zero Knowledge Against Human Ignorance

    4. No Access

      Chapter

      Pages 84-107

      The GGM Function Family Is a Weakly One-Way Family of Functions

    5. No Access

      Chapter

      Pages 108-138

      On the (In)Security of SNARKs in the Presence of Oracles

    6. No Access

      Chapter

      Pages 139-158

      Leakage Resilient One-Way Functions: The Auxiliary-Input Setting

    7. No Access

      Chapter

      Pages 159-179

      Simulating Auxiliary Inputs, Revisited

  4. Unconditional Security

    1. Front Matter

      Pages 181-181

    2. No Access

      Chapter

      Pages 183-203

      Pseudoentropy: Lower-Bounds for Chain Rules and Transformations

    3. No Access

      Chapter

      Pages 204-234

      Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement

    4. No Access

      Chapter

      Pages 235-261

      Simultaneous Secrecy and Reliability Amplification for a General Channel Model

    5. No Access

      Chapter

      Pages 262-285

      Proof of Space from Stacked Expanders

    6. No Access

      Chapter

      Pages 286-304

      Perfectly Secure Message Transmission in Two Rounds

  5. Foundations of Multi-Party Protocols

    1. Front Matter

      Pages 305-305

    2. No Access

      Chapter

      Pages 307-335

      Almost-Optimally Fair Multiparty Coin-Tossing with Nearly Three-Quarters Malicious

    3. No Access

      Chapter

      Pages 336-366

      Binary AMD Circuits from Secure Multiparty Computation

    4. No Access

      Chapter

      Pages 367-399

      Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity

    5. No Access

      Chapter

      Pages 400-432

      Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions

    6. No Access

      Chapter

      Pages 433-458

      Adaptive Security of Yao’s Garbled Circuits

  6. Round Complexity and Efficiency of Multi-party Computation

    1. Front Matter

      Pages 459-459

    2. No Access

      Chapter

      Pages 461-490

      Efficient Secure Multiparty Computation with Identifiable Abort

    3. No Access

      Chapter

      Pages 491-520

      Secure Multiparty RAM Computation in Constant Rounds

    4. No Access

      Chapter

      Pages 521-553

      Constant-Round Maliciously Secure Two-Party Computation in the RAM Model

previous Page of 2