Skip to main content

1993 | OriginalPaper | Buchkapitel

Certifying Cryptographic Tools: The Case of Trapdoor Permutations

verfasst von : Mihir Bellare, Moti Yung

Erschienen in: Advances in Cryptology — CRYPTO’ 92

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.

search-config
loading …

In cryptographic protocols it is often necessary to verify/certify the “tools” in use. This work demonstrates certain subtleties in treating a family of trapdoor permutations in this context, noting the necessity to “check” certain properties of these functions. The particular case we illustrate is that of non-interactive zero-knowledge. We point out that the elegant recent protocol of Feige, Lapidot and Shamir for proving NP statements in non-interactive zero-knowledge requires an additional certification of the underlying trapdoor permutation, and suggest a certification method to fill this gap.

Metadaten
Titel
Certifying Cryptographic Tools: The Case of Trapdoor Permutations
verfasst von
Mihir Bellare
Moti Yung
Copyright-Jahr
1993
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/3-540-48071-4_31