A Note on Perfect Correctness by Derandomization
Name
Bitansky-Vaikuntanathan2022_Article_ANoteOnPerfectCorrectnessByDer.pdf
Description
Published version
Size
286.36 KB
Format
Adobe PDF
Checksum (MD5)
6da7e722d4930f134aff5e028b662025
Author(s)
Bitansky, Nir
Vaikuntanathan, Vinod
Date Issued
July 2022
Journal
Journal of Cryptology
Publisher
Springer Science and Business Media LLC
Citation
Bitansky, Nir and Vaikuntanathan, Vinod. 2022. "A Note on Perfect Correctness by Derandomization." Journal of Cryptology, 35 (3).
Version
Final published version
Abstract
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 oneway 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, showing that they can be made perfectly 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
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution 4.0 International license
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00145-022-09428-0
