Theory of Cryptography: Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008, Proceedings / Edition 1

Theory of Cryptography: Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008, Proceedings / Edition 1

by Ran Canetti
     
 

ISBN-10: 354078523X

ISBN-13: 9783540785231

Pub. Date: 04/03/2008

Publisher: Springer Berlin Heidelberg

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

Overview

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.

Product Details

ISBN-13:
9783540785231
Publisher:
Springer Berlin Heidelberg
Publication date:
04/03/2008
Series:
Lecture Notes in Computer Science / Security and Cryptology Series , #4948
Edition description:
2008
Pages:
645
Product dimensions:
6.10(w) x 9.30(h) x 0.90(d)

Table of Contents

Technical Session 1.- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency.- On Seed-Incompressible Functions.- Technical Session 2.- Asymptotically Efficient Lattice-Based Digital Signatures.- Basing Weak Public-Key Cryptography on Strong One-Way Functions.- Technical Session 3.- Which Languages Have 4-Round Zero-Knowledge Proofs?.- How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge.- General Properties of Quantum Zero-Knowledge Proofs.- Technical Session 4.- The Layered Games Framework for Specifications and Analysis of Security Prools.- Universally Composable Multi-party Computation with an Unreliable Common Reference String.- Efficient Prools for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries.- Fast Private Norm Estimation and Heavy Hitters.- Technical Session 5.- Matroids Can Be Far from Ideal Secret Sharing.- Perfectly-Secure MPC with Linear Communication Complexity.- MPC vs. SFE: Perfect Security in a Unified Corruption Model.- Invited Talk.- Bridging Game Theory and Cryptography: Recent Results and Future Directions.- Technical Session 6.- Verifiably Secure Devices.- Lower Bounds on Implementing Robust and Resilient Mediators.- Cryptography and Game Theory: Designing Prools for Exchanging Information.- Technical Session 7.- Equivocal Blind Signatures and Adaptive UC-Security.- P-signatures and Noninteractive Anonymous Credentials.- Technical Session 8.- Multi-property Preserving Combiners for Hash Functions.- OT-Combiners via Secure Computation.- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way.- Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One.- Technical Session 9.- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.- Randomness Extraction Via—-Biased Masking in the Presence of a QuantumAttacker.- Technical Session 10.- An Equivalence Between Zero Knowledge and Commitments.- Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model.- Technical Session 11.- The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization.- On Constant-Round Concurrent Zero-Knowledge.- Technical Session 12.- Concurrent Non-malleable Commitments from Any One-Way Function.- Faster and Shorter Password-Authenticated Key Exchange.- Technical Session 13.- Saving Private Randomness in One-Way Functions and Pseudorandom Generators.- Degradation and Amplification of Computational Hardness.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >