ECCC 2007 - PDF Preprint Papers

ECCC 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ECCC-2007 Paper

click to vote

ECCC
2007

185views more ECCC 2007»

Trapdoors for Hard Lattices and New Cryptographic Constructions

14 years 11 days ago

Download people.csail.mit.edu

We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...

Craig Gentry, Chris Peikert, Vinod Vaikuntanathan

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	185	Trapdoors for Hard Lattices and New Cryptographic Constructions	claim
2	180	Adaptive Algorithms for Online Decision Problems	claim
3	147	Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs	claim
4	144	Algebraic Lower Bounds for Computing on Encrypted Data	claim
5	127	Universal Semantic Communication I	claim
6	127	Public Key Encryption Which is Simultaneously a Locally-Decodable Error-Correcting Code	claim
7	124	Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs	claim
8	123	Lossy Trapdoor Functions and Their Applications	claim
9	122	Infeasibility of Instance Compression and Succinct PCPs for NP	claim
10	115	A (De)constructive Approach to Program Checking	claim
11	115	An Exposition of Bourgain's 2-Source Extractor	claim
12	109	Logic, Graphs, and Algorithms	claim
13	100	Unconditional pseudorandom generators for low degree polynomials	claim
14	99	On the Average-Case Complexity of Property Testing	claim
15	99	An Exponential Time/Space Speedup For Resolution	claim
16	96	Linear programming bounds for codes via a covering argument	claim
17	91	Testing Expansion in Bounded Degree Graphs	claim
18	91	Which Languages Have 4-Round Zero-Knowledge Proofs?	claim
19	90	Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution	claim
20	89	Lower Bounds for Kernelizations	claim
21	89	The black-box query complexity of polynomial summation	claim
22	88	Combinatorial Construction of Locally Testable Codes	claim
23	86	Interactive PCP	claim
24	86	Testing Halfspaces	claim
25	86	On Parameterized Approximability	claim
26	82	Extending Polynomial Calculus to $k$-DNF Resolution	claim
27	79	Testing the Expansion of a Graph	claim
28	77	Selected Results in Additive Combinatorics: An Exposition	claim
29	71	Inverse Conjecture for the Gowers norm is false	claim
30	69	Testing Symmetric Properties of Distributions	claim
31	67	An infinitely-often one-way function based on an average-case assumption	claim
32	65	Sound 3-query PCPPs are Long	claim
33	64	Sub-Constant Error Probabilistically Checkable Proof of Almost Linear Size	claim
34	62	Space Hierarchy Results for Randomized and Other Semantic Models	claim
35	61	The Pattern Matrix Method for Lower Bounds on Quantum Communication	claim
36	59	Improved approximation algorithms for directed Steiner forest	claim
37	57	Equilibria of Graphical Games with Symmetries	claim
38	51	The Myth of the Folk Theorem	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers