Theory of Cryptography : Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings / edited by Shai Halevi, Tal Rabin.

Format:

Book

Contributor:

Halevi, Shai, editor.

Rabin, Tal, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

LNCS sublibrary. Security and cryptology ; SL 4, 3876.

Security and Cryptology ; 3876

Language:

English

Subjects (All):

Data encryption (Computer science).

Algorithms.

Computer science--Mathematics.

Computer science.

Operating systems (Computers).

Management information systems.

Computers and civilization.

Cryptology.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Operating Systems.

Management of Computing and Information Systems.

Computers and Society.

Local Subjects:

Cryptology.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Operating Systems.

Management of Computing and Information Systems.

Computers and Society.

Physical Description:

1 online resource (XII, 620 pages).

Edition:

First edition 2006.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.

System Details:

text file PDF

Contents:

Zero-Knowledge

Concurrent Zero Knowledge Without Complexity Assumptions

Interactive Zero-Knowledge with Restricted Random Oracles

Non-interactive Zero-Knowledge from Homomorphic Encryption

Primitives

Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles

Efficient Blind and Partially Blind Signatures Without Random Oracles

Key Exchange Using Passwords and Long Keys

Mercurial Commitments: Minimal Assumptions and Efficient Constructions

Assumptions and Models

Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices

On Error Correction in the Exponent

On the Relation Between the Ideal Cipher and the Random Oracle Models

The Bounded-Retrieval Model

Intrusion-Resilience Via the Bounded-Storage Model

Perfectly Secure Password Protocols in the Bounded Retrieval Model

Privacy

Polylogarithmic Private Approximations and Efficient Matching

Calibrating Noise to Sensitivity in Private Data Analysis

Secret Sharing and Multi-party Computation (I)

Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation

Efficient Multi-party Computation with Dispute Control

Round-Optimal and Efficient Verifiable Secret Sharing

Universally-Composible Security

Generalized Environmental Security from Number Theoretic Assumptions

Games and the Impossibility of Realizable Ideal Functionality

Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols

Resource Fairness and Composability of Cryptographic Protocols

One-Way Functions and Friends

Finding Pessiland

Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness

On the Complexity of Parallel Hardness Amplification for One-Way Functions

Secret Sharing and Multi-party Computation (II)

On Matroids and Non-ideal Secret Sharing

Secure Computation with Partial Message Loss

Communication Efficient Secure Linear Algebra

Threshold and Proactive Pseudo-Random Permutations

Pseudo-Random Functions and Encryption

PRF Domain Extension Using DAGs

Chosen-Ciphertext Security from Tag-Based Encryption

Separating Sources for Encryption and Secret Sharing.

Other Format:

Printed edition:

ISBN:

978-3-540-32732-5

9783540327325

Access Restriction:

Restricted for use by site license.