Low Ambiguity in Strong, Total, Associative, One-Way Functions

Christopher M. Homan

Rabi and Sherman present a cryptographic paradigm based on associative, one-way functions that are strong (i.e., hard to invert even if one of their arguments is given) and total.…