Advertisement

Certifying Cryptographic Tools: The Case of Trapdoor Permutations

  • Mihir Bellare
  • Moti Yung
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 740)

Abstract

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.

Keywords

Polynomial Time Proof System Completeness Condition Random String Common Input 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [BeGo]
    M. Bellare and S. Goldwasser. New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero-Knowledge Proofs. Advances in Cryptology — CRYPTO 89. Lecture Notes in Computer Science, Vol. 435, Springer Verlag.Google Scholar
  2. [BeMi]
    M. Bellare and S. Micali. How to Sign Given any Trapdoor Permutation. JACM, Vol. 39, No. 1, January 1992, pp. 214–233. (Preliminary version in Proceedings of the 20th STOC, 1988).CrossRefzbMATHMathSciNetGoogle Scholar
  3. [BMO]
    M. Bellare, S. Micali and R. Ostrovsky. The True Complexity of Statistical Zero-Knowledge. Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, 1990.Google Scholar
  4. [BBS]
    L. Blum, M. Blum, and M. Shub. A Simple Unpredictable Pseudo-Random Number Generator. SIAM Journal on Computing, Vol. 15, No. 2, May 1986, pp. 364–383.CrossRefzbMATHMathSciNetGoogle Scholar
  5. [BDMP]
    M. Blum, A. De Santis, S. Micali, and G. Persiano, Non-Interactive Zero-Knowledge Proof Systems, SIAM Journal on Computing, Vol. 20, No. 6, December 1991, pp. 1084–1118.CrossRefzbMATHMathSciNetGoogle Scholar
  6. [BFM]
    M. Blum, P. Feldman, and S. Micali, Non-Interactive Zero-Knowledge Proof Systems and Applications, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988.Google Scholar
  7. [DeYu]
    A. De Santis and M. Yung. Cryptographic Applications of the Metaproof and Many-prover Systems. Advances in Cryptology — CRYPTO 90. Lecture Notes in Computer Science, Vol. 537, Springer-Verlag.Google Scholar
  8. [FLS]
    U. Feige, D. Lapidot, and A. Shamir. Multiple Non-Interactive Zero-Knowledge based on a Single Random String. Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, 1990.Google Scholar
  9. [GMW]
    O. Goldreich, S. Micali, and A. Wigderson. Proofs that Yield Nothing but their Validity and a Methodology of Cryptographic Design. JACM, July 1991. (Preliminary version in the 27th FOCS, 1986).Google Scholar
  10. [GoLe]
    O. Goldreich and L. Levin. A Hard-Core Predicate for all One-Way Functions. Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, 1989.Google Scholar
  11. [GMR]
    S. Goldwasser, S. Micali, and R. Rivest. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM Journal on Computing, Vol. 17, No. 2, April 1988, pp. 281–308.CrossRefzbMATHMathSciNetGoogle Scholar
  12. [NaYu]
    M. Naor and M. Yung. Public Key Cryptosystems secure against chosen-ciphertext attacks. Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, 1990.Google Scholar
  13. [RSA]
    R. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, Vol. 21, No. 2, February 1978, pp. 120–26.CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Mihir Bellare
    • 1
  • Moti Yung
    • 2
  1. 1.High Performance Computing and CommunicationsIBM T.J. Watson Research CenterYorktown Heights
  2. 2.IBM ResearchIBM T.J. Watson Research CenterYorktown Heights

Personalised recommendations