Ultra-Fast Expected Time Parallel Algorithms. - Philip D. MacKenzie; Quentin F. Stout (SODA, 1991)

Load Balancing Requires Omega(log*n) Expected Time. - Philip D. MacKenzie (SODA, 1992)

Parallel algorithms with ultra-fast expected times. - Philip D. MacKenzie (1992)

Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs. - Philip D. MacKenzie; Quentin F. Stout (SPAA, 1993)

A Lower Bound for Order-Preserving Broadcast in the Postal Model. - Philip D. MacKenzie (Parallel Process. Lett., 1993)

An W(log log n) Lower Bound for Routing in Optical Networks. - Leslie Ann Goldberg; Mark Jerrum; Philip D. MacKenzie (SPAA, 1994)

A lower bound for the QRQW PRAM. - Philip D. MacKenzie (SPDP, 1995)

A Separation Between Reconfigurable Mesh Models. - Philip D. MacKenzie (Parallel Process. Lett., 1995)

Mis-representation of Identities in E-cash Schemes and how to Prevent it. - Agnes Hui Chan; Yair Frankel; Philip D. MacKenzie; Yiannis Tsiounis (ASIACRYPT, 1996)

Proactive RSA. - Yair Frankel; Peter Gemmell; Philip D. MacKenzie; Moti Yung (IACR Cryptol. ePrint Arch., 1996)

Optimal Resilience Proactive Public-Key Cryptosystems. - Yair Frankel; Peter Gemmell; Philip D. MacKenzie; Moti Yung (FOCS, 1997)

Contention Resolution with Guaranteed Constant Expected Delay. - Leslie Ann Goldberg; Philip D. MacKenzie (FOCS, 1997)

Lower Bounds for Randomized Exclusive Write PRAMs. - Philip D. MacKenzie (Theory Comput. Syst., 1997)

The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms. - Philip D. MacKenzie (SIAM J. Comput., 1997)

Computational Bounds for Fundamental Problems on General-Purpose Parallel Models. - Philip D. MacKenzie; Vijaya Ramachandran (SPAA, 1998)

Robust Efficient Distributed RSA-Key Generation. - Yair Frankel; Philip D. MacKenzie; Moti Yung (STOC, 1998)

On Contention Resolution Protocols and Associated Probabilistic Phenomena. - Philip D. MacKenzie; C. Greg Plaxton; Rajmohan Rajaraman (J. ACM, 1998)

Ultafast Expected Time Parallel Algorithms. - Philip D. MacKenzie; Quentin F. Stout (J. Algorithms, 1998)

An Omega(sqrt{log log n}) Lower Bound for Routing in Optical Networks. - Leslie Ann Goldberg; Mark Jerrum; Philip D. MacKenzie (SIAM J. Comput., 1998)

ERCW PRAMs and Optical Communication. - Philip D. MacKenzie; Vijaya Ramachandran (Theor. Comput. Sci., 1998)

Adaptively-Secure Optimal-Resilience Proactive RSA. - Yair Frankel; Philip D. MacKenzie; Moti Yung (ASIACRYPT, 1999)

Abuse-Free Optimistic Contract Signing. - Juan A. Garay; Markus Jakobsson; Philip D. MacKenzie (CRYPTO, 1999)

Anonymous Investing: Hiding the Identities of Stockholders. - Philip D. MacKenzie; Jeffrey S. Sorensen (Financial Cryptography, 1999)

Abuse-Free Multi-party Contract Signing. - Juan A. Garay; Philip D. MacKenzie (DISC, 1999)

Competitive Implementation of Parallel Programs. - Xiaotie Deng; Elias Koutsoupias; Philip D. MacKenzie (Algorithmica, 1999)

Secure and Lightweight Advertising on the Web. - Markus Jakobsson; Philip D. MacKenzie; Julien P. Stern (Comput. Networks, 1999)

Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. - Leslie Ann Goldberg; Philip D. MacKenzie (J. Comput. Syst. Sci., 1999)

Concurrent Oblivious Transfer. - Juan A. Garay; Philip D. MacKenzie (FOCS, 2000)

"Psyeudorandom Intermixing": A Tool for Shared Cryptography. - Yair Frankel; Philip D. MacKenzie; Moti Yung (Public Key Cryptography, 2000)

Efficient and Fresh Cerification. - Irene Gassko; Peter Gemmell; Philip D. MacKenzie (Public Key Cryptography, 2000)

