STOC 2005 - PDF Preprint Papers

STOC 2005 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-2005 Paper

click to vote

STOC
2005
ACM

198views Algorithms» more STOC 2005»

On lattices, learning with errors, random linear codes, and cryptography

14 years 11 months ago

Download www.cs.tau.ac.il

Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...

Oded Regev

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	198	On lattices, learning with errors, random linear codes, and cryptography	claim
2	186	Computing correlated equilibria in multi-player games	claim
3	184	Coresets in dynamic geometric data streams	claim
4	174	On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem	claim
5	167	Approximately counting integral flows and cell-bounded contingency tables	claim
6	164	Cooperative asynchronous update of shared memory	claim
7	163	Undirected ST-connectivity in log-space	claim
8	158	Polynomial time quantum algorithm for the computation of the unit group of a number field	claim
9	156	Convex programming for scheduling unrelated parallel machines	claim
10	151	On algorithms for discrete and approximate brouwer fixed points	claim
11	150	Correcting errors without leaking partial information	claim
12	147	Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors	claim
13	146	Approximation algorithms for combinatorial auctions with complement-free bidders	claim
14	145	On uniform amplification of hardness in NP	claim
15	144	Pseudorandom generators for low degree polynomials	claim
16	143	Optimal approximations of the frequency moments of data streams	claim
17	143	On strip packing With rotations	claim
18	142	Market equilibrium via the excess demand function	claim
19	139	Spectral norm of random matrices	claim
20	138	Fast quantum algorithms for computing the unit group and class group of a number field	claim
21	138	A new strategy for querying priced information	claim
22	135	On the bias of traceroute sampling: or, power-law degree distributions in regular graphs	claim
23	135	Quadratic forms on graphs	claim
24	135	Hardness of the undirected congestion minimization problem	claim
25	133	An O(log n log log n) space algorithm for undirected st-connectivity	claim
26	132	Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits	claim
27	132	Concurrent general composition of secure protocols in the timing model	claim
28	130	Low-distortion embeddings of general metrics into the line	claim
29	130	From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement	claim
30	129	Learning with attribute costs	claim
31	127	Aggregating inconsistent information: ranking and clustering	claim
32	122	The price of anarchy of finite congestion games	claim
33	120	Limits to list decoding Reed-Solomon codes	claim
34	118	Euclidean distortion and the sparsest cut	claim
35	115	Computing the first Betti number and the connected components of semi-algebraic sets	claim
36	115	Approximation techniques for utilitarian mechanism design	claim
37	115	Lower-stretch spanning trees	claim
38	113	Efficient testing of groups	claim
39	112	The complexity of agreement	claim
40	112	Covert two-party computation	claim
41	111	Tensor decomposition and approximation schemes for constraint satisfaction problems	claim
42	110	Derandomization of auctions	claim
43	110	Key agreement from weak bit agreement	claim
44	107	On obfuscating point functions	claim
45	105	Every 2-CSP allows nontrivial approximation	claim
46	104	Beyond NP: the work and legacy of Larry Stockmeyer	claim
47	104	Oblivious routing in directed graphs with random demands	claim
48	103	New and improved constructions of non-malleable cryptographic protocols	claim
49	101	Lower bounds for k-DNF resolution on random 3-CNFs	claim
50	101	The round complexity of two-party random selection	claim
51	99	Collusion-free protocols	claim
52	97	Fast quantum byzantine agreement	claim
53	96	Every monotone graph property is testable	claim
54	94	On dynamic range reporting in one dimension	claim
55	93	Representing hard lattices with O(n log n) bits	claim
56	89	Universal approximations for TSP, Steiner tree, and set cover	claim
57	86	Low distortion embeddings for edit distance	claim
58	85	Tree-walking automata do not recognize all regular languages	claim
59	84	Learning nonsingular phylogenies and hidden Markov models	claim
60	81	Improved approximation algorithms for minimum-weight vertex separators	claim
61	76	Hierarchies for semantic classes	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers