Factorization-Based Fail-Stop Signatures Revisited-Reference-Cited by-同舟云学术

Factorization-Based Fail-Stop Signatures Revisited

Published:2004 Issue: Volume: Page:118-131
ISSN:0302-9743
Container-title:Information and Communications Security
language:
Short-container-title:

Author:

Schmidt-Samoa Katja

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30191-2_10.pdf

Reference21 articles.

1. Adleman, L., McCurley, K.S.: Open problems in number-theoretic complexity ii. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol. 877, pp. 291–322. Springer, Heidelberg (1994)

2. Boneh, D., Durfee, G., Howgrave-Graham, N.: Factoring N = p’q for large r. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 326–337. Springer, Heidelberg (1999)

3. Baric, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 366–377. Springer, Heidelberg (1997)

4. Bleumer, G., Pfitzmann, B., Waidner, M.: A remark on signature scheme where forgery can be proved. In: Damgård, I.B. (ed.) EUROCRYPT 1990. LNCS, vol. 473, pp. 441–445. Springer, Heidelberg (1991)

5. Fujisaki, E., Kobayashi, T., Morita, H., Oguro, H., Okamoto, T., Okazaki, S., Pointcheval, D., Uchiyarna, S.: EPOC: Efficient probabilistic public-key encryption

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Fail-Stop Group Signature Scheme;Security and Communication Networks;2021-02-08

2. On Fail-Stop Signature Schemes with H-EUC Security;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2019-01-01

3. A Short Fail-Stop Signature Scheme from Factoring;Provable Security;2014

4. Efficient Fail-Stop Signatures from the Factoring Assumption;Lecture Notes in Computer Science;2011

5. One-Time Signatures and Chameleon Hash Functions;Selected Areas in Cryptography;2011