A ROBUST THRESHOLD ELLIPTIC CURVE DIGITAL SIGNATURE PROVIDING A NEW VERIFIABLE SECRET SHARING SCHEME

Midwest Symposium on Circuits and Systems

Volumn 1, Issue , 2003, Pages 276-280

  Ibrahim, Maged H ^a   Ali, I A ^a   Ibrahim, I I ^a   El Sawi, A H ^a  

^a HELWAN UNIVERSITY   (Egypt)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; PUBLIC KEY CRYPTOGRAPHY;

CARDINALITIES; DIGITAL SIGNATURE SCHEMES; ELLIPTIC CURVE; ELLIPTIC CURVE DIGITAL SIGNATURE; GROUP SIGNATURE SCHEME; MALICIOUS ADVERSARIES; SECRET KEY; THRESHOLD DIGITAL SIGNATURES; THRESHOLD-VALUE; VERIFIABLE SECRET SHARING SCHEME;

GEOMETRY;

EID: 85150432710     PISSN: 15483746     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MWSCAS.2003.1562272     Document Type: Conference Paper

References (27)

1. P. Feldman. A practical scheme for non-interactive veri able secret sharing. Proc. of the 28th IEEE Symp. on the Found. of Computer Science. IEEE Press, pp. 427-437 (1987).
2. T. P. Pedersen. Non-interactive and information-theoretic secure veriable secret sharing. In J. Feigenbaum, editor, Proceedings CRYPTO '91, pages 129-140. Springer, 1992. Lecture Notes in Computer Science No. 576.
3. N. Koblitz, An Elliptic Curve Implementation of the Finite Field Digital Signature Algorithm. In: Advances in Cryptology - Crypto '98. Lecture Notes in Computer Science, Vol. 1462. Springer-Verlag, Berlin Heidelberg New York (1998) 327-337
4. A. J. Menezes, T. Okamoto, and S. A. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Trans. Inform. Theory, 39 (1993), pp. 1639-1646
5. R. Schroeppel, H-. Ormani, and S. O'Malley. Fast key exchange with elliptic curve systems. Technical Report 95-03, Department of Computer Science, University ofArizona, Feb. 1995.
6. G. B. Agnew, R. C. Mullin, and S. A. Vanstone, "An Implementation of Elliptic Curve Cryptosystems over F 2-155 ", IEEE Journal onl SelectedAreas in Commutnications, Vol. I1, No. 5, June, 1993.
7. N. Koblitz, Elliptic curve cryptosystems, Math. Comp. 48, pp. 203-209, 1987
8. V.S. Miller, Use of Elliptic Curve in Cryptography, In Advances in CryptologyCRYPTO '85(Santa Barbara, Calif., 1985), LNCS.2 18, Spring- Verlag, pp.417-426, 1986.
9. A. Shamir. How to Share a Secret. Communications of the ACM, 22(11), pp. 612-613, November 1979.
10. Y. Desmedt and Y. Frankel, Shared generation of authenticators and signatures," In Advances in CryptologylCRYPTO '91, volume 576 of Lecture Notes in Computer Science pages 457-469, Springer-Verlag, 1992.
11. A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. In 26th Annual ACM Symposium on Theory of Computing, pages 522-533, 1994.
12. M. Cerecedo, T. Matsumoto, and H. Imai. Efficient and secure multiparty generation of digital signatures based on discrete logarithm. IEICE Trans. on Fund. Electr. Comm. and Comp. Sci., E76- A(4):532-545, 1993.
13. L. Ham, "Group-oriented (t,n) threshold digital signature scheme and digital multisignature ", IEE Proc.-Comput. Digit. Tech., Vol. 141, No. 5, September, (1994), pp. 307-313.
14. Langford, Threshold DSS Signatures without a Trusted Party, Proc. CR YPTO'95, LNCS 963, Springer- Verlag, 1995.
15. R. Gennaro, Theory and Practice of Verifiable Secret Sharing. PhD thesis, Massachusetts Institute of Technology (MIT), May 1996.
16. R. Gennaro, M. O. Rabin, and T. Rabin. Simplified VSS and fasttrack multiparty computations with applications to threshold cryptography. In Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC), 1998.
17. R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin, "Robust Threshold DSS Signatures", Advances in Cryptology: Proc. Eurocrypt'96, Lecture Notes in Computer Science 1070, Springer, (1996), pp. 354-371.
18. A. Boldyreva, "Threshold Signature, Multisignature and Blind Signature Schemes Based on the Gap-Diffie-Hellman-group Signature Scheme", Public Key Cryptography - PKC 2003.
19. T. El Gamal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Informn. Theory 31:469-472, 1985.
20. C. P. Schnorr, Efficient signature generation by smart cards, Journal ofCryptology4:161-174, 1991.
21. J. Bar-Ilan, and D. Beaver, "Non-Cryptographic Fault-Tolerant Computing in a Constant Number ofRounds", Proc. of8th PODC, pp. 201-209, 1989.
22. E. Berlekamp and L. Welch. Error Correction of Algebraic Block Codes. US Patent Number 4,633,470.
23. M. Ben-Or, S. Goldwasser and A. Wigderson, "Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation", 20th STOC, pp. 1-10, 1988.
24. T. Rabin and M. Ben-Or. "Verifiable secret sharing and multiparty protocols with honest majority". In Proc. 21st ACM Symposium on Theory ofComputing, pages 73-85, 1989.
25. A.Herzberg, S.Jarecki, H.Krawczyk, M.Yung, "Proactive secret sharing or: How to cope with perpetual leakage", LNCS 963, Proc. Crypto'95, Springer Verlag, (1995), pp. 339-352.
26. J.C. Benaloh, "Secret sharing homomorphisms: Keeping a secret secret"; Proc. of Crypto '86, Lecture Notes on Comput. Sci., 263 Springer Verlag (1986) 251-260.
27. J.C. Benaloh, "Secret sharing homomorphisms: Keeping a secret secret"; Proc. of Crypto '86, Lecture Notes on Comput. Sci., 263 Springer Verlag (1986) 251-260.