Universally Composable Synchronous Computation

@article{Katz2011UniversallyCS,
  title={Universally Composable Synchronous Computation},
  author={Jonathan Katz and Ueli Maurer and Bj{\"o}rn Tackmann and Vassilis Zikas},
  journal={IACR Cryptology ePrint Archive},
  year={2011},
  volume={2011},
  pages={310}
}
In synchronous networks, protocols can achieve security guarantees that are not possible in an asynchronous world: they can simultaneously achieve input completeness (all honest parties' inputs are included in the computation) and guaranteed termination (honest parties do not hang inde nitely). In practice truly synchronous networks rarely exist, but synchrony can be emulated if channels have (known) bounded latency and parties have loosely synchronized clocks. The widely-used framework of… CONTINUE READING
Highly Cited
This paper has 64 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
40 Citations
34 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 40 extracted citations

65 Citations

01020'13'14'15'16'17'18
Citations per Year
Semantic Scholar estimates that this publication has 65 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 34 references

Universally Composable Synchronous Computation

  • J. Katz, U. Maurer, B. Tackmann, V. Zikas
  • Cryptology ePrint Archive, Report 2011/310
  • 2012
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…