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

255views Cryptology» more TCC 2009»

LEGO for Two-Party Secure Computation

14 years 12 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	255	LEGO for Two-Party Secure Computation	claim
2	184	Secure Arithmetic Computation with No Honest Majority	claim
3	177	Composability and On-Line Deniability of Authentication	claim
4	169	Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms	claim
5	167	Simultaneous Hardcore Bits and Cryptography against Memory Attacks	claim
6	160	Simple, Black-Box Constructions of Adaptively Secure Protocols	claim
7	158	On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols	claim
8	154	Fairness with an Honest Minority and a Rational Majority	claim
9	153	On the (Im)Possibility of Key Dependent Encryption	claim
10	151	Secret Sharing and Non-Shannon Information Inequalities	claim
11	146	An Optimally Fair Coin Toss	claim
12	142	Chosen-Ciphertext Security via Correlated Products	claim
13	141	Weak Verifiable Random Functions	claim
14	141	Proofs of Retrievability via Hardness Amplification	claim
15	133	Composing Quantum Protocols in a Classical Environment	claim
16	132	Authenticated Adversarial Routing	claim
17	131	Secure Computability of Functions in the IT Setting with Dishonest Majority and Applications to Long-Term Security	claim
18	131	Complete Fairness in Multi-party Computation without an Honest Majority	claim
19	130	How Efficient Can Memory Checking Be?	claim
20	130	Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer	claim
21	124	Universally Composable Multiparty Computation with Partially Isolated Parties	claim
22	123	Hierarchical Identity Based Encryption with Polynomially Many Levels	claim
23	122	Some Recent Progress in Lattice-Based Cryptography	claim
24	117	Towards a Theory of Extractable Functions	claim
25	116	Simulation-Based Concurrent Non-malleable Commitments and Decommitments	claim
26	114	Predicate Privacy in Encryption Systems	claim
27	112	Oblivious Transfer from Weak Noisy Channels	claim
28	112	Non-malleable Obfuscation	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers