A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles

@inproceedings{Ciampi2015ATF,
  title={A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles},
  author={Michele Ciampi and Giuseppe Persiano and Luisa Siniscalchi and Ivan Visconti},
  booktitle={TCC},
  year={2015}
}
The Fiat-Shamir (FS) transform is a popular technique for obtaining practical zero-knowledge argument systems. The FS transform uses a hash function to generate, without any further overhead, noninteractive zero-knowledge (NIZK) argument systems from public-coin honest-verifier zero-knowledge (public-coin HVZK) proof systems. In the proof of zero knowledge, the hash function is modeled as a programmable random oracle (PRO). In TCC 2015, Lindell embarked on the challenging task of obtaining a… CONTINUE READING
BETA

Citations

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

References

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

Efficient Zero Knowledge on the Internet

  • ICALP
  • 2006
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles

M. Ciampi, G. Persiano, L. Siniscalchi, I. Visconti
  • IACR Cryptology ePrint Archive
  • 2015
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…