Zero-knowledge proofs of knowledge for group homomorphisms

DOI10.1007/s10623-015-0103-5zbMath1356.94077OpenAlexW627891592WikidataQ113903990 ScholiaQ113903990MaRDI QIDQ887447

Ueli M. Maurer

Publication date: 26 October 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: http://doc.rero.ch/record/331990/files/10623_2015_Article_103.pdf

zbMATH Keywords

proof of knowledgegroup homomorphismzero-knowledge protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Efficient and universally composable single secret leader election from pairings ⋮ A composable security treatment of ECVRF and batch verifications ⋮ Efficient NIZK arguments with straight-line simulation and extraction ⋮ An Introduction to the Use of zk-SNARKs in Blockchains ⋮ Improved OR-Composition of Sigma-Protocols

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero-knowledge proofs of identity
• Efficiency Limitations for Σ-Protocols for Group Homomorphisms
• On the Portability of Generalized Schnorr Proofs
• Unifying Zero-Knowledge Proofs of Knowledge
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The Knowledge Complexity of Interactive Proof Systems
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Public Key Cryptography - PKC 2005
• Breaking RSA Generically Is Equivalent to Factoring

This page was built for publication: Zero-knowledge proofs of knowledge for group homomorphisms