One-way functions in worst-case cryptography: algebraic and security properties are on the house

Authors:
Alina Beygelzimer;Lane A. Hemaspaandra;Christopher M. Homan;Jörg Rothe
Affiliations:
Dept. of Computer Science, University of Rochester, Rochester, NY;Dept. of Computer Science, University of Rochester, Rochester, NY;Dept. of Computer Science, University of Rochester, Rochester, NY;Dept. of Computer Science, University of Rochester, Rochester, NY
Venue:
ACM SIGACT News
Year:
1999

Citing 0
Cited 6

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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract