J. Rompel
- [BM1] Bellare, M., and Micali, S., "How to Sign Given any Trapdoor Function", Proc. 20th STOC, 1988, pp. 32-42. Google Scholar
Digital Library
- [BM2] Blum, M., and Micali, S., "How to Generate Cryptograpically Strong Sequences of Pseudo-Random Bits", SIAM J. Comp., 13:4 (Nov. 84), pp. 850-864. Google ScholarDigital Library
- [CW] Carter, J.L., and Wegman, M.N., "Universal Classes of Hash Functions", JCSS, 18 (1979), pp. 143-154.Google ScholarCross Ref
- [DH] Diffie, W., and Hellman, M., "New Directions in Cryptography", IEEE Trans. on Info. Theory, vol. IT-22, 6 (1976), pp. 644-654.Google Scholar
- [GKL] Goldreich, O., Krawczyk, H., and Luby, M., "On the Existence of Pseudorandom Generators", Proc. 29th FOCS, 1988, pp. 12-24.Google ScholarDigital Library
- [GMR] Goldwasser, S., Micali, S., and Rivest, R., "A Secure Digital Signature Scheme", SIAM J. Comp., 17:2, 1988, pp. 281-308. Google ScholarDigital Library
- [ILL] Impagliazzo, R., Levin, L., and Luby, M., "Pseudorandom Generation from One-Way Functions", Proc. 21st STOC, 1989, pp. 12- 24. Google ScholarDigital Library
- [La] Lamport, L., "Constructing Digital Signatures from One-Way Functions", SRI intl. CSL-98, Oct. 1979.Google Scholar
- [Le] Levin, L., "One-Way Functions and Pseudo-random Generators", Proc. 17th STOC, 1985, pp. 363-365. Google ScholarDigital Library
- [NY] Naor, M., and Yung, M., "Universal One-Way Hash Functions and their Cryptographic Applications", Proc. 21st STOC, 1989, pp. 33- 43. Google ScholarDigital Library
- [Y] Yao, A.C., "Theory and Applications of Trapdoor Functions", Proc. 23rd FOCS, 1982, pp. 80-91.Google Scholar
Index Terms
- One-way functions are necessary and sufficient for secure signatures
Recommendations
Strongly secure certificateless short signatures
Highlights We introduce a new efficient and secure short certificateless signature scheme. It is strongly unforgeable. The security is based on the CDH assumption. The proposed scheme is provably secure against a relatively stronger adversary. Short ...
Designated condition one-time signatures
IDCS'12: Proceedings of the 5th international conference on Internet and Distributed Computing SystemsIn this paper, a new notion of designated condition one-time signatures (DCOTS) is proposed. For a DCOTS scheme, the signer can generate at most one signature for each condition. For example, the signer can generate at most one signature for each day. ...
Forward-Secure Multi-signatures
ICDCIT '08: Proceedings of the 5th International Conference on Distributed Computing and Internet TechnologyIn many applications a document needs to be signed by more than one signer. When a signature depends on more than one signer we call it a multi-signature. Further, ordinary digital signatures have an inherent weakness: if the secret key is leaked, then ...
Comments