Efficient publicly verifiable secret sharing with correctness, soundness and ZK privacy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5932 LNCS, Issue , 2009, Pages 118-132

  Peng, Kun ^a   Bao, Feng ^a  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

Author keywords

Honest verifier ZK; Long challenge; Public share verification; PVSS

Indexed keywords

HONEST-VERIFIER ZK; INDEPENDENT VALUES; PUBLICLY VERIFIABLE SECRET SHARING; RECOVERY FUNCTIONS; SECRET SHARING SCHEMES; ZERO KNOWLEDGE;

NETWORK SECURITY;

EID: 76649084242     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10838-9_10     Document Type: Conference Paper

References (15)

1. Bellare, M., Goldwasser, S.: Verifiable partial key escow. In: ACCCS 1997, pp. 78-91 (1997)
2. Boudot, F., Traore, J.: Efficient public verifiable secret sharing schemes with fast or delayed recovery. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol. 1726, pp. 87-102. Springer, Heidelberg (1999)
3. DeLaurentis, J.: A futher weakness in the common modulus protocol for the rsa cryptoalgorithm. Cryptologia 8, 253-259 (1984)
4. Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186-194. Springer, Heidelberg (1987)
5. Fujisaki, E., Okamoto, T.: A practical and provably secure scheme for publicly verifiable secret sharing and its applications. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 32-46. Springer, Heidelberg (1998)
6. Mao, W.: Guaranteed correct sharing of integer factorization with off-line share-holders. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol. 1431, p. 60. Springer, Heidelberg (1998)
7. Miller, G.: Riemann's hypothesis and tests for primality. Journal of Computer and System Science 13, 300-317 (1976)
8. Paillier, P.: Public key cryptosystem based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223-238. Springer, Heidelberg (1999)
9. Pedersen, T.: Distributed provers with applications to undeniable signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 221-242. Springer, Heidelberg (1991)
10. Pedersen, T.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 129-140. Springer, Heidelberg (1991)
11. Pedersen, T.: Distributed Provers and Verifiable Secret Sharing Based on the Discrete Logarithm Problem. PhD thesis, Computer Science Department, Aarhus University, Aarhus, Denmark (1992)
12. Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 149-164. Springer, Heidelberg (1999)
13. Shamir, A.: How to share a secret. Communication of the ACM 22(11), 612-613 (1979)
14. Stadler, M.: Publicly verifiable secret sharing. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 190-199. Springer, Heidelberg (1996)
15. Young, A., Yung, M.: Auto-recoverable auto-certifiable cryptosystems. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 17-31. Springer, Heidelberg (1998)