Binary Exponential Backoff Is Stable for High Arrival Rates. - Hesham Al-Ammal; Leslie Ann Goldberg; Philip D. MacKenzie (STACS, 2000)

Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman. - Victor Boyko; Philip D. MacKenzie; Sarvar Patel (IACR Cryptol. ePrint Arch., 2000)

Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. - Ronald Cramer; Ivan Damgård; Philip D. MacKenzie (IACR Cryptol. ePrint Arch., 2000)

Contention resolution with constant expected delay. - Leslie Ann Goldberg; Philip D. MacKenzie; Mike Paterson; Aravind Srinivasan (J. ACM, 2000)

More Efficient Password-Authenticated Key Exchange. - Philip D. MacKenzie (CT-RSA, 2001)

Adaptive Security for the Additive-Sharing Based Proactive RSA. - Yair Frankel; Philip D. MacKenzie; Moti Yung (Public Key Cryptography, 2001)

An Improved Stability Bound for Binary Exponential Backoff. - Hesham Al-Ammal; Leslie Ann Goldberg; Philip D. MacKenzie (Theory Comput. Syst., 2001)

Adaptively secure distributed public-key systems. - Yair Frankel; Philip D. MacKenzie; Moti Yung (Theor. Comput. Sci., 2002)

Automatic generation of two-party computations. - Philip D. MacKenzie; Alina Oprea; Michael K. Reiter (CCS, 2003)

An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack. - Philip D. MacKenzie (Public Key Cryptography, 2003)

Delegation of cryptographic servers for capture-resilient devices. - Philip D. MacKenzie; Michael K. Reiter (Distributed Comput., 2003)

On Simulation-Sound Trapdoor Commitments. - Philip D. MacKenzie; Ke Yang (IACR Cryptol. ePrint Arch., 2003)

Networked cryptographic devices resilient to capture. - Philip D. MacKenzie; Michael K. Reiter (Int. J. Inf. Sec., 2003)

On Simulation-Sound Trapdoor Commitments. - Philip D. MacKenzie; Ke Yang 005 (EUROCRYPT, 2004)

Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract). - Philip D. MacKenzie; Michael K. Reiter; Ke Yang 005 (TCC, 2004)

Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness. - Juan A. Garay; Philip D. MacKenzie; Ke Yang 005 (IACR Cryptol. ePrint Arch., 2004)

Efficient and Universally Composable Committed Oblivious Transfer and Applications. - Juan A. Garay; Philip D. MacKenzie; Ke Yang 005 (IACR Cryptol. ePrint Arch., 2004)

Two-party generation of DSA signatures. - Philip D. MacKenzie; Michael K. Reiter (Int. J. Inf. Sec., 2004)

Password authenticated key exchange using hidden smooth subgroups. - Craig Gentry; Philip D. MacKenzie; Zulfikar Ramzan (CCS, 2005)

Hard Bits of the Discrete Log with Applications to Password Authentication. - Philip D. MacKenzie; Sarvar Patel (CT-RSA, 2005)

Universally Composable Password-Based Key Exchange. - Ran Canetti; Shai Halevi; Jonathan Katz; Yehuda Lindell; Philip D. MacKenzie (IACR Cryptol. ePrint Arch., 2005)

A Method for Making Password-Based Key Exchange Resilient to Server Compromise. - Craig Gentry; Philip D. MacKenzie; Zulfikar Ramzan (CRYPTO, 2006)

Strengthening Zero-Knowledge Protocols Using Signatures. - Juan A. Garay; Philip D. MacKenzie; Ke Yang 005 (J. Cryptol., 2006)

Threshold Password-Authenticated Key Exchange. - Philip D. MacKenzie; Thomas Shrimpton; Markus Jakobsson (J. Cryptol., 2006)

Password-authenticated key exchange based on RSA. - Philip D. MacKenzie; Sarvar Patel; Ram Swaminathan (Int. J. Inf. Sec., 2010)

Resource Fairness and Composability of Cryptographic Protocols. - Juan A. Garay; Philip D. MacKenzie; Manoj Prabhakaran 001; Ke Yang 005 (J. Cryptol., 2011)

Two-server password-only authenticated key exchange. - Jonathan Katz; Philip D. MacKenzie; Gelareh Taban; Virgil D. Gligor (J. Comput. Syst. Sci., 2012)