Steven Myers's Home Page
I'm currently a PhD Candidate at the University
of Toronto. I am pursuing research in the field of cryptography as a member
of the Theory of Computation group in the Department
of Computer Science. My supervisor is Professor Charles
I completed an MSc in Computer Science (1999) at the University of Toronto,
also under the supervision of Professor Charles Rackoff. I completed an
Honours BSc in Computer Science with a minor in Pure Mathematics (1997) at
the University of Calgary under the
supervision of Lisa Higham.
If you're interested, here is a copy of my
Below is a list of my research interests.
- Cryptography & Secure
- Probabilistic Constructions
- Complexity Theory
- Randomized &
- Distributed Computing
- Shlomo Hoory, Avner Magen,
Steven Myers & Charles Rackoff. Simple
Permutations Mix Well. (To appear in ICALP 2004).
- Steven Myers, Black-Box Composition Does Not Imply Adaptive Security.
(To appear in Eurocrypt 2004, Copyright IACR 2004)
- Steven Myers, Efficient Amplification of the Security of Weak
Pseudo-Random Function Generators, Journal of Cryptology, Vol. 16,
Pages 1-24, Springer, 2003. (Extended Abstract appeared in EUROCRYPT 2001,
LNCS 2045, Pages:358-372, Springer, 2001)
- Jonathan Katz, Steven Myers
& Rafial Ostrovsky, Cryptographic Counters and
Applications to Electronic Voting, Proceedings of Advances in Cryptology-EUROCRYPT
2001, LNCS 2045, Pages 78-92, Springer, 2001 (Copyright IACR, 2001)
- Steven Myers. On the Development of Block-Ciphers and Pseudo-Random
Function Generators Using the Composition and XOR Operators. M.Sc.
- Lisa Higham & Steven
Myers. Self-Stabilizing Token
Circulation on Anonymous Message Passing Rings, Proceedings of the
2nd International Conference On Principles of Distributed Systems, pp.
- Steven Myers. Models of
Self-Stabilization, B.Sc. Honours Thesis, 1997
If you have comments or suggestions,
email me at firstname.lastname@example.org