Leakage-Resilient Non-malleable Codes
暂无分享,去创建一个
Stefan Dziembowski | Divesh Aggarwal | Maciej Obremski | Tomasz Kazana | Stefan Dziembowski | Divesh Aggarwal | Tomasz Kazana | Maciej Obremski
[1] David Zuckerman,et al. Non-malleable Codes against Constant Split-State Tampering , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[2] Ueli Maurer,et al. From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes , 2015, TCC.
[3] Venkatesan Guruswami,et al. Non-malleable Coding Against Bit-Wise and Split-State Tampering , 2013, Journal of Cryptology.
[4] Divesh Aggarwal,et al. Affine-evasive sets modulo a prime , 2015, Inf. Process. Lett..
[5] Yael Tauman Kalai,et al. Securing Circuits against Constant-Rate Tampering , 2012, CRYPTO.
[6] Stefan Dziembowski,et al. Non-Malleable Codes from Two-Source Extractors , 2013, IACR Cryptol. ePrint Arch..
[7] Stefan Dziembowski,et al. Leakage-Resilient Circuits without Computational Assumptions , 2012, TCC.
[8] Yael Tauman Kalai,et al. Cryptography with Tamperable and Leaky Memory , 2011, CRYPTO.
[9] Yevgeniy Dodis,et al. Non-malleable Reductions and Applications , 2015, Electron. Colloquium Comput. Complex..
[10] Rafail Ostrovsky,et al. Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , 2004, SIAM J. Comput..
[11] Carles Padró,et al. Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors , 2008, EUROCRYPT.
[12] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[13] Stefan Dziembowski,et al. Leakage-Resilient Storage , 2010, SCN.
[14] Venkatesan Guruswami,et al. Capacity of Non-Malleable Codes , 2013, IEEE Transactions on Information Theory.
[15] Gérard D. Cohen,et al. Secure network coding and non-malleable codes: Protection against linear tampering , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[16] Yuval Ishai,et al. Private Circuits II: Keeping Secrets in Tamperable Circuits , 2006, EUROCRYPT.
[17] Yuval Ishai,et al. Private Circuits: Securing Hardware against Probing Attacks , 2003, CRYPTO.
[18] Feng-Hao Liu,et al. Tamper and Leakage Resilience in the Split-State Model , 2012, IACR Cryptol. ePrint Arch..
[19] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[20] Shachar Lovett,et al. Non-malleable codes from additive combinatorics , 2014, STOC.
[21] Guy N. Rothblum,et al. Leakage-Resilient Signatures , 2010, TCC.
[22] Silvio Micali,et al. Algorithmic Tamper-Proof (ATP) Security: Theoretical Foundations for Security against Hardware Tampering , 2004, TCC.
[23] Stefan Dziembowski,et al. Intrusion-Resilient Secret Sharing , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[24] B. Abdolmaleki. Non-Malleable Codes , 2017 .
[25] Silvio Micali,et al. Physically Observable Cryptography (Extended Abstract) , 2004, TCC.
[26] Pratyay Mukherjee,et al. A Tamper and Leakage Resilient Random Access Machine , 2014, IACR Cryptology ePrint Archive.
[27] Anup Rao,et al. An Exposition of Bourgain's 2-Source Extractor , 2007, Electron. Colloquium Comput. Complex..
[28] Markus G. Kuhn,et al. Tamper resistance: a cautionary note , 1996 .
[29] Feng-Hao Liu,et al. Algorithmic Tamper-Proof Security under Probing Attacks , 2010, SCN.
[30] Pratyay Mukherjee,et al. Continuous Non-malleable Codes , 2014, IACR Cryptol. ePrint Arch..
[31] Daniel Wichs,et al. Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits , 2014, IEEE Transactions on Information Theory.
[32] Daniele Venturi,et al. Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience , 2011, ICALP.
[33] Stefan Dziembowski,et al. Leakage-Resilient Cryptography , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[34] Mihir Bellare,et al. A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications , 2003, EUROCRYPT.
[35] Guy N. Rothblum,et al. How to Compute in the Presence of Leakage , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[36] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..