Associative one-way functions: a new paradigm for secret-key agreement and digital signatures

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

If P ≠ NP then some strongly noninvertible functions are invertible

Theoretical Computer Science

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

Partial group session key agreement scheme for mobile agents in e-commerce environment

PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems