Paper 2009/595
Efficiency Limitations for -Protocols for Group Homomorphisms
Endre Bangerter, Jan Camenisch, and Stephan Krenn
Abstract
Efficient zero-knowledge proofs of knowledge for group homomorphisms are essential for numerous systems in applied cryptography. Especially,
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Extended abstract appears in TCC 2010.
- Keywords
- Generic Group Model
-ProtocolsProofs of KnowledgeError Bounds - Contact author(s)
- stephan krenn @ bfh ch
- History
- 2009-12-04: revised
- 2009-12-04: received
- See all versions
- Short URL
- https://ia.cr/2009/595
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/595, author = {Endre Bangerter and Jan Camenisch and Stephan Krenn}, title = {Efficiency Limitations for $\Sigma$-Protocols for Group Homomorphisms}, howpublished = {Cryptology {ePrint} Archive, Paper 2009/595}, year = {2009}, url = {https://eprint.iacr.org/2009/595} }