scientific article; zbMATH DE number 2059223

MaRDI QIDQ4455756zbMATH OpenFDO

Authors Oleg Verbitsky

Publication date 16 March 2004

zbMATH Keywords

conjugacyinteractive proof systemNP-completenesspermutation groupzero-knowledge proof

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Permutation groups (20B99) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• SZK proofs for black-box group problems
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• scientific article; zbMATH DE number 4185032
• A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
• scientific article; zbMATH DE number 94166

Cited in

(6)

• SZK Proofs for Black-Box Group Problems
• scientific article; zbMATH DE number 826068 (Why is no real title available?)
• Testability in group theory
• Zero-knowledge arguments for subverted RSA groups
• Zero-knowledge proofs of knowledge for group homomorphisms
• SZK proofs for black-box group problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4455756)