Secure Two-Party Computation with Low Communication

@inproceedings{Damgrd2011SecureTC,
  title={Secure Two-Party Computation with Low Communication},
  author={Ivan Damg{\aa}rd and Sebastian Faust and Carmit Hazay},
  booktitle={IACR Cryptology ePrint Archive},
  year={2011}
}
We propose a 2-party UC-secure protocol that can compute any function securely. The protocol requires only two messages, communication that is poly-logarithmic in the size of the circuit description of the function, and the workload for one of the parties is also only poly-logarithmic in the size of the circuit. This implies, for instance, delegatable computation that requires no expensive off-line phase and remains secure even if the server learns whether the client accepts its results. To… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 77 CITATIONS, ESTIMATED 97% COVERAGE

The Hunting of the SNARK

  • Journal of Cryptology
  • 2014
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Efficient private multi-party computations of trust in the presence of curious and malicious users

  • Journal of Trust Management
  • 2013
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Salus: a system for server-aided secure function evaluation

  • ACM Conference on Computer and Communications Security
  • 2012
VIEW 7 EXCERPTS
HIGHLY INFLUENCED

Aggregation of Gamma-Signatures and Applications to Bitcoin

  • IACR Cryptology ePrint Archive
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

FILTER CITATIONS BY YEAR

2011
2019

CITATION STATISTICS

  • 4 Highly Influenced Citations

  • Averaged 7 Citations per year from 2017 through 2019

References

Publications referenced by this paper.