On the Amortized Complexity of Zero-Knowledge Protocols
暂无分享,去创建一个
[1] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[2] Ivan Damgård,et al. Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions , 2000, Public Key Cryptography.
[3] Hao Chen,et al. Secure Computation from Random Error Correcting Codes , 2007, EUROCRYPT.
[4] Ronald Cramer,et al. Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields , 2005, CRYPTO.
[5] Bart Preneel. Advances in cryptology - EUROCRYPT 2000 : International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000 : proceedings , 2000 .
[6] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..
[7] Jens Groth,et al. Cryptography in Subgroups of Zn , 2005, TCC.
[8] Fabrice Boudot,et al. Efficient Proofs that a Committed Number Lies in an Interval , 2000, EUROCRYPT.
[9] Justin M. Reyneri,et al. Coin flipping by telephone , 1984, IEEE Trans. Inf. Theory.
[10] Avi Wigderson,et al. On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[11] John B. Shoven,et al. I , Edinburgh Medical and Surgical Journal.
[12] Ivan Damgård,et al. Multiparty Computation from Threshold Homomorphic Encryption , 2000, EUROCRYPT.
[13] Ivan Damgård,et al. Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge be for Free? , 1997 .
[14] Matthew K. Franklin,et al. Communication complexity of secure computation (extended abstract) , 1992, STOC '92.
[15] Claus-Peter Schnorr,et al. Efficient signature generation by smart cards , 2004, Journal of Cryptology.
[16] Donald Beaver,et al. Efficient Multiparty Protocols Using Circuit Randomization , 1991, CRYPTO.
[17] Silvio Micali,et al. The knowledge complexity of interactive proof-systems , 1985, STOC '85.
[18] Ivan Damgård,et al. A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order , 2002, ASIACRYPT.
[19] Ronald Cramer,et al. Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups , 2002, CRYPTO.
[20] Yuval Ishai,et al. Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography , 2010, IACR Cryptol. ePrint Arch..
[21] Yvo Desmedt,et al. Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group , 1994, SIAM J. Discret. Math..
[22] Yuval Ishai,et al. Scalable Secure Multiparty Computation , 2006, CRYPTO.
[23] Ueli Maurer,et al. General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.
[24] Rafail Ostrovsky,et al. Zero-Knowledge Proofs from Secure Multiparty Computation , 2009, SIAM J. Comput..
[25] Rafail Ostrovsky,et al. Zero-knowledge from secure multiparty computation , 2007, STOC '07.
[26] Hao Chen,et al. Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields , 2006, CRYPTO.
[27] Rafail Ostrovsky,et al. Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority , 2012, CRYPTO.
[28] Tatsuaki Okamoto,et al. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations , 1997, CRYPTO.
[29] Ivan Damgård,et al. Semi-Homomorphic Encryption and Multiparty Computation , 2011, IACR Cryptol. ePrint Arch..
[30] Ivan Damgård,et al. Multiparty Computation from Somewhat Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..
[31] Ivan Damgård,et al. Efficient Multiparty Computations Secure Against an Adaptive Adversary , 1999, EUROCRYPT.
[32] Mihir Bellare,et al. On Probabilistic versus Deterministic Provers in the Definition of Proofs Of Knowledge , 2006, IACR Cryptol. ePrint Arch..
[33] Rafail Ostrovsky,et al. Perfect zero-knowledge in constant rounds , 1990, STOC '90.
[34] Ivan Damgård,et al. Efficient and Secure Comparison for On-Line Auctions , 2007, ACISP.
[35] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[36] Ivan Damgård,et al. Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free? , 1998, CRYPTO.
[37] Ivan Damgård,et al. On the Amortized Complexity of Zero-Knowledge Protocols , 2009, CRYPTO.