On the Amortized Complexity of Zero-Knowledge Protocols
暂无分享,去创建一个
[1] Jens Groth,et al. Cryptography in Subgroups of Zn , 2005, TCC.
[2] Claus-Peter Schnorr,et al. Efficient signature generation by smart cards , 2004, Journal of Cryptology.
[3] Ronald Cramer,et al. Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups , 2002, CRYPTO.
[4] Ronald Cramer,et al. Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields , 2005, CRYPTO.
[5] Ivan Damgård,et al. Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions , 2000, Public Key Cryptography.
[6] Yvo Desmedt,et al. Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group , 1994, SIAM J. Discret. Math..
[7] Yuval Ishai,et al. Scalable Secure Multiparty Computation , 2006, CRYPTO.
[8] Rafail Ostrovsky,et al. Zero-knowledge from secure multiparty computation , 2007, STOC '07.
[9] Ivan Damgård,et al. Efficient and Secure Comparison for On-Line Auctions , 2007, ACISP.
[10] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[11] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[12] Tatsuaki Okamoto,et al. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations , 1997, CRYPTO.