Non-Malleability against Polynomial Tampering - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Marshall Ball, Eshan Chattopadhyay, Jyun-Jie Liao, Tal Malkin, Li-Yang Tan. Non-Malleability against Polynomial Tampering. IACR Cryptology ePrint Archive, 2020:147, 2020. [doi]

The following publications are possibly variants of this publication:

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. crypto 2020: 97-126 [doi]

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 Against Bounded Polynomial Time TamperingMarshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Huijia Lin, Tal Malkin. eurocrypt 2019: 501-530 [doi]

Non-malleable Codes against Constant Split-State TamperingEshan Chattopadhyay, David Zuckerman. focs 2014: 306-315 [doi]

Non-Malleable Codes Against Constant Split-State TamperingEshan Chattopadhyay, David Zuckerman. eccc, 21:102, 2014. [doi]

runs on WebDSL