FOCS 2003 - PDF Preprint Papers

FOCS 2003 Annual IEEE Symposium on Foundations of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FOCS-2003 Paper

click to vote

FOCS
2003
IEEE

155views Theoretical Computer Science» more FOCS 2003»

General Composition and Universal Composability in Secure Multi-Party Computation

13 years 10 months ago

Download reference.kfupm.edu.sa

Concurrent general composition relates to a setting where a secure protocol is run in a network concurrently with other, arbitrary protocols. Clearly, security in such a setting i...

Yehuda Lindell

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	155	General Composition and Universal Composability in Secure Multi-Party Computation	claim
2	149	Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs	claim
3	145	Always Good Turing: Asymptotically Optimal Probability Estimation	claim
4	142	Towards a Characterization of Truthful Combinatorial Auctions	claim
5	141	On Certain Connectivity Properties of the Internet Topology	claim
6	140	The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side	claim
7	135	Bounded Geometries, Fractals, and Low-Distortion Embeddings	claim
8	128	Gossip-Based Computation of Aggregate Information	claim
9	128	List-Decoding Using The XOR Lemma	claim
10	127	Clustering with Qualitative Information	claim
11	126	Proving Hard-Core Predicates Using List Decoding	claim
12	126	Polynomial Degree vs. Quantum Query Complexity	claim
13	126	Paths, Trees, and Minimum Latency Tours	claim
14	122	A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness	claim
15	117	The Cost of Cache-Oblivious Searching	claim
16	114	Breaking a Time-and-Space Barrier in Constructing Full-Text Indices	claim
17	110	Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds	claim
18	109	Mixing	claim
19	108	On the (In)security of the Fiat-Shamir Paradigm	claim
20	107	A Lattice Problem in Quantum NP	claim
21	107	Approximation Algorithms for Orienteering and Discounted-Reward TSP	claim
22	106	Switch Scheduling via Randomized Edge Coloring	claim
23	103	Quantum Search of Spatial Regions	claim
24	102	A Non-Markovian Coupling for Randomly Sampling Colorings	claim
25	100	Lower Bounds for Non-Black-Box Zero Knowledge	claim
26	99	Group Strategyproof Mechanisms via Primal-Dual Algorithms	claim
27	98	Zero-Knowledge Sets	claim
28	97	On the Implementation of Huge Random Objects	claim
29	96	Algorithms and Complexity Results for #SAT and Bayesian Inference	claim
30	95	Tight Lower Bounds for the Distinct Elements Problem	claim
31	93	Learning DNF from Random Walks	claim
32	92	Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model	claim
33	90	The Ising Model on Trees: Boundary Conditions and Mixing Time	claim
34	88	Separating the Power of Monotone Span Programs over Different Fields	claim
35	85	On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences	claim
36	80	Locally Testable Cyclic Codes	claim
37	78	On Worst-Case to Average-Case Reductions for NP Problems	claim
38	64	Stability and Efficiency of a Random Local Load Balancing Protocol	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers