TCC 2009 - PDF Preprint Papers

TCC 2009 Theory of Cryptography Conference

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TCC-2009 Paper

click to vote

TCC
2009
Springer

150views Cryptology» more TCC 2009»

LEGO for Two-Party Secure Computation

2 years 2 months ago

Download eprint.iacr.org

The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...

Jesper Buus Nielsen, Claudio Orlandi

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	150	LEGO for Two-Party Secure Computation	claim
2	67	Secret Sharing and Non-Shannon Information Inequalities	claim
3	65	On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols	claim
4	64	Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms	claim
5	53	Composability and On-Line Deniability of Authentication	claim
6	52	Chosen-Ciphertext Security via Correlated Products	claim
7	50	Fairness with an Honest Minority and a Rational Majority	claim
8	50	Proofs of Retrievability via Hardness Amplification	claim
9	49	Secure Arithmetic Computation with No Honest Majority	claim
10	49	Predicate Privacy in Encryption Systems	claim
11	48	Some Recent Progress in Lattice-Based Cryptography	claim
12	48	Complete Fairness in Multi-party Computation without an Honest Majority	claim
13	46	Towards a Theory of Extractable Functions	claim
14	44	Composing Quantum Protocols in a Classical Environment	claim
15	44	Non-malleable Obfuscation	claim
16	44	Weak Verifiable Random Functions	claim
17	43	How Efficient Can Memory Checking Be?	claim
18	43	An Optimally Fair Coin Toss	claim
19	43	Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer	claim
20	42	Simple, Black-Box Constructions of Adaptively Secure Protocols	claim
21	40	Simulation-Based Concurrent Non-malleable Commitments and Decommitments	claim
22	39	Oblivious Transfer from Weak Noisy Channels	claim
23	38	Authenticated Adversarial Routing	claim
24	37	Hierarchical Identity Based Encryption with Polynomially Many Levels	claim
25	36	Universally Composable Multiparty Computation with Partially Isolated Parties	claim
26	36	Simultaneous Hardcore Bits and Cryptography against Memory Attacks	claim
27	34	Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security	claim
28	33	On the (Im)Possibility of Key Dependent Encryption	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers