Refuting the dream XOR lemma via ideal obfuscation and resettable MPC

DOI10.4230/LIPICS.ITC.2022.10MaRDI QIDQ6561690zbMATH OpenFDO

Authors Saikrishna Badrinarayanan, Yuval Ishai, Dakshita Khurana, Amit Sahai, Daniel Wichs

Publication date 25 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ITC.2022.10

zbMATH Keywords

obfuscationresettable MPCXOR lemma

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On Yao's XOR-lemma
• Three XOR-lemmas -- an exposition
• On the impossibility of approximate obfuscation and applications to resettable cryptography
• Garbling XOR gates ``for free in the standard model
• General hardness amplification of predicates and puzzles. (Extended abstract)

Cited in

(1)

• Fine-grained non-interactive key exchange, revisited

This page was built for publication: Refuting the dream XOR lemma via ideal obfuscation and resettable MPC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561690)