An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

مراجع و منابع این مقاله:

• C. Benaloh and J. Leichter, Generalized Secret Sharing and Monotone ...
• V. P. Binu and A. Sreekumar, Threshold Multi Secret Sharing ...
• G. Blakley, Safeguarding cryptographic keys, in: Proc. AFIPS ۱۹۷۹ Natl. ...
• L. Chen, D. Gollman, C.J. Mitchell and P. Wild, Secret ...
• B. Chor, S. Goldwasser, S. Micali and B. Awerbuch, Veriable ...
• H. Daghigh and M. Bahramian, Generalized Jacobian and Discrete Logarithm ...
• I. Dechene, Arithmetic of generalized Jacobians,Algorithmic Number Theory Symposium ANTS ...
• L. Harn, Efficient sharing (broadcasting) of multiple secrets [J], IEE ...
• M. Ito, A. Saito, and T. Nishizeki, Secret Sharang Scheme ...
• N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, ۴۸(۱۷۷), (۱۹۸۷), ...
• D. Liu, D. Huang, P. Luo and Y. Da, New ...
• V. Miller, Use of elliptic curves in cryptography, CRYPTO, Lecture ...
• M. Rosenlicht, Generalized Jacobian varieties, Annals of Mathematics, ۵۹, (۱۹۵۴), ...
• A. Shamir, How to share a secret, Communications of the ...
• J. Shao and Z.F. Cao, A new efficient (t; n) ...
• J. H. Silverman, The arithmetic of elliptic curves, Graduate Texts ...
• L. C. Washington, Elliptic Curves: Number Theory and Cryptography, CRC ...
• C.C. Yang, T.Y. Chang and M.S. Hwang, A (t, n) ...
نمایش کامل مراجع