Secure two-party computation in sublinear (amortized) time

@article{Gordon2012SecureTC,
  title={Secure two-party computation in sublinear (amortized) time},
  author={S. D. Gordon and Jonathan Katz and V. Kolesnikov and Fernando Krell and T. Malkin and Mariana Raykova and Yevgeniy Vahlis},
  journal={Proceedings of the 2012 ACM conference on Computer and communications security},
  year={2012}
}
Traditional approaches to generic secure computation begin by representing the function f being computed as a circuit. If f depends on each of its input bits, this implies a protocol with complexity at least linear in the input size. In fact, linear running time is inherent for non-trivial functions since each party must "touch" every bit of their input lest information about the other party's input be leaked. This seems to rule out many applications of secure computation (e.g., database search… Expand
151 Citations
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model
  • 5
  • PDF
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model
  • 8
  • PDF
Cut-and-Choose for Garbled
  • PDF
Secure Computation from Millionaire
  • 7
  • PDF
Secure Two-Party Computation with Low Communication
  • 108
  • PDF
Garbled RAM Revisited, Part I
  • 11
  • PDF
Two-server Distributed ORAM with Sublinear Computation and Constant Rounds
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-4 OF 4 REFERENCES
Efficient oblivious transfer protocols
  • 734
  • Highly Influential
Software protection and simulation on oblivious RAMs
  • 1,410
  • Highly Influential
  • PDF
Oblivious RAM with O((logN)3) Worst-Case Cost
  • 388
  • Highly Influential
  • PDF
Private information 11 storage
  • In 29th Annual ACM Symposium on Theory of Computing (STOC),
  • 1997