Threshold cryptography based on Asmuth-Bloom secret sharing

Information Sciences

Volumn 177, Issue 19, 2007, Pages 4148-4160

  Kaya, Kamer ^a   Selçuk, Ali Aydin ^a  

^a BILKENT UNIVERSITY   (Turkey)

Author keywords

Asmuth Bloom secret sharing; ElGamal; Function sharing schemes; Paillier; RSA; Threshold cryptography

Indexed keywords

ASMUTH-BLOOM SECRET SHARING; FUNCTION SHARING SCHEMES; PAILLIER CRYPTOSYSTEM; THRESHOLD CRYPTOGRAPHY;

ALGORITHMS; COMPUTATIONAL EFFICIENCY; INFORMATION SCIENCE; SECURITY OF DATA;

CRYPTOGRAPHY;

EID: 34447343339     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.04.008     Document Type: Article

References (26)

1. Abdalla M., Chevassut O., Fouque P.-A., and Pointcheval D. A simple threshold authenticated key exchange from short secrets. Proc. of ASIACRYPT 2005. LNCS vol. 3778 (2005), Springer-Verlag 566-584
2. Asmuth C., and Bloom J. A modular approach to key safeguarding. IEEE Trans. Informat. Theory 29 2 (1983) 208-210
3. O. Baudron, P.-A. Fouque, D. Pointcheval, G. Poupard, J. Stern, Practical multi-candidate election system, in: Proc. of PODC 2001, 20th ACM Symposium on Principles of Distributed Computing, 2001, pp. 274-283.
4. Bellare M., and Rogaway P. Optimal asymmetric encryption. Proc. of EUROCRYPT 1994. LNCS vol. 950 (1994), Springer-Verlag 92-111
5. G. Blakley, Safeguarding cryptographic keys, in: Proc. of AFIPS National Computer Conference, 1979.
6. Chu C.K., and Tzeng W.G. Optimal resilient threshold signatures. Informat. Sci. 177 8 (2007) 1834-1851
7. Cramer R., and Shoup V. Signature schemes based on the strong RSA assumption. ACM Trans. Informat. Syst. Security 3 3 (2000) 161-185
8. Desmedt Y. Some recent research aspects of threshold cryptography. Proc. of ISW '97, 1st International Information Security Workshop. LNCS vol. 1196 (1997), Springer-Verlag 158-173
9. Desmedt Y., and Frankel Y. Threshold cryptosystems. Proc. of CRYPTO'89. LNCS vol. 435 (1990), Springer-Verlag 307-315
10. Desmedt Y., and Frankel Y. Shared generation of authenticators and signatures. Proc. of CRYPTO'91. LNCS vol. 576 (1992), Springer-Verlag 457-469
11. Desmedt Y., and Frankel Y. Homomorphic zero-knowledge threshold schemes over any finite abelian group. SIAM J. Discrete Math. 7 4 (1994) 667-679
12. Ding C., Pei D., and Salomaa A. Chinese Remainder Theorem: Applications in Computing, Coding, Cryptography (1996), World Scientific
13. ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Informat. Theory 31 4 (1985) 469-472
14. Fouque P.A., Poupard G., and Stern J. Sharing decryption in the context of voting or lotteries. Proc. of FC 2000, 4th International Conference on Financial Cryptography. LNCS vol. 1962 (2001), Springer-Verlag 90-104
15. Gennaro R., Jarecki S., Krawczyk H., and Rabin T. Robust threshold DSS signatures. Informat. Comput. 164 1 (2001) 54-84
16. Huang H.F., and Chang C.C. A novel efficient (t, n) threshold proxy signature scheme. Informat. Sci. 176 10 (2006) 1338-1349
17. Lysyanskaya A., and Peikert C. Adaptive security in the threshold setting: from cryptosystems to signature schemes. Proc. of ASIACRYPT 2001. LNCS vol. 2248 (2001), Springer-Verlag 331-350
18. MacKenzie P., and Reiter M.K. Two-party generation of DSA signatures. Int. J. Informat. Security 2 3 (2004) 218-239
19. Ostrovsky R., and Skeith W. Private searching on streaming data. Proc. of CRYPTO'05. LNCS vol. 3621 (2005), Springer-Verlag 223-240
20. Ostrovsky R., and Yung M. How to withstand mobile virus attacks. Proc. of 10th ACM Symposium on the Principles of Distributed Computing (1991), ACM 51-61
21. Paillier P. Public key cryptosystems based on composite degree residuosity classes. Proc. of EUROCRYPT 1999. LNCS vol. 1592 (1999), Springer-Verlag 223-238
22. Quisquater M., Preneel B., and Vandewalle J. On the security of the secret sharing scheme based on the chinese remainder theorem. Proc. of PKC 2002. LNCS vol. 2274 (2002), Springer-Verlag 199-210
23. Rivest R., Shamir A., and Adleman L. A method for obtaining digital signatures and public key cryptosystems. Commun. ACM 21 2 (1978) 120-126
24. A. De Santis, Y. Desmedt, Y. Frankel, M. Yung, How to share a function securely? in: Proc. of STOC94, 1994, pp. 522-533.
25. Shamir A. How to share a secret?. Commun. ACM 22 11 (1979) 612-613
26. Shoup V. Practical threshold signatures. Proc. of EUROCRYPT 2000. LNCS vol. 1807 (2000), Springer-Verlag 207-220