scientific article

zbMath0638.94013MaRDI QIDQ3780991

Jeroen van de Graaf, René Peralta, David Chaum, Jan-Hendrik Evertse

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

protocolsDiscrete Log Problem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Minimum disclosure proofs of knowledge ⋮ Secure electronic bills of lading: Blind counts and digital signatures ⋮ Practic zero-knowledge proofs: Giving hints and using deficiencies ⋮ An interactive identification scheme based on discrete logarithms and factoring ⋮ A framework for non-interactive instance-dependent commitment schemes (NIC) ⋮ Secret, verifiable auctions from elections ⋮ Cryptanalysis and improvement on batch verifying multiple RSA digital signatures ⋮ The Power of Anonymous Veto in Public Discussion ⋮ A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm ⋮ Blinding for Unanticipated Signatures ⋮ Constant-round perfect zero-knowledge computationally convincing protocols