Constant round non-malleable protocols using one way functions

@article{Goyal2010ConstantRN,
  title={Constant round non-malleable protocols using one way functions},
  author={Vipul Goyal},
  journal={IACR Cryptology ePrint Archive},
  year={2010},
  volume={2010},
  pages={487}
}
We provide the first constant round constructions of non-malleable commitment and zero-knowledge protocols based only on one-way functions. This improves upon several previous (incomparable) works which required either: (a) super-constant number of rounds, or, (b) non-standard or sub-exponential hardness assumptions, or, (c) non-black-box simulation and collision resistant hash functions. These constructions also allow us to obtain the first constant round multi-party computation protocol… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 68 CITATIONS, ESTIMATED 99% COVERAGE

Round-Efficient Black-Box Construction of Composable Multi-Party Computation

  • Journal of Cryptology
  • 2018
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Breaking the Three Round Barrier for Non-malleable Commitments

  • 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2016
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS

Constructing Non-malleable Commitments: A Black-Box Approach

  • 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
  • 2012
VIEW 10 EXCERPTS
CITES METHODS & BACKGROUND

Round Optimal Concurrent Non-Malleability from Polynomial Hardness

  • IACR Cryptology ePrint Archive
  • 2017
VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A universal framework for concurrent security

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A New Approach to Black-Box Concurrent Secure Computation

  • IACR Cryptology ePrint Archive
  • 2018
VIEW 2 EXCERPTS
CITES BACKGROUND

FILTER CITATIONS BY YEAR

2010
2019

CITATION STATISTICS

  • 7 Highly Influenced Citations

  • Averaged 8 Citations per year from 2017 through 2019

References

Publications referenced by this paper.
SHOWING 1-9 OF 9 REFERENCES

Black-Box, Round-Efficient Secure Computation via Non-malleability Amplification

  • 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
  • 2010
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Constant-round coin-tossing with a man in the middle or realizing the shared random string model

  • The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
  • 2002
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

The relative complexity of non-malleable protocols

A. Jain, O. Pandey
  • In Manuscript,
  • 2011
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Non-malleability amplification

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Concurrent non-malleable commitments

  • 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
  • 2005
VIEW 8 EXCERPTS
HIGHLY INFLUENTIAL