A proactive secret sharing scheme in matrix projection method

International Journal of Security and Networks

Volumn 4, Issue 4, 2009, Pages 201-209

  Bai, Li ^a   Zou, XuKai ^b  

^a Temple University   (United States)

^b IN 46202 USA   (United States)

Author keywords

Cryptography; Matrix projection; Pythagorean triples

Indexed keywords

CRYPTOGRAPHY; ELECTRICAL ENGINEERING; NETWORK SECURITY;

MATRIX PROJECTION; MULTIPLE SECRET SHARING; PAST AND PRESENT; PROACTIVE SECRET SHARING; PROACTIVE SECRET SHARING SCHEMES; PYTHAGOREAN TRIPLES; SECRET SHARING SCHEMES;

COMPUTER NETWORKS;

EID: 70349969846     PISSN: 17478405     EISSN: 17478413     Source Type: Journal    
DOI: 10.1504/IJSN.2009.028667     Document Type: Article

References (15)

1. Bai, L. (2006) 'A strong ramp secret sharing scheme using matrix projection', Second International Workshop on Trust, Security and Privacy for Ubiquitous Computing, Niagara-Falls, Buffalo, NY, pp.652-656.
2. Beimel, A. and Chor, B. (1998) 'Secret sharing with public reconstruction', IEEE Trans. Inform. Theory, Vol. 44, pp.1887-1896.
3. Ben-Or, M., Goldwasser, S. and Wigderson, A. (1988) 'Completeness theorems for non-cryptographic faulttolerant distributed computation', Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 2-4 May, Chicago, Illinois, pp.1-10.
4. Blakley, G. (1979) 'Safeguarding cryptographic keys', Proceedings of the AFIPS 1979 National Computer Conference, June, Arlington, VA, Vol. 48, pp.313-317.
5. Feldman, P. (1987) 'A practical scheme for non-interactive verifiable secret sharing', Proceedings of the 28th IEEE Symposium on Foundations of Computer Science (FOCS' 87), 12-14 October, IEEE Computer Society, Los Angeles, California, pp.427-437.
6. Goldreich, O., Micali, S. and Wigderson, A. (1987) 'How to play any mental game or a completeness theorem for protocols with honest majority', Proceedings of the Nineteen Annual ACM Symposium on Theory of Computing, New York City, NY, pp.218-219.
7. Herzberg, A., Jarecki, S., Krawczyk, H. and Yung, M. (1995) 'Proactive secret sharing or: How to cope with perpetual leakage', in Don Coppersmith (Ed.): Advances in Cryptology - Crypto '95, August, Santa Barbara, CA, pp.339-352.
8. Karnin, E.D., Greene, J.W. and Hellman, M.E. (1983) 'On secret sharing systems', IEEE Trans. Inform. Theory, Vol. IT-29, pp.35-41.
9. Marsh, M.A. and Schneider, F.B. (2004) 'CODEX: A robust and secure secret distribution system', IEEE Transactions on Dependable and Secure Computing, Vol. 1, pp.34-47.
10. Okada, K. and Kurosawa, K. (2000) 'MDS secret-sharing scheme secure against cheaters', IEEE Trans. Inform. Theory, Vol. 46, pp.1078-1081.
11. Pedersen, T.P. (1991) 'Non-interactive and informationtheoretic secure verifiable secret sharing', in Feigenbaum, J. (Ed.): Advances in Cryptology - Crypto'91, IACR, Springer-Verlag, University of California in Santa Barbara, 11-15 August, pp.129-140.
12. Shamir, A. (1979) 'How to share a secret', Communications of the ACM Vol. 22, pp.612-613.
13. Stinson, D.R. (1994) 'Decomposition constructions for secret-sharing schemes', IEEE Trans. Inform. Theory, Vol. 40, pp.118-125.
14. Weisstein, E.W. (2003) Pythagorean Triple - From Mathworld, May, Website at http://mathworld.wolfram.com/PythagoreanTriple.html
15. Zou, X.K., Ramamurthy, B. and Magliveras, S. (2004) Secure Group Communication over Data Networks, Springer, October, ISBN: 0387229701.