Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory

Some facets of complexity theory and cryptography: A five-lecture tutorial

ACM Computing Surveys (CSUR)

If P != NP Then Some Strongly Noninvertible Functions Are Invertible

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory

Tight lower bounds on the ambiguity of strong, total, associative, one-way functions

Journal of Computer and System Sciences

If P ≠ NP then some strongly noninvertible functions are invertible

Theoretical Computer Science

Quantum cryptography: A survey

ACM Computing Surveys (CSUR)

Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions

Theoretical Computer Science

Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for one-way functions in complexity theory

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science