Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with Correctness:
TR15-187 | 24th November 2015
Nir Bitansky, Vinod Vaikuntanathan

A Note on Perfect Correctness by Derandomization

Revisions: 1

In this note, we show how to transform a large class of erroneous cryptographic schemes into perfectly correct ones. The transformation works for schemes that are correct on every input with probability noticeably larger than half, and are secure under parallel repetition. We assume the existence of one-way functions ... more >>>

ISSN 1433-8092 | Imprint