Bounded-concurrent secure two-party computation in a constant number of rounds

@article{Pass2003BoundedconcurrentST,
  title={Bounded-concurrent secure two-party computation in a constant number of rounds},
  author={Rafael Pass and Alon Rosen},
  journal={44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.},
  year={2003},
  pages={404-413}
}
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we focus on the case where an a-priori bound on the number of concurrent sessions is specified before the protocol is constructed. (a.k.a. bounded concurrency). We make no setup assumptions. Lindel (STOC 2003) has shown that any protocol for bounded-concurrent secure two-party computation, whose security is established via… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 68 CITATIONS

How to play almost any mental game over the net - concurrent composition via super-polynomial simulation

  • 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
  • 2005
VIEW 11 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

New and improved constructions of non-malleable cryptographic protocols

  • STOC '05
  • 2005
VIEW 7 EXCERPTS
CITES METHODS, RESULTS & BACKGROUND

Bounded-concurrent secure multi-party computation with a dishonest majority

  • STOC '04
  • 2004
VIEW 16 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS

Lower Bounds and Impossibility Results for Concurrent Self Composition

  • Journal of Cryptology
  • 2004
VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Lower Bounds for Concurrent Self Composition

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2003
2017

CITATION STATISTICS

  • 3 Highly Influenced Citations

References

Publications referenced by this paper.
SHOWING 1-10 OF 34 REFERENCES

How to go beyond the black-box simulation barrier

  • Proceedings 2001 IEEE International Conference on Cluster Computing
  • 2001
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Universal arguments and their applications

  • Proceedings 17th IEEE Annual Conference on Computational Complexity
  • 2001
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Universally composable security: a new paradigm for cryptographic protocols

  • Proceedings 2001 IEEE International Conference on Cluster Computing
  • 2000
VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL