暂无分享,去创建一个
[1] Aggelos Kiayias,et al. A Little Honesty Goes a Long Way - The Two-Tier Model for Secure Multiparty Computation , 2015, TCC.
[2] Ueli Maurer,et al. From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes , 2015, TCC.
[3] Ernie Croot,et al. A Probabilistic Technique for Finding Almost-Periods of Convolutions , 2010, 1003.2978.
[4] Alex Samorodnitsky,et al. Low-degree tests at large distances , 2006, STOC '07.
[5] J. Marcinkiewicz,et al. Quelques théorèmes sur les fonctions indépendantes , 1938 .
[6] Silvio Micali,et al. Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering , 2004, TCC.
[7] Yevgeniy Dodis,et al. Non-malleable Reductions and Applications , 2015, Electron. Colloquium Comput. Complex..
[8] Silas Richelson,et al. Textbook non-malleable commitments , 2016, STOC.
[9] Shachar Lovett,et al. An Exposition of Sanders' Quasi-Polynomial Freiman-Ruzsa Theorem , 2015, Theory Comput..
[10] Yevgeniy Dodis,et al. Non-malleable Encryption: Simpler, Shorter, Stronger , 2016, Journal of Cryptology.
[11] Vipul Goyal,et al. Block-wise Non-Malleable Codes , 2016, IACR Cryptol. ePrint Arch..
[12] Yael Tauman Kalai,et al. Cryptography with Tamperable and Leaky Memory , 2011, CRYPTO.
[13] Nico Döttling,et al. Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model , 2017, Electron. Colloquium Comput. Complex..
[14] Shachar Lovett,et al. New Bounds for Matching Vector Families , 2014, SIAM J. Comput..
[15] Stefan Dziembowski,et al. Non-Malleable Codes , 2018, ICS.
[16] Shachar Lovett,et al. Affine-malleable extractors, spectrum doubling, and application to privacy amplification , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).
[17] Imre Z. Ruzsa,et al. An analog of Freiman's theorem in groups , 1993 .
[18] Feng-Hao Liu,et al. Tamper and Leakage Resilience in the Split-State Model , 2012, IACR Cryptol. ePrint Arch..
[19] Divesh Aggarwal,et al. Affine-evasive sets modulo a prime , 2015, Inf. Process. Lett..
[20] Mei-Chu Chang. A polynomial bound in Freiman's theorem , 2002 .
[21] Eli Ben-Sasson,et al. From affine to two-source extractors via approximate duality , 2011, STOC '11.
[22] Yuval Ishai,et al. Private Circuits II: Keeping Secrets in Tamperable Circuits , 2006, EUROCRYPT.
[23] T. Sanders. On the Bogolyubov–Ruzsa lemma , 2010, 1011.0107.
[24] Shachar Lovett,et al. An Additive Combinatorics Approach Relating Rank to Communication Complexity , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[25] Yuval Ishai,et al. Private Circuits: Securing Hardware against Probing Attacks , 2003, CRYPTO.