10 research outputs found
Walrasian pricing in multi-unit auctions
Multi-unit auctions are a paradigmatic model, where a seller brings multiple units of a good, while several buyers bring monetary endowments. It is well known that Walrasian equilibria do not always exist in this model, however compelling relaxations such asWalrasian envy-free pricing do. In this paper we design an optimal envy-free mechanism for multi-unit auctions with budgets. When the market is even mildly competitive, the approximation ratios of this mechanism are small constants for both the revenue and welfare objectives, and in fact for welfare the approximation converges to 1 as the market becomes fully competitive. We also give an impossibility theorem, showing that truthfulness requires discarding resources, and in particular, is incompatible with (Pareto) efficiency
Non-Malleable Codes Against Bounded Polynomial Time Tampering
We construct efficient non-malleable codes (NMC) that are (computationally) secure against tampering by functions computable in any fixed polynomial time. Our construction is in the plain (no-CRS) model and requires the assumptions that (1) is hard for circuits of some exponential () size (widely used in the derandomization literature), (2) sub-exponential trapdoor permutations exist, and (3) certificates with sub-exponential soundness exist.
While it is impossible to construct NMC secure against arbitrary polynomial-time tampering (Dziembowski, Pietrzak, Wichs, ICS \u2710),
the existence of NMC secure against -time tampering functions
(for any fixed ), was shown (Cheraghchi and Guruswami, ITCS \u2714) via a probabilistic construction. An explicit construction was given (Faust, Mukherjee, Venturi, Wichs, Eurocrypt \u2714) assuming an untamperable CRS with length longer than the runtime of the tampering function. In this work, we show that under computational assumptions, we can bypass these limitations. Specifically, under the assumptions listed above, we obtain non-malleable codes in the plain model against -time tampering functions (for any fixed ), with codeword length independent of the tampering time bound.
Our new construction of NMC draws a connection with non-interactive non-malleable commitments. In fact, we show that in the NMC setting,
it suffices to have a much weaker notion called quasi non-malleable
commitments---these are non-interactive, non-malleable commitments in
the plain model, in which the adversary runs in -time, whereas
the honest parties may run in longer (polynomial) time. We then
construct a 4-tag quasi non-malleable commitment from any sub-exponential OWF and the assumption that is hard for some exponential size -circuits, and use tag amplification techniques to support an exponential number of tags
Searching constant width mazes captures the AC(0) hierarchy
We show that searching a width k maze is complete for Pi_k, i.e., for the k'th level of the AC0 hierarchy. Equivalently, st-connectivity for width k grid graphs is complete for Pi_k . As an application, we show that there is a data structure solving dynamic st-connectivity for constant width grid graphs with time bound O(log log n) per operation on a random access machine. The dynamic algorithm is derived from the parallel one in an indirect way using algebraic tools.\u