Abstract
We construct a short group signature which is proven secure without random oracles. By making certain reasonable assumptions and applying the technique of non-interactive proof system, we prove that our scheme is full anonymity and full traceability. Compared with other related works, such as BW06 [9], BW07 [10], ours is more practical due to the short size of both public key and group signature. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Liang, X., Cao, Z., Shao, J., & Lin, H. (2007). Short group signature without random oracles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4861 LNCS, pp. 69–82). Springer Verlag. https://doi.org/10.1007/978-3-540-77048-0_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
