[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - (1 + eps)-Approximate Sparse Recovery

[IEEE 2011 IEEE 52nd Annual Symposium on

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - Approximating Graphic TSP by Matchings

✍ Moemke, Tobias; Svensson, Ola 📂 Article 📅 2011 🏛 IEEE ⚖ 777 KB

[IEEE 2011 IEEE 52nd Annual Symposium on

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - Medium Access Using Queues

✍ Shah, Devavrat; Shin, Jinwoo; Tetali, Prasad 📂 Article 📅 2011 🏛 IEEE ⚖ 618 KB

[IEEE 2011 IEEE 52nd Annual Symposium on

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - How to Garble Arithmetic Circuits

✍ Applebaum, Benny; Ishai, Yuval; Kushilevitz, Eyal 📂 Article 📅 2011 🏛 IEEE ⚖ 673 KB

[IEEE 2011 IEEE 52nd Annual Symposium on

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - Efficient Fully Homomorphic Encryption from (Standard) LWE

✍ Brakerski, Zvika; Vaikuntanathan, Vinod 📂 Article 📅 2011 🏛 IEEE ⚖ 544 KB

[IEEE 2011 IEEE 52nd Annual Symposium on

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - Efficient Fully Homomorphic Encryption from (Standard) LWE

✍ Brakerski, Zvika; Vaikuntanathan, Vinod 📂 Article 📅 2011 🏛 IEEE ⚖ 544 KB

We present a fully homomorphic encryption scheme that is based solely on the (standard) learning with errors (LWE) assumption. Applying known results on LWE, the security of our scheme is based on the worst-case hardness of "short vector problems" on arbitrary lattices. Our construction improves on

[IEEE 2011 IEEE 52nd Annual Symposium on

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - Mechanism Design with Set-Theoretic Beliefs

✍ Chen, Jing; Micali, Silvio 📂 Article 📅 2011 🏛 IEEE ⚖ 696 KB