Non-malleable Coding Against Bit-Wise and Split-State Tampering
暂无分享,去创建一个
[1] Ran Raz,et al. Extractors with weak random seeds , 2005, STOC '05.
[2] Yevgeniy Dodis,et al. Non-malleable extractors and symmetric key cryptography from weak secrets , 2009, STOC '09.
[3] Hao Chen,et al. Secure Computation from Random Error Correcting Codes , 2007, EUROCRYPT.
[4] Yael Tauman Kalai,et al. 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[5] Vipul Goyal,et al. Non-malleable extractors and codes, with their many tampered extensions , 2015, IACR Cryptol. ePrint Arch..
[6] Venkatesan Guruswami,et al. Non-malleable Coding against Bit-Wise and Split-State Tampering , 2014, TCC.
[7] B. Abdolmaleki. Non-Malleable Codes , 2017 .
[8] Yevgeniy Dodis,et al. Non-malleable Reductions and Applications , 2015, Electron. Colloquium Comput. Complex..
[9] Carles Padró,et al. Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors , 2008, EUROCRYPT.
[10] Stefan Dziembowski,et al. Non-Malleable Codes from Two-Source Extractors , 2013, IACR Cryptol. ePrint Arch..
[11] Avi Wigderson,et al. 2-source dispersers for $n^{o(1)}$ entropy, and Ramsey graphs beating the Frankl-Wilson construction , 2012 .
[12] Ran Raz,et al. Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[13] Yevgeniy Dodis,et al. Privacy Amplification and Non-malleable Extractors via Character Sums , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[14] Avi Wigderson,et al. 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction , 2006, STOC '06.
[15] J. Bourgain,et al. MORE ON THE SUM-PRODUCT PHENOMENON IN PRIME FIELDS AND ITS APPLICATIONS , 2005 .
[16] Ran Raz,et al. Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification , 2012, Computational Complexity Conference.
[17] David Zuckerman,et al. Non-malleable Codes against Constant Split-State Tampering , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[18] Mahdi Cheraghchi,et al. Applications of Derandomization Theory in Coding , 2011, ArXiv.
[19] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[20] Moni Naor,et al. Derandomized Constructions of k-Wise (Almost) Independent Permutations , 2005, Algorithmica.
[21] Shachar Lovett,et al. Non-malleable codes from additive combinatorics , 2014, STOC.
[22] Ran Raz,et al. Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification , 2012, 2012 IEEE 27th Conference on Computational Complexity.
[23] Anup Rao,et al. A 2-Source Almost-Extractor for Linear Entropy , 2008, APPROX-RANDOM.
[24] Venkatesan Guruswami,et al. Capacity of Non-Malleable Codes , 2013, IEEE Transactions on Information Theory.
[25] Jørn Justesen,et al. Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.
[26] Xin Li,et al. Non-malleable Extractors, Two-Source Extractors and Privacy Amplification , 2011, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[27] Salil P. Vadhan,et al. Pseudorandomness , 2012, Found. Trends Theor. Comput. Sci..
[28] Venkatesan Guruswami,et al. Codes for Computationally Simple Channels: Explicit Constructions with Optimal Rate , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[29] G. David Forney,et al. Concatenated codes , 2009, Scholarpedia.