Non-Malleable Codes Against Bounded Polynomial Time Tampering - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Marshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin. Non-Malleable Codes Against Bounded Polynomial Time Tampering. In Yuval Ishai, Vincent Rijmen, editors, Advances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings, Part I. Volume 11476 of Lecture Notes in Computer Science, pages 501-530, Springer, 2019. [doi]

The following publications are possibly variants of this publication:

Non-Malleable Codes Against Bounded Polynomial Time TamperingMarshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin. iacr, 2018:1015, 2018. [doi]

Non-Malleable Codes for Bounded Polynomial Depth TamperingDana Dachman-Soled, Ilan Komargodski, Rafael Pass. iacr, 2020:776, 2020. [doi]

Non-malleable Codes for Bounded Parallel-Time TamperingDana Dachman-Soled, Ilan Komargodski, Rafael Pass. crypto 2021: 535-565 [doi]

Non-malleability Against Polynomial TamperingMarshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan. crypto 2020: 97-126 [doi]

Non-Malleability against Polynomial TamperingMarshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan. eccc, 27:23, 2020. [doi]

Non-Malleability against Polynomial TamperingMarshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan. iacr, 2020:147, 2020. [doi]

runs on WebDSL