Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation

Mihir Bellare, Moti Yung

Open source

DOI
10.1007/s001459900009
Published
1996
Container
Journal of Cryptology
Publisher
Springer Science and Business Media LLC
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/s001459900009,
  title = {Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation},
  author = {Mihir Bellare and Moti Yung},
  year = {1996},
  journal = {Journal of Cryptology},
  doi = {10.1007/s001459900009},
  url = {https://doi.org/10.1007/s001459900009}
}

RIS

TY  - JOUR
TI  - Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation
AU  - Mihir Bellare
AU  - Moti Yung
PY  - 1996
JO  - Journal of Cryptology
DO  - 10.1007/s001459900009
UR  - https://doi.org/10.1007/s001459900009
ER  - 

APA

Bellare, M., & Yung, M. (1996). Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation. Journal of Cryptology. https://doi.org/10.1007/s001459900009

Source records