Securing Circuits and Protocols against 1/poly(k) Tampering Rate

DOI10.1007/978-3-642-54242-8_23zbMath1326.94083OpenAlexW2160147963MaRDI QIDQ5746353

Yael Tauman Kalai, Dana Dachman-Soled

Publication date: 18 February 2014

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54242-8_23

zbMATH Keywords

two-party computationtamper-resilient circuits

Mathematics Subject Classification ID

Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25)

Related Items (6)

The Chaining Lemma and Its Application ⋮ Continuously non-malleable codes in the split-state model ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Non-malleable Codes with Split-State Refresh ⋮ Locally decodable and updatable non-malleable codes and their applications

This page was built for publication: Securing Circuits and Protocols against 1/poly(k) Tampering Rate