Efficiency Limitations for Σ-Protocols for Group Homomorphisms
From MaRDI portal
Publication:3408215
DOI10.1007/978-3-642-11799-2_33zbMath1274.94036OpenAlexW2117091223MaRDI QIDQ3408215
Stephan Krenn, Jan Camenisch, Endre Bangerter
Publication date: 24 February 2010
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11799-2_33
Related Items (3)
Zero-knowledge proofs of knowledge for group homomorphisms ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms
Cites Work
- Efficient signature generation by smart cards
- Complexity of a determinate algorithm for the discrete logarithm
- On the Security of a Practical Identification Scheme
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- The random oracle methodology, revisited
- On the Amortized Complexity of Zero-Knowledge Protocols
- Efficiency Limitations for Σ-Protocols for Group Homomorphisms
- Perfect NIZK with Adaptive Soundness
- On the Portability of Generalized Schnorr Proofs
- Unifying Zero-Knowledge Proofs of Knowledge
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A method for obtaining digital signatures and public-key cryptosystems
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Foundations of Cryptography
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- The Exact Security of ECIES in the Generic Group Model
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Public Key Cryptography - PKC 2005
- Progress in Cryptology - INDOCRYPT 2004
- Breaking RSA Generically Is Equivalent to Factoring
- Advances in Cryptology - ASIACRYPT 2003
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Efficiency Limitations for Σ-Protocols for Group Homomorphisms