69 citations · 71 across the 4 of their papers we have counts for
4 papers
POPE: Partial Order Preserving Encoding
Daniel S. Roche, Daniel Apon, Seung Geol Choi +1
Recently there has been much interest in performing search queries over encrypted data to enable functionality while protecting sensitive data. One particularly efficient mechanism…
One-Round Multi-Party Communication Complexity of Distinguishing Sums
Daniel Apon, Jonathan Katz, Alex J. Malozemoff
We consider an instance of the following problem: Parties P_1,..., P_k each receive an input x_i, and a coordinator (distinct from each of these parties) wishes to compute f(x_1,..…
On Lower Bound Methods for Tree-like Cutting Plane Proofs
Daniel Apon
In the book Boolean Function Complexity by Stasys Jukna, two lower bound techniques for Tree-like Cutting Plane proofs (henceforth, "Tree-CP proofs") using Karchmer-Widgerson type…
An NP-Complete Problem in Grid Coloring
Daniel Apon, William Gasarch, Kevin Lawler
A c-coloring of G(n,m)=n x m is a mapping of G(n,m) into {1,...,c} such that no four corners forming a rectangle have the same color. In 2009 a challenge was proposed via the inter…