Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings

Overview

This book constitutes the refereed proceedings of the Third Theory of Cryptography Conference, TCC 2006, held in New York, NY, USA in March 2006.

The 31 revised full papers presented were carefully reviewed and selected from 91 submissions. The papers are organized in topical sections on zero-knowledge, primitives, assumptions and models, the bounded-retrieval model, privacy, secret sharing and multi-party ...

See more details below
Paperback
$128.93
BN.com price
(Save 18%)$159.00 List Price
Other sellers (Paperback)
  • All (8) from $49.95   
  • New (4) from $128.92   
  • Used (4) from $49.95   
Sending request ...

Overview

This book constitutes the refereed proceedings of the Third Theory of Cryptography Conference, TCC 2006, held in New York, NY, USA in March 2006.

The 31 revised full papers presented were carefully reviewed and selected from 91 submissions. The papers are organized in topical sections on zero-knowledge, primitives, assumptions and models, the bounded-retrieval model, privacy, secret sharing and multi-party computation, universally-composible security, one-way functions and friends, and pseudo-random functions and encryption.

Read More Show Less

Product Details

  • ISBN-13: 9783540327318
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 6/16/2009
  • Series: Lecture Notes in Computer Science Ser.
  • Edition number: 1
  • Pages: 634
  • Product dimensions: 9.21 (w) x 6.14 (h) x 1.33 (d)

Table of Contents

Concurrent zero knowledge without complexity assumptions 1
Interactive zero-knowledge with restricted random oracles 21
Non-interactive zero-knowledge from homomorphic encryption 41
Ring signatures : stronger definitions, and constructions without random oracles 60
Efficient blind and partially blind signatures without random oracles 80
Key exchange using passwords and long keys 100
Mercurial commitments : minimal assumptions and efficient constructions 120
Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices 145
On error correction in the exponent 167
On the relation between the ideal cipher and the random oracle models 184
Intrusion-resilience via the bounded-storage model 207
Perfectly secure password protocols in the bounded retrieval model 225
Polylogarithmic private approximations and efficient matching 245
Calibrating noise to sensitivity in private data analysis 265
Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation 285
Efficient multi-party computation with dispute control 305
Round-optimal and efficient verifiable secret sharing 329
Generalized environmental security from number theoretic assumptions 343
Games and the impossibility of realizable ideal functionality 360
Universally composable symbolic analysis of mutual authentication and key-exchange protocols 380
Resource fairness and composability of cryptographic protocols 404
Finding pessiland 429
Pseudorandom generators from one-way functions : a simple construction for any hardness 443
On the complexity of parallel hardness amplification for one-way functions 462
On matroids and non-ideal secret sharing 482
Secure computation with partial message loss 502
Communication efficient secure linear algebra 522
Threshold and proactive pseudo-random permutations 542
PRF domain extension using DAGs 561
Chosen-ciphertext security from tag-based encryption 581
Separating sources for encryption and secret sharing 601
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)