Panagiotis Voulgaris

A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations

We give deterministic

A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations

\tilde{O}(2^{2n})

Faster exponential time algorithms for the shortest vector problem

-time

Functional encryption for threshold functions (or fuzzy IBE) from lattices

\tilde{O}(2^n)

Finding red balloons with split contracts: robustness to individuals' selfishness

-space algorithms to solve all the most important computational problems on point lattices in NP, including the shortest vector problem (SVP), closest vector problem (CVP), and shortest independent vectors problem (SIVP). This improves the

Fuzzy Identity Based Encryption from Lattices.

n^{O(n)}

Attribute based encryption using lattices

running time of the best previously known algorithms for CVP [R. Kannan, Math. Oper. Res., 12 (1987), pp. 415--440] and SIVP [D. Micciancio, Proceedings of the

Faster exponential time algorithms for the shortest vector problem.

19

The Effects of Diversity in Aggregation Games.

th Annual ACM-SIAM Symposium on Discrete Algorithms, 2008, pp. 84--93] and gives a deterministic and asymptotically faster alternative to the

NON-INTERACTIVE VERIFIABLE, DELEGATED COMPUTATION

2^{O(n)}