Efficient traceable signatures in the standard model
(2009) Pairing-Based Cryptography - Pairing 2009. Third International Conference — Location: Palo Alto, CA, USA (12.August.2009)
Files
No attached file found for this publication.
Details
- Authors
- Abstract
- Traceable signatures (TS), suggested by Kiayias, Tsiounis and Yung, extend group signatures to address various basic traceability issues beyond merely identifying the anonymous signer of a rogue signature. Namely, they enable the efficient tracing of all signatures produced by a misbehaving party without opening the identity of other parties. They also allow users to provably claim ownership of a previously signed anonymous signature. To date, known TS systems all rely on the random oracle model. In this work we present the first realization of the primitive that avoids resorting to the random oracle methodology in its security proofs. Furthermore, our realization's efficiency is comparable to that of nowadays' fastest and shortest standard model group signatures.
- Affiliations
Citations
Libert, B., & Moti Yung. (2009). Efficient traceable signatures in the standard model. In Shacham, H.; Waters, B.; (ed.), Pairing-Based Cryptography - Pairing 2009. Third International Conference (p. p. 187-205). Springer verlag. https://hdl.handle.net/2078.5/222807