IMPORTANT COVID-19 UPDATES

9783540785231

Theory of Cryptography

by
  • ISBN13:

    9783540785231

  • ISBN10:

    354078523X

  • Format: Paperback
  • Copyright: 2008-04-03
  • Publisher: Springer-Verlag New York Inc

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $139.99 Save up to $35.00
  • Buy Used
    $104.99
    Add to Cart Free Shipping

    USUALLY SHIPS IN 2-4 BUSINESS DAYS

Supplemental Materials

What is included with this book?

Summary

This book constitutes the refereed proceedings of the Fifth Theory of Cryptography Conference, TCC 2008, held in New York, USA, March 19-21, 2008. The 33 revised full papers presented were carefully reviewed and selected from 81 submissions. The papers are organized in 16 sessions dealing with the paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural cryptographic problems.

Table of Contents

Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiencyp. 1
On Seed-Incompressible Functionsp. 19
Asymptotically Efficient Lattice-Based Digital Signaturesp. 37
Basing Weak Public-Key Cryptography on Strong One-Way Functionsp. 55
Which Languages Have 4-Round Zero-Knowledge Proofs?p. 73
How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledgep. 89
General Properties of Quantum Zero-Knowledge Proofsp. 107
The Layered Games Framework for Specifications and Analysis of Security Protocolsp. 125
Universally Composable Multi-party Computation with an Unreliable Common Reference Stringp. 142
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversariesp. 155
Fast Private Norm Estimation and Heavy Hittersp. 176
Matroids Can Be Far from Ideal Secret Sharingp. 194
Perfectly-Secure MPC with Linear Communication Complexityp. 213
MPC vs. SFE: Perfect Security in a Unified Corruption Modelp. 231
Bridging Game Theory and Cryptography: Recent Results and Future Directionsp. 251
Verifiably Secure Devicesp. 273
Lower Bounds on Implementing Robust and Resilient Mediatorsp. 302
Cryptography and Game Theory: Designing Protocols for Exchanging Informationp. 320
Equivocal Blind Signatures and Adaptive UC-Securityp. 340
P-signatures and Noninteractive Anonymous Credentialsp. 356
Multi-property Preserving Combiners for Hash Functionsp. 375
OT-Combiners Via Secure Computationp. 393
Semi-honest to Malicious Oblivious Transfer - The Black-Box Wayp. 412
Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure Onep. 427
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrievalp. 445
Randomness Extraction Via [delta]-Biased Masking in the Presence of a Quantum Attackerp. 465
An Equivalence Between Zero Knowledge and Commitmentsp. 482
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Modelp. 501
The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterizationp. 535
On Constant-Round Concurrent Zero-Knowledgep. 553
Concurrent Non-malleable Commitments from Any One-Way Functionp. 571
Faster and Shorter Password-Authenticated Key Exchangep. 589
Saving Private Randomness in One-Way Functions and Pseudorandom Generatorsp. 607
Degradation and Amplification of Computational Hardnessp. 626
Author Indexp. 645
Table of Contents provided by Blackwell. All Rights Reserved.

Rewards Program

Write a Review