Threshold RSA for dynamic and Ad-Hoc groups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4965 LNCS, Issue , 2008, Pages 88-107

  Gennaro, Rosario ^a   Halevi, Shai ^a   Krawczyk, Hugo ^a   Rabin, Tal ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK PROTOCOLS; STEREOPHONIC BROADCASTING;

AD-HOC GROUPS; DYNAMIC GROUPS; THRESHOLD SIGNATURES;

AD HOC NETWORKS;

EID: 44449121781     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78967-3_6     Document Type: Conference Paper

References (26)

1. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Noncryp-tographic Fault-Tolerant Distributed Computations. In: Proc. 20th STOC, pp. 1-10. ACM Press, New York (1988)
2. Blakley, G.R.: Safeguarding cryptographic keys. In: Proc. AFIPS 1979 National Computer Conference, AFIPS, pp. 313-317. (1979)
3. Boyd, C.: Digital Multisignatures. In: Baker, H., Piper, F. (eds.) Cryptography and Coding, pp. 241-246. Claredon Press, Oxford (1989)
4. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: 1st ACM Conference on Computer and Communications Security, pp. 62-73 (1993)
5. Croft, R.A., Harris, S.P.: Public-key cryptography and re-usable shared secrets. In: Baker, H., Piper, F. (eds.) Cryptography and Coding, pp. 189-201. Claredon Press, Oxford (1989)
6. Cerecedo, M., Matsumoto, T., Imai, H.: Efficient and secure multiparty generation of digital signatures based on discrete logarithms. IEICE Trans. Fundamentals E76-A(4), 532-545 (1993)
7. Coron, J.-S.: On the Exact Security of Full Domain Hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 229-235. Springer, Heidelberg (2000)
8. De Santis, A., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: Proc. 26th STOC, pp. 522-533. ACM Press, New York (1994)
9. Desmedt, Y.: Society and group oriented cryptography: A new concept. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 120-127. Springer, Heidelberg (1988)
10. Desmedt, Y.G.: Threshold cryptography. European Transactions on Telecommunications 5(4), 449-457 (1994)
11. Desmedt, Y., Frankel, Y.: Shared generation of authenticators and signatures. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 457-469. Springer, Heidelberg (1992)
12. Fazio, N.: Personal Communication (September 2007)
13. Frankel, Y., Gemmell, P., Mackenzie, P., Yung, M.: Proactive RSA. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 440-454. Springer, Heidelberg (1997)
14. Frankel, Y., Gemmell, P., Yung, M.: Witness-based Cryptographic Program Checking and Robust Function Sharing. In: Proc. 28th STOC, pp. 499-508. ACM Press, New York (1996)
15. Gennaro, R., Halevi, S., Krawczyk, H., Rabin, T.: Threshold RSA for Dynamic and Ad-Hoc Groups. Full version, http://eprint.iacr.org/2008/045
16. Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust and efficient sharing of RSA functions. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 157-172. Springer, Heidelberg (1996)
17. Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Robust Threshold DSS Signatures. Information and Computation 164(1), 54-84 (2001); Extended abstract in EUROCRYPT 1996
18. Gennaro, R., Krawczyk, H., Rabin, T.: RSA-based Undeniable Signatures. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 397-416. Springer, Heidelberg (1997);
19. Final version in J. Cryptology 13(4), 397-416 (2000)
20. Gennaro, R., Krawczyk, H., Rabin, T.: Robust and Efficient Sharing of RSA Functions. Journal of Cryptology 13(2), 273-300 (2000); Conference version [16]
21. Goldwasser, S., Micali, S., Rivest, R.L.: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Computing 17(2), 281-308 (1988)
22. Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Communication of the ACM 21(2), 120-126 (1978)
23. Shamir, A.: How to Share a Secret. Communications of the ACM 22, 612-613 (1979)
24. Shamir, A.: On the Generation of Cryptographically Strong Pseudorandom Sequences. ACM Trans. Comput. Syst. 1(1), 38-44 (1983)
25. Shoup, V.: Practical threshold signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207-220. Springer, Heidelberg (2000)
26. Saxena, N., Tsudik, G., Yi, J.H.: Efficient node admission for short-lived mobile ad hoc networks. In: ICNP, 13th IEEE International Conference on Network Protocols, pp. 269-278 (2005)