The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.

19-19 Nov. 2002

Filter Results

Displaying Results 1 - 25 of 82
  • Proceedings 43rd Annual IEEE Symposium on Foundations of Computer Science

    Publication Year: 2002
    Request permission for commercial reuse | PDF file iconPDF (327 KB)
    Freely Available from IEEE
  • Zero-knowledge: abstract of a tutorial

    Publication Year: 2002
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (201 KB) | HTML iconHTML

    Zero-knowledge proofs are fascinating and extremely useful constructs. Their fascinating nature is due to their seemingly contradictory definition; zero-knowledge proofs are both convincing and yet yield nothing beyond the validity of the assertion being proven. Their applicability in the domain of cryptography is vast; they are typically used to force malicious parties to behave according to a pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning intersections and thresholds of halfspaces

    Publication Year: 2002, Page(s):177 - 186
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (389 KB) | HTML iconHTML

    We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution to within any constant error parameter. We also give the first quasipolynomial time algorithm for learning any function of a polylog number of polynomial-weight halfspaces under any distribution. As special cases of these results we obtain algorithms for learning inte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Erratum to "Vickrey pricing and shortest paths: What is an edge worth?"

    Publication Year: 2002, Page(s): 809
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB) | HTML iconHTML

    First Page of the Article
    View full abstract»

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

    Publication Year: 2002, Page(s):811 - 813
    Request permission for commercial reuse | PDF file iconPDF (177 KB)
    Freely Available from IEEE
  • Dependent rounding in bipartite graphs

    Publication Year: 2002, Page(s):323 - 332
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (411 KB) | HTML iconHTML

    We combine the pipage rounding technique of Ageev & Sviridenko with a recent rounding method developed by Srinivasan (2001), to develop a new randomized rounding approach for fractional vectors defined on the edge-sets of bipartite graphs. We show various ways of combining this technique with other ideas, leading to the following applications: richer random-graph models for graphs with a given deg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the (non)universality of the one-time pad

    Publication Year: 2002, Page(s):376 - 385
    Cited by:  Papers (10)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (403 KB) | HTML iconHTML

    Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. We initiate the quantitative study concerning feasibility of building secure cryptographic primitives using imperfect random sources. Specifically, we concentrate on symmetric-key encryption and message authentication, where the shared secret ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proving integrality gaps without knowing the linear program

    Publication Year: 2002, Page(s):313 - 322
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (351 KB) | HTML iconHTML

    Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic approach. We prove an integrality gap of 2-o(1) for three families of linear relaxations for vertex cover, and our methods seem relevant to other problems as well. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the decidability of self-assembly of infinite ribbons

    Publication Year: 2002, Page(s):530 - 537
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (306 KB) | HTML iconHTML

    Self-assembly, the process by which objects autonomously come together to form complex structures, is omnipresent in the physical world. A systematic study of self-assembly as a mathematical process has been initiated. The individual components are modelled as square tiles on the infinite two-dimensional plane. Each side of a tile is covered by a specific "glue", and two adjacent tiles will stick ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent zero knowledge with logarithmic round-complexity

    Publication Year: 2002, Page(s):366 - 375
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB) | HTML iconHTML

    We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using O˜(log n) rounds of interaction. The number of rounds in our protocol is optimal, in the sense that any language outside BPP requires at least Ω˜(log n) rounds of interaction in order to be proved in black-box concurrent zero-knowledge. The zero-knowledge property of our main protocol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line end-to-end congestion control

    Publication Year: 2002, Page(s):303 - 310
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (277 KB) | HTML iconHTML

    Congestion control in the current Internet is accomplished mainly by TCP/IP. To understand the macroscopic network behavior that results from TCP/IP and similar end-to-end protocols, one main analytic technique is to show that the the protocol maximizes some global objective function of the network traffic. We analyze a particular end-to-end MIMD (multiplicative-increase, multiplicative-decrease) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Limits on the power of quantum statistical zero-knowledge

    Publication Year: 2002, Page(s):459 - 468
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZKHV. We prove several facts regarding this class, including: the following problem is a complete promise problem for QSZKHV: given instructions for preparing two mixed quantum states, are the states close to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On approximating the radii of point sets in high dimensions

    Publication Year: 2002, Page(s):561 - 569
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (693 KB) | HTML iconHTML

    Let P be a set of n points in Rd. For any 1≤k≤d, the outer k-radius of P, denoted by Rk(P), is the minimum, over all (d-k) -dimensional fiats F, of maxp∈P d(p, F), where d(p, F) is the Euclidean distance between the point p and fiat F. We consider the scenario when the dimension d is not fixed and can be as large as n. Computing the various radii of poin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Packing 2-dimensional bins in harmony

    Publication Year: 2002, Page(s):490 - 499
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (387 KB) | HTML iconHTML

    We consider 2-Dimensional (Finite) Bin Packing (2BP), which is one of the most important generalizations of the well-known Bin Packing (BP) and calls for orthogonally packing a given set of rectangles (that cannot be rotated) into the minimum number of unit size squares. There are many open questions concerning the approximability of 2BP, whereas the situation for the 2-stage case, in which the it... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum computation and lattice problems

    Publication Year: 2002, Page(s):520 - 529
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (415 KB) | HTML iconHTML

    We present the first explicit connection between quantum computation and lattice problems. Namely, we show a solution to the unique shortest vector problem (SVP) under the assumption that there exists an algorithm that solves the hidden subgroup problem on the dihedral group by coset sampling. Moreover, we solve the hidden subgroup problem on the dihedral group by using an average case subset sum ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved dynamic reachability algorithms for directed graphs

    Publication Year: 2002, Page(s):679 - 688
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (391 KB) | HTML iconHTML

    We obtain several new dynamic algorithms for maintaining the transitive closure of a directed graph, and several other algorithms for answering reachability queries without explicitly maintaining a transitive closure matrix. Among our algorithms are: (i) a decremental algorithm for maintaining the transitive closure of a directed graph, through an arbitrary sequence of edge deletions, in O(mn) tot... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Load balancing with memory

    Publication Year: 2002, Page(s):799 - 808
    Cited by:  Papers (14)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (378 KB) | HTML iconHTML

    A standard load balancing model considers placing n balls into n bins by choosing d possible locations for each ball independently and uniformly at random and sequentially placing each in the least loaded of its chosen bins. It is well known that allowing just a small amount of choice (d = 2) greatly improves performance over random placement (d = 1). In this paper, we show that similar performanc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized compact knapsacks, cyclic lattices, and efficient one-way functions from worst-case complexity assumptions

    Publication Year: 2002, Page(s):356 - 365
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (378 KB) | HTML iconHTML

    We study a generalization of the compact knapsack problem for arbitrary rings: given m = O(log n) ring elements a1, . . . , am ∈ R and a target value b ∈ R, find coefficients x1, . . . , xm ∈ X (where X is a subset of R of size 2n) such that Σaixi = b. The computational complexity of this problem depe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simple algorithmic characterization of uniform solvability

    Publication Year: 2002, Page(s):228 - 237
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (361 KB) | HTML iconHTML

    The Herlihy-Shavit (HS) conditions characterizing the solvability of asynchronous tasks over n processors have been a milestone in the development of the theory of distributed computing. Yet, they were of no help when researcher sought algorithms that do not depend on n. To help in this pursuit we investigate the uniform solvability of an infinite uniform sequence of tasks T0, T1 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implicit B-trees: New results for the dictionary problem

    Publication Year: 2002, Page(s):145 - 154
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (379 KB) | HTML iconHTML

    We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining n data values in the first n locations of an array in such a way that we can efficiently perform the operations insert, delete and search. No information other than n and the data is to be retained; and the only operations which we may perform on the data value... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scheduling over a time-varying user-dependent channel with applications to high speed wireless data

    Publication Year: 2002, Page(s):293 - 302
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB) | HTML iconHTML

    In a wireless network, a basestation transmits data to mobiles at time-varying, mobile-dependent rates due to the ever changing nature of the communication channels. In this paper we consider a wireless system in which the channel conditions and data arrival processes are governed by an adversary. We first consider a single server and a set of users. At each time step t the server can only transmi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authentication of quantum messages

    Publication Year: 2002, Page(s):449 - 458
    Cited by:  Papers (47)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    Authentication is a well-studied area of classical cryptography: a sender A and a receiver B sharing a classical secret key want to exchange a classical message with the guarantee that the message has not been modified or replaced by a dishonest party with control of the communication line. In this paper we study the authentication of messages composed of quantum states. We give a formal definitio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dimension reduction in the ℓ1 norm

    Publication Year: 2002, Page(s):551 - 560
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (975 KB) | HTML iconHTML

    The Johnson-Lindenstrauss lemma shows that any set of n points in Euclidean space can be mapped linearly down to O((log n)/ε2) dimensions such that all pairwise distances are distorted by at most 1+ε. We study the basic question of whether there exists an analogue of the Johnson-Lindenstrauss lemma for the ℓ1 norm? Note that Johnson-Lindenstrauss lemma gives a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Covering problems with hard capacities

    Publication Year: 2002, Page(s):481 - 489
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its elements (adjacent edges) and the number of available copies of each set (vertex) is bounded. This is a natural generalization of the classical problems that also captures resource limitations in practical scenarios. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounded-depth Frege lower bounds for weaker pigeonhole principles

    Publication Year: 2002, Page(s):583 - 592
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (385 KB) | HTML iconHTML

    We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPnm where m = (1 + 1/polylog n)n. This lower bound qualitatively matches the known quasipolynomial-size bounded-depth Frege proofs for these principles. Our technique, which uses a switching lemma argument like other lower bounds for bounded-depth Frege proofs, is n... View full abstract»

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