Abstract
The commonly used technique for cheating detection in verifiable secret sharing (VSS) require public key systems. Based on linear integer secret sharing (LISS) scheme, this paper presents a private verifiable protocol over arbitrary access structure without public key systems, which can avoid cheating both from participants and dealers. For further consideration of share refreshing and renewal, this paper shows the proactive property of our scheme with new method. Furthermore, this paper applies combinatorial structure into the proactive scheme to reduce the time of the computation.
Chapter PDF
Similar content being viewed by others
References
Blackley, G.R.: Safeguarding cryptographic keys. In: AFIPS 1979, pp. 313–317 (1979)
Shamir, A.: How to Share a Secret. Commun. ACM 22(11), 612–613 (1979)
Damgard, I., Thorbek, R.: Linear Integer Secret Sharing and Distributed Exponentiation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol. 3958, pp. 75–90. Springer, Heidelberg (2006)
Benaloh, J.C., Leichter, J.: Generalizad Secret Sharing and Monotone Functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27–35. Springer, Heidelberg (1990)
Cramer, R., Fehr, S.: Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 272–287. Springer, Heidelberg (2002)
Chor, B., Kushilevitz, E.: Secret Sharing Over Infinite Domains. In: Cryptology 1993, vol. 6(2), pp. 87–95 (1993)
Chor, B., Mihály Geréb, G., Kushilevitz, E.: Private Computations over the Intergers. SIAM J. Comput. 24(2), 376–386 (1995)
Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: ACM Symposium on principles of distributed computing 1991, pp. 51–59 (1991)
Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: How to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339–352. Springer, Heidelberg (1995)
Feldman, P.: A Practical Scheme of Non-Interactive Verifiable Secret sharing. In: 28th Annual Symp. on the Foundations of Computing Science 1987, pp. 427–437 (1987)
Pedersen, T.P.: Non-interactive and information-theoretic secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992)
Rees, R.S., Stinson, D.R., Wei, R., Rees, G.H.J.V.: An application of covering designs:determining the maximum consistent set of shares in a threshold scheme. In: Ars Combinatoria 1999. LNCS, vol. 531, pp. 225–237. Springer, Heidelberg (1999)
Damgard, I., Thorbek, R.: Linear Integer Secret Sharing and Distributed Exponentiation(full version). The Eprint archive, http://www.iacr.org
Stinson, D.R., Wei, R.: Unconditionally Secure Proactive Secret Sharing Scheme with Combinatorial Structures. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol. 1758, pp. 200–214. Springer, Heidelberg (2000)
Alon, N., Gail, Z., Yung, M.: Efficient dynamic-resharing “verfiable secret sharing” against mobile adversary. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol. 979, pp. 523–537. Springer, Heidelberg (1995)
Boppana, R.B.: Amplification of Probabilistic Boolean Formulas. In: Advances in Computing Research 1989, pp. 27–45 (1989)
Santis, A.D., Desmedt, Y., Frankel, Y., Yung, M.: How to share a function securely. In: STOC 1994, pp. 522–533 (1994)
Shoup, V.: Practical Threshold Signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207–220. Springer, Heidelberg (2000)
Gordon, D.M., Kuperberg, G., Patashnik, O.: New constructions for covering design. J. Combin. Designs 3, 269–284 (1995)
Stinson, D.R.: Cryptography Theory and Practice. CRC Press, Inc., Boca Raton (1995)
Ghodosi, H., Pieprzyk, J.: Cheating Prenvention in Secret Sharing. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 328–341. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, C., Ding, X. (2009). Proactive Verifiable Linear Integer Secret Sharing Scheme. In: Qing, S., Mitchell, C.J., Wang, G. (eds) Information and Communications Security. ICICS 2009. Lecture Notes in Computer Science, vol 5927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11145-7_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-11145-7_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11144-0
Online ISBN: 978-3-642-11145-7
eBook Packages: Computer ScienceComputer Science (R0)