An Efficient Group Signature Scheme without Random Oracles

@article{Shaohui2007AnEG,
  title={An Efficient Group Signature Scheme without Random Oracles},
  author={Wang Shao-hui and Wang Mei-qin},
  journal={2007 International Conference on Computational Intelligence and Security Workshops (CISW 2007)},
  year={2007},
  pages={807-810}
}
In this paper, we give an efficient short constant-size group signature scheme that is secure in standard model based on strong Diffie-Hellman assumption. We achieve this result by combining a variant signature scheme of the one presented by Okamoto and non-interactive zero knowledge proof used by Boyen and Waters. Compared with the most efficient group signature scheme without random oracle, our scheme has a much shorter public key length and signature length, and needs less computation. 

Citations

Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

Modification and Improvement on Group Signature Scheme without Random Oracles

  • Shaohui Wang
  • Computer Science
  • 2008 International Symposium on Electronic Commerce and Security
  • 2008
VIEW 12 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Security Analysis and their Improvement of Two Signature Schemes

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 17 REFERENCES

Full-Domain Subgroup Hiding and Constant-Size Group Signatures

VIEW 12 EXCERPTS
HIGHLY INFLUENTIAL

Compact Group Signatures Without Random Oracles

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Evaluating 2-DNF Formulas on Ciphertexts

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Perfect Non-interactive Zero Knowledge for NP

VIEW 1 EXCERPT

Short Group Signatures

VIEW 1 EXCERPT