International Association for Cryptologic Research

Publications by Conference

Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings

Preface and frontmatter

Page	Title
1-18	An Optimally Fair Coin Toss
19-35	Complete Fairness in Multi-party Computation without an Honest Majority
36-53	Fairness with an Honest Minority and a Rational Majority
54-71	Purely Rational Secret Sharing (Extended Abstract)
72	Some Recent Progress in Lattice-Based Cryptography
73-90	Non-malleable Obfuscation
91-108	Simulation-Based Concurrent Non-malleable Commitments and Decommitments
109-127	Proofs of Retrievability via Hardness Amplification
128-145	Security Amplification for InteractiveCryptographic Primitives
146-162	Composability and On-Line Deniability of Authentication
163-182	Authenticated Adversarial Routing
183-201	Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer
202-219	On the (Im)Possibility of Key Dependent Encryption
220-237	On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
238-255	Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security
256-273	Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
274-293	Realistic Failures in Secure Multi-party Computation
294-314	Secure Arithmetic Computation with No Honest Majority
315-331	Universally Composable Multiparty Computation with Partially Isolated Parties
332-349	Oblivious Transfer from Weak Noisy Channels
350-367	Composing Quantum Protocols in a Classical Environment
368-386	LEGO for Two-Party Secure Computation
387-402	Simple, Black-Box Constructions of Adaptively Secure Protocols
403-418	Black-Box Constructions of Two-Party Protocols from One-Way Functions
419-436	Chosen-Ciphertext Security via Correlated Products
437-456	Hierarchical Identity Based Encryption with Polynomially Many Levels
457-473	Predicate Privacy in Encryption Systems
474-495	Simultaneous Hardcore Bits and Cryptography against Memory Attacks
496-502	The Differential Privacy Frontier (Extended Abstract)
503-520	How Efficient Can Memory Checking Be?
521-538	Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
539-557	Secret Sharing and Non-Shannon Information Inequalities
558-576	Weak Verifiable Random Functions
577-594	Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
595-613	Towards a Theory of Extractable Functions