Theory of Cryptography : Sixth Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009, Proceedings / edited by Omer Reingold.

Format:

Book

Contributor:

Reingold, Omer, editor.

SpringerLink (Online service)

Series:

Computer Science (Springer-11645)

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

Security and Cryptology ; 5444

Language:

English

Subjects (All):

Data encryption (Computer science).

Algorithms.

Computer science--Mathematics.

Computer science.

Computer security.

Management information systems.

Computers and civilization.

Cryptology.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Systems and Data Security.

Management of Computing and Information Systems.

Computers and Society.

Local Subjects:

Cryptology.

Algorithm Analysis and Problem Complexity.

Discrete Mathematics in Computer Science.

Systems and Data Security.

Management of Computing and Information Systems.

Computers and Society.

Physical Description:

1 online resource (XI, 615 pages).

Edition:

First edition 2009.

Contained In:

Springer eBooks

Place of Publication:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.

System Details:

text file PDF

Summary:

This book constitutes the refereed proceedings of the Sixth Theory of Cryptography Conference, TCC 2009, held in San Francisco, CA, USA, March 15-17, 2009. The 33 revised full papers presented together with two invited talks were carefully reviewed and selected from 109 submissions. The papers are organized in 10 sessions dealing with the paradigms, approaches and techniques used to conceptualize, define and provide solutions to natural cryptographic problems.

Contents:

An Optimally Fair Coin Toss

Complete Fairness in Multi-party Computation without an Honest Majority

Fairness with an Honest Minority and a Rational Majority

Purely Rational Secret Sharing (Extended Abstract)

Some Recent Progress in Lattice-Based Cryptography

Non-malleable Obfuscation

Simulation-Based Concurrent Non-malleable Commitments and Decommitments

Proofs of Retrievability via Hardness Amplification

Security Amplification for Interactive Cryptographic Primitives

Composability and On-Line Deniability of Authentication

Authenticated Adversarial Routing

Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer

On the (Im)Possibility of Key Dependent Encryption

On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols

Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security

Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation

Realistic Failures in Secure Multi-party Computation

Secure Arithmetic Computation with No Honest Majority

Universally Composable Multiparty Computation with Partially Isolated Parties

Oblivious Transfer from Weak Noisy Channels

Composing Quantum Protocols in a Classical Environment

LEGO for Two-Party Secure Computation

Simple, Black-Box Constructions of Adaptively Secure Protocols

Black-Box Constructions of Two-Party Protocols from One-Way Functions

Chosen-Ciphertext Security via Correlated Products

Hierarchical Identity Based Encryption with Polynomially Many Levels

Predicate Privacy in Encryption Systems

Simultaneous Hardcore Bits and Cryptography against Memory Attacks

The Differential Privacy Frontier (Extended Abstract)

How Efficient Can Memory Checking Be?

Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms

Secret Sharing and Non-Shannon Information Inequalities

Weak Verifiable Random Functions

Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection

Towards a Theory of Extractable Functions.

Other Format:

Printed edition:

ISBN:

978-3-642-00457-5

9783642004575

Access Restriction:

Restricted for use by site license.