Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
暂无分享,去创建一个
Stephan Krenn | Abhishek Jain | Krzysztof Pietrzak | Aris Tentes | Krzysztof Pietrzak | Abhishek Jain | S. Krenn | Aris Tentes
[1] David Cash,et al. Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems , 2009, CRYPTO.
[2] Ernest F. Brickell,et al. Advances in Cryptology — CRYPTO’ 92 , 2001, Lecture Notes in Computer Science.
[3] Yael Tauman Kalai,et al. Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[4] Yannick Seurin,et al. How to Encrypt with the LPN Problem , 2008, ICALP.
[5] Jacques Stern,et al. A New Identification Scheme Based on Syndrome Decoding , 1993, CRYPTO.
[6] Aggelos Kiayias,et al. Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.
[7] Sidi Mohamed El Yousfi Alaoui,et al. A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem , 2010, Selected Areas in Cryptography.
[8] Vinod Vaikuntanathan,et al. Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE , 2012, EUROCRYPT.
[9] Daniele Micciancio,et al. Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions , 2011, CRYPTO.
[10] Michael Kearns,et al. Efficient noise-tolerant learning from statistical queries , 1993, STOC.
[11] Amit Sahai,et al. Efficient Non-interactive Proof Systems for Bilinear Groups , 2008, EUROCRYPT.
[12] Jonathan Katz,et al. Parallel and Concurrent Security of the HB and HB+ Protocols , 2006, Journal of Cryptology.
[13] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[14] Rafail Ostrovsky,et al. Minimum Resource Zero-Knowledge Proofs (Extended Abstract) , 1989, CRYPTO.
[15] Ivan Damgård,et al. Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs , 1995, CRYPTO.
[16] Josef Pieprzyk,et al. Advances in Cryptology - ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings , 2008, ASIACRYPT.
[17] Shai Halevi. Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings , 2009, CRYPTO.
[18] Ari Juels,et al. Authenticating Pervasive Devices with Human Protocols , 2005, CRYPTO.
[19] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.
[20] Ronald Cramer,et al. Modular Design of Secure yet Practical Cryptographic Protocols , 1997 .
[21] Ivan Damgård,et al. Linear zero-knowledge—a note on efficient zero-knowledge proofs and arguments , 1997, STOC '97.
[22] Silvio Micali,et al. Computationally Sound Proofs , 2000, SIAM J. Comput..
[23] Pascal Véron,et al. Improved identification schemes based on error-correcting codes , 2009, Applicable Algebra in Engineering, Communication and Computing.
[24] Cynthia Dwork,et al. Advances in Cryptology – CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III , 2020, Annual International Cryptology Conference.
[25] Colin Boyd,et al. Advances in Cryptology - ASIACRYPT 2001 , 2001 .
[26] Ivan Damgård,et al. Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge be for Free? , 1997 .
[27] Jonathan Katz,et al. Parallel and Concurrent Security of the HB and HB+ Protocols , 2006, EUROCRYPT.
[28] Michael Wiener,et al. Advances in Cryptology — CRYPTO’ 99 , 1999 .
[29] Rafail Ostrovsky,et al. Zero-knowledge from secure multiparty computation , 2007, STOC '07.
[30] Hao Chen,et al. Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields , 2006, CRYPTO.
[31] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[32] Elwyn R. Berlekamp,et al. On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[33] Nigel P. Smart,et al. Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008. Proceedings , 2008, EUROCRYPT.
[34] Elisabeth Oswald,et al. A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework , 2011, CRYPTO.
[35] I. Damgård,et al. The protocols. , 1989, The New Zealand nursing journal. Kai tiaki.
[36] Manuel Blum,et al. Secure Human Identification Protocols , 2001, ASIACRYPT.
[37] Kenneth G. Paterson. Advances in Cryptology - EUROCRYPT 2011 - 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, May 15-19, 2011. Proceedings , 2011, EUROCRYPT.
[38] Douglas R. Stinson,et al. Advances in Cryptology — CRYPTO’ 93 , 2001, Lecture Notes in Computer Science.
[39] Victor Shoup. Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings , 2005, CRYPTO.
[40] Joe Kilian,et al. A note on efficient zero-knowledge proofs and arguments (extended abstract) , 1992, STOC '92.
[41] Yuval Ishai,et al. Cryptography with Constant Input Locality , 2007, Journal of Cryptology.
[42] Joe Kilian,et al. An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions , 1998, Journal of Cryptology.
[43] Pierre-Louis Cayrel,et al. Improved Zero-Knowledge Identification with Lattices , 2010, ProvSec.
[44] Keisuke Tanaka,et al. Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems , 2008, ASIACRYPT.
[45] Stephan Krenn,et al. Commitments and Efficient Zero-Knowledge Proofs from Hard Learning Problems , 2012, IACR Cryptol. ePrint Arch..
[46] Hugo Krawczyk,et al. Advances in Cryptology - CRYPTO '98 , 1998 .
[47] Ivan Damgård,et al. Zero-Knowledge Proofs for Finite Field Arithmetic; or: Can Zero-Knowledge be for Free? , 1998, CRYPTO.
[48] Richard J. Lipton,et al. Cryptographic Primitives Based on Hard Learning Problems , 1993, CRYPTO.
[49] Marcel Keller,et al. On the Amortized Complexity of Zero-Knowledge Protocols , 2009, Journal of Cryptology.
[50] Rafail Ostrovsky,et al. Minimum resource zero-knowledge proofs (extended abstracts) , 1989, CRYPTO 1989.
[51] Mihir Bellare,et al. On Defining Proofs of Knowledge , 1992, CRYPTO.