Adaptive Security with Quasi-Optimal Rate
暂无分享,去创建一个
[1] Chris Peikert,et al. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract , 2009, STOC '09.
[2] Silvio Micali,et al. Optimal Error Correction Against Computationally Bounded Noise , 2005, TCC.
[3] Tal Malkin,et al. Improved Non-committing Encryption with Applications to Adaptively Secure Protocols , 2009, ASIACRYPT.
[4] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[5] Damien Stehlé,et al. Classical hardness of learning with errors , 2013, STOC '13.
[6] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[7] Donald Beaver,et al. Plug and Play Encryption , 1997, CRYPTO.
[8] Moni Naor,et al. Adaptively secure multi-party computation , 1996, STOC '96.
[9] Chris Peikert,et al. Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller , 2012, IACR Cryptol. ePrint Arch..
[10] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.
[11] Rafail Ostrovsky,et al. Non-committing Encryption from Φ-hiding , 2015, TCC.
[12] Ivan Damgård,et al. Improved Non-committing Encryption Schemes Based on a General Complexity Assumption , 2000, Annual International Cryptology Conference.
[13] Kousha Etessami,et al. Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations , 2005, JACM.
[14] Chris Peikert,et al. A Toolkit for Ring-LWE Cryptography , 2013, IACR Cryptol. ePrint Arch..
[15] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[16] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.