Coherent Functions and Program ( extended abstract ) Checkers

to program checking and other subjects. Unctions whose value at one point can be interpolated from values at other points have occupied a special place in cryptography. In this paper we will develop a general concept of "coherence" to capture this property and show its applications to several models of program checking. The concept and techniques also have applications in Hellman's time-memory tradeoff for inverting random functions.

[1]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[2]  Claire Mathieu,et al.  Verifying partial orders , 1989, STOC '89.

[3]  Richard J. Lipton,et al.  New Directions In Testing , 1989, Distributed Computing And Cryptography.

[4]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[5]  Udi Manber,et al.  The complexity of problems on probabilistic, nondeterministic, and alternating decision trees , 1985, JACM.

[6]  Michael L. Fredman,et al.  How Good is the Information Theory Bound in Sorting? , 1976, Theor. Comput. Sci..

[7]  Joan Feigenbaum,et al.  Lower bounds on random-self-reducibility , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[8]  Andrew Chi-Chih Yao.  On the Complexity of Partial Order Productions , 1989, SIAM J. Comput..

[9]  Joan Feigenbaum,et al.  Hiding Instances in Multioracle Queries , 1990, STACS.

[10]  Martin E. Hellman,et al.  A cryptanalytic time-memory trade-off , 1980, IEEE Trans. Inf. Theory.

[11]  A. Schönhage.  The production of partial orders , 2019 .