next up previous
Next: A Quantitative Approach to Up: The Technion Period (1986-94) Previous: Source to Destination Communication

A Uniform Complexity Treatment of Encryption and Zero-Knowledge

This paper presents definitions that refer to the infeasiblity of finding an instance for which the security guarantee fails, whereas previous definitions referred to the non-existence of such instances. It is shown that such secure schemes can be constructed under uniform-complexity assumptions, rather than under non-uniform ones.


Comments: Authored by O. Goldreich. Appeared in



Oded Goldreich
2003-07-30