Leakproof secret sharing protocols with applications to group identification scheme
作者： ChunMing Tang , ShuHong Gao
DOI: 10.1007/S11432-011-4480-8
关键词:
摘要: In a traditional ( t, n )-threshold secret sharing scheme, t or more honest participants can reconstruct the K. reconstruction process, individual shares and key K are revealed, hence is shared once only. this paper, we firstly give definition of leakproof scheme which composed distribution protocol proof protocol, then propose two protocols, computationally secure an information-theoretically protocol. our jointly prove that they hold by using multi-prover zero-knowledge argument knowledge. As result, will be for as many times desired. Furthermore, each participant detect dealer in from cheating, any verifier prevent non-qualified set cheating. example practical impact work use techniques to construct group identification schemes with zero-knowledge.
sciengine.com
springer.com参考文章(38)
Amitabh Saxena, Ben Soh, Serguey Priymak, Zero-Knowledge Blind Identification For Smart Cards Using Bilinear Pairings. IACR Cryptology ePrint Archive. ,vol. 2005, pp. 343- ,(2005)
Mihir Bellare, Oded Goldreich, On Defining Proofs of Knowledge international cryptology conference. pp. 390- 420 ,(1992) , 10.1007/3-540-48071-4_28
R. Canetti, Universally composable security: a new paradigm for cryptographic protocols international conference on cluster computing. pp. 136- 145 ,(2001) , 10.1109/SFCS.2001.959888
Alon Rosen, A Note on the Round-Complexity of Concurrent Zero-Knowledge international cryptology conference. pp. 451- 468 ,(2000) , 10.1007/3-540-44598-6_28
Ivan Damgård, Efficient concurrent zero-knowledge in the auxiliary string model theory and application of cryptographic techniques. pp. 418- 430 ,(2000) , 10.1007/3-540-45539-6_30
Ran Canetti, Rosario Gennaro, Stanisław Jarecki, Hugo Krawczyk, Tal Rabin, Adaptive Security for Threshold Cryptosystems international cryptology conference. pp. 98- 115 ,(1999) , 10.1007/3-540-48405-1_7
Amos Fiat, Adi Shamir, How to prove yourself: practical solutions to identification and signature problems international cryptology conference. ,vol. 263, pp. 186- 194 ,(1987) , 10.1007/3-540-47721-7_12
Ransom Richardson, Joe Kilian, On the concurrent composition of zero-knowledge proofs theory and application of cryptographic techniques. pp. 415- 431 ,(1999) , 10.1007/3-540-48910-X_29
J. Kilian, E. Petrank, C. Rackoff, Lower bounds for zero knowledge on the Internet foundations of computer science. pp. 484- 492 ,(1998) , 10.1109/SFCS.1998.743499
C. P. Schnorr, Efficient Identification and Signatures for Smart Cards international cryptology conference. pp. 239- 252 ,(1989) , 10.1007/0-387-34805-0_22