Zero-knowledge arguments and public-key cryptography
The paper investigates Diffie-Hellman Public-key systems in which additionally a short random string is shared by all users. Such a system is called a Public-Key Public-Randomness Model (PKPR-Model). The authors show how Rabin's Oblivious Transfer Protocol for two parties can be implemented in a PKPR-Model without any interaction and without trusted center or some distributed fault-tolerant computation. This implementation is secure against receivers with unlimited computational power. Furthermore, a non-interactive implementation of Perfect Zero-Knowledge Arguments for all NP-languages in a PKPR-Model is presented. It is proved that PKPR Perfect Zero-Knowledge Arguments are possible under Quadratic Residuosity Assumption.
- Zero-knowledge authentication scheme with secret key exchange
- Cryptology in the Classroom: Analyzing a Zero-Knowledge Protocol
- scientific article; zbMATH DE number 177022 (Why is no real title available?)
- Zero-Knowledge Proofs
- scientific article; zbMATH DE number 1759323 (Why is no real title available?)
- scientific article; zbMATH DE number 2196514 (Why is no real title available?)
- Zero-knowledge arguments for subverted RSA groups
- Sherlock Holmes zero-knowledge protocols
- Zero‐Knowledge Proofs
This page was built for publication: Zero-knowledge arguments and public-key cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1898111)