Strongly Unforgeable Signatures Based on Computational Diffie-Hellman

@inproceedings{Boneh2006StronglyUS,
  title={Strongly Unforgeable Signatures Based on Computational Diffie-Hellman},
  author={Dan Boneh and Emily Shen and Brent Waters},
  booktitle={Public Key Cryptography},
  year={2006}
}
A signature system is said to be strongly unforgeable if the signature is existentially unforgeable and, given signatures on some message m the adversary cannot produce a new signature on m. Strongly unforgeable signatures are used for constructing chosen ciphertext secure systems and group signatures. Current efficient constructions in the standard model (i.e. without random oracles) depend on relatively strong assumptions such as Strong-RSA or Strong-Diffie-Hellman. We construct an efficient… CONTINUE READING
Highly Influential
This paper has highly influenced 25 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 101 extracted citations

Similar Papers

Loading similar papers…