A Note on Perfect Correctness by Derandomization
Name
2015-1130.pdf
Description
Accepted version
Size
355.22 KB
Format
Unknown
Checksum (MD5)
a43295914bf88a0817565ae8f2c3e480
Author(s)
Bitansky, Nir
Vaikuntanathan, Vinod
Date Issued
2017
Publisher
Springer International Publishing
Citation
Bitansky, Nir and Vaikuntanathan, Vinod. 2017. "A Note on Perfect Correctness by Derandomization."
Version
Author's final manuscript
Abstract
© International Association for Cryptologic Research 2017. We show a general compiler that transforms a large class of erroneous cryptographic schemes (such as public-key encryption, indistinguishability obfuscation, and secure multiparty computation schemes) into perfectly correct ones. The transformation works for schemes that are correct on all inputs with probability noticeably larger than half, and are secure under parallel repetition. We assume the existence of one-way functions and of functions with deterministic (uniform) time complexity 2O(n) and non-deterministic circuit complexity 2Ω(n). Our transformation complements previous results that showed how public-key encryption and indistinguishability obfuscation that err on a noticeable fraction of inputs can be turned into ones that for all inputs are often correct. The technique relies on the idea of “reverse randomization” (Naor, Crypto 1989) and on Nisan-Wigderson style derandomization, previously used in cryptography to remove interaction from witnessindistinguishable proofs and commitment schemes (Barak, Ong and Vadhan, Crypto 2003).
MIT Department
Sloan School of Management
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-319-56614-6_20
