2011 IEEE 52nd Annual Symposium on Foundations of Computer Science

22-25 Oct. 2011

Filter Results

Displaying Results 1 - 25 of 100
  • [Front cover]

    Publication Year: 2011, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (1415 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2011, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (62 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2011, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (106 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2011, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (109 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2011, Page(s):v - xi
    Request permission for commercial reuse | PDF file iconPDF (142 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 2011, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (99 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2011, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (93 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2011, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (98 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2011, Page(s):xv - xvi
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • Awards

    Publication Year: 2011, Page(s): xvii
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • The Promise of Differential Privacy: A Tutorial on Algorithmic Techniques

    Publication Year: 2011, Page(s):1 - 2
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (311 KB) | HTML iconHTML

    Differential privacy describes a promise, made by a data curator to a data subject: you will not be affected, adversely or otherwise, by allowing your data to be used in any study, no matter what other studies, data sets, or information from other sources is available. At their best, differentially private database mechanisms can make confidential data widely available for accurate data analysis, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Green Computing Algorithmics

    Publication Year: 2011, Page(s):3 - 4
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (343 KB) | HTML iconHTML

    The converging trends of society's desire/need for more sustainable technologies, exponentially increasing power densities within computing devices, and exponentially more computing devices, have inevitably pushed power and energy management into the forefront of computing design and management for purely economic reasons. Thus we are in the midst of a green computing revolution involving the rede... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing Blindfolded: New Developments in Fully Homomorphic Encryption

    Publication Year: 2011, Page(s):5 - 16
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (503 KB) | HTML iconHTML

    A fully homomorphic encryption scheme enables computation of arbitrary functions on encrypted data. Fully homomorphic encryption has long been regarded as cryptography's prized "holy grail" - extremely useful yet rather elusive. Starting with the groundbreaking work of Gentry in 2009, the last three years have witnessed numerous constructions of fully homomorphic encryption involving novel mathema... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Min-max Graph Partitioning and Small Set Expansion

    Publication Year: 2011, Page(s):17 - 26
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (491 KB) | HTML iconHTML

    We study graph partitioning problems from a min-max perspective, in which an input graph on n vertices should be partitioned into k parts, and the objective is to minimize the maximum number of edges leaving a single part. The two main versions we consider are: (i) the k parts need to be of equal size, and (ii) the parts must separate a set of k given terminals. We consider a common generalization... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Graph Minor Algorithm with Parity Conditions

    Publication Year: 2011, Page(s):27 - 36
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (405 KB) | HTML iconHTML

    We generalize the seminal Graph Minor algorithm of Robertson and Seymour to the parity version. We give polynomial time algorithms for the following problems: 1) the parity H-minor (Odd Kk -minor) containment problem, and 2) the disjoint paths problem with k terminals and the parity condition for each path, as well as several other related problems. We present an O(ma(m, n)n) time algor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications

    Publication Year: 2011, Page(s):37 - 46
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (535 KB) | HTML iconHTML

    Alon, Seymour, and Thomas generalized Lipton and Tarjan's planar separator theorem and showed that a Kh- minor free graph with n vertices has a separator of size at most h3/2 √n. They gave an algorithm that, given a graph G with m edges and n vertices and given an integer h ≥ 1, outputs in O(√hnm) time such a separator or a Ku-minor of G. Plotkin, Rao, an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths

    Publication Year: 2011, Page(s):47 - 56
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (584 KB) | HTML iconHTML

    In this paper, we present a constant-factor approximation algorithm for the unsplittable flow problem on a path. This improves on the previous best known approximation factor of O(log n). The approximation ratio of our algorithm is 7+e for any e>;0. In the unsplittable flow problem on a path, we are given a capacitated path P and n tasks, each task having a demand, a profit, and start and end v... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How Bad is Forming Your Own Opinion?

    Publication Year: 2011, Page(s):57 - 66
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (575 KB) | HTML iconHTML

    A long-standing line of work in economic theory has studied models by which a group of people in a social network, each holding a numerical opinion, can arrive at a shared opinion through repeated averaging with their neighbors in the network. Motivated by the observation that consensus is rarely reached in real opinion dynamics, we study a related sociological model in which individuals' intrinsi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Complexity of the Homotopy Method, Equilibrium Selection, and Lemke-Howson Solutions

    Publication Year: 2011, Page(s):67 - 76
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB) | HTML iconHTML

    We show that the widely used homotopy method for solving fix point problems, as well as the Harsanyi-Selten equilibrium selection process for games, are PSPACE-complete to implement. Extending our result for the Harsanyi-Selten process, we show that several other homotopy-based algorithms for finding equilibria of games are also PSPACE-complete to implement. A further application of our techniques... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Welfare and Profit Maximization with Production Costs

    Publication Year: 2011, Page(s):77 - 86
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (559 KB) | HTML iconHTML

    Combinatorial Auctions are a central problem in Algorithmic Mechanism Design: pricing and allocating goods to buyers with complex preferences in order to maximize some desired objective (e.g., social welfare, revenue, or profit). The problem has been well-studied in the case of limited supply (one copy of each item), and in the case of digital goods (the seller can produce additional copies at no ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mechanism Design with Set-Theoretic Beliefs

    Publication Year: 2011, Page(s):87 - 96
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (695 KB) | HTML iconHTML

    In settings of incomplete information, we put forward (1) a very conservative -- indeed, purely set-theoretic -- model of the beliefs (including totally wrong ones) that each player may have about the payoff types of his opponents, and (2) a new and robust solution concept, based on mutual belief of rationality, capable of leveraging such conservative beliefs. We exemplify the applicability of our... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Fully Homomorphic Encryption from (Standard) LWE

    Publication Year: 2011, Page(s):97 - 106
    Cited by:  Papers (117)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (544 KB) | HTML iconHTML

    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 previous works in two aspects: 1) We show that "somewhat homomorphic" encryption can be based on LWE... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits

    Publication Year: 2011, Page(s):107 - 109
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (599 KB) | HTML iconHTML

    We describe a new approach for constructing fully homomorphic encryption (FHE) schemes. Previous FHE schemes all use the same blueprint from [Gentry 2009]: First construct a somewhat homomorphic encryption (SWHE) scheme, next "squash" the decryption circuit until it is simple enough to be handled within the homomorphic capacity of the SWHE scheme, and finally "bootstrap" to get a FHE scheme. In al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coin Flipping with Constant Bias Implies One-Way Functions

    Publication Year: 2011, Page(s):110 - 119
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (478 KB) | HTML iconHTML

    It is well known (cf., Impagliazzo and Luby [FOCS '89]) that the existence of almost all "interesting" cryptographic applications, i.e., ones that cannot hold information theoretically, implies one-way functions. An important exception where the above implication is not known, however, is the case of coin-flipping protocols. Such protocols allow honest parties to mutually flip an unbiased coin, wh... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How to Garble Arithmetic Circuits

    Publication Year: 2011, Page(s):120 - 129
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (673 KB) | HTML iconHTML

    Yao's garbled circuit construction transforms a boolean circuit C : {0, 1}n → {0, 1}m into a "garbled circuit" Ĉ along with n pairs of k-bit keys, one for each input bit, such that Ĉ together with the n keys corresponding to an input x reveal C(x) and no additional information about x. The garbled circuit construction is a central tool for constant-roun... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.