Zero-knowledge proofs of knowledge for group homomorphisms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2059223
- Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Zero-knowledge arguments for subverted RSA groups
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- scientific article; zbMATH DE number 826068
- Authenticating computation on groups: new homomorphic primitives and applications
- Zero knowledge with efficient provers
Cites work
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 176555 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 1162684 (Why is no real title available?)
- A method for obtaining digital signatures and public-key cryptosystems
- Breaking RSA Generically Is Equivalent to Factoring
- Efficiency limitations for \(\Sigma \)-protocols for group homomorphisms
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- New directions in cryptography
- On the Portability of Generalized Schnorr Proofs
- Public Key Cryptography - PKC 2005
- The Knowledge Complexity of Interactive Proof Systems
- Unifying Zero-Knowledge Proofs of Knowledge
- Zero-knowledge proofs of identity
Cited in
(26)- scientific article; zbMATH DE number 1941245 (Why is no real title available?)
- On the Portability of Generalized Schnorr Proofs
- Unifying Zero-Knowledge Proofs of Knowledge
- Sigma protocols from verifiable secret sharing and their applications
- A composable security treatment of ECVRF and batch verifications
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- Efficient NIZK arguments with straight-line simulation and extraction
- Improved OR-composition of sigma-protocols
- scientific article; zbMATH DE number 826068 (Why is no real title available?)
- Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
- A zero-knowledge proof based remote desktop authentication protocol
- Simple zero-knowledge proof of knowing \(\sqrt{X_1}\) or \(\sqrt{X_2}\) mod \(N\)
- Efficient and universally composable single secret leader election from pairings
- Zero-knowledge arguments for subverted RSA groups
- scientific article; zbMATH DE number 1424187 (Why is no real title available?)
- Public Key Cryptography - PKC 2006
- Efficiency limitations for \(\Sigma \)-protocols for group homomorphisms
- Batch proofs of partial knowledge
- Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic
- Zero-knowledge proof protocol of the roots of polynomial functions
- SZK proofs for black-box group problems
- Zero-knowledge protocols for NTRU: application to identification and proof of plaintext knowledge
- Strong proofs of knowledge
- An introduction to the use of zk-SNARKs in blockchains
- Efficiency limitations of \(\Sigma \)-protocols for group homomorphisms revisited
This page was built for publication: Zero-knowledge proofs of knowledge for group homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q887447)
