Witness-based cryptographic program checking and applications (an announcement)

Abstract

This paper develops a new 'witness-based' approach and provides constructions that apply to various cryptographic scenarios while making sure that the checker/program interaction releases no extra knowledge. The approach is based on techniques applicable to certain homorphic functions, where having a withness will enable the checking of the entire function domain. It uses the fact that having a random value of cryptographic function typically does not reduce its security. Thus, functions like the RSA function and the discrete logarithm based functions which are the basic tools of public-key cryptography can be checked.