Philip D. MacKenzie

78 papers A* 21A 6B 9Journal 31Unranked 10

Year	Rank	Type	Title / Venue / Authors
2012	J	`jnl`	Two-server password-only authenticated key exchange. J. Comput. Syst. Sci. Jonathan Katz, Philip D. MacKenzie, Gelareh Taban, Virgil D. Gligor
2011	J	`jnl`	Resource Fairness and Composability of Cryptographic Protocols. J. Cryptol. Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang
2010	J	`jnl`	Password-authenticated key exchange based on RSA. Int. J. Inf. Sec. Philip D. MacKenzie, Sarvar Patel, Ram Swaminathan
2006	A*	`conf`	A Method for Making Password-Based Key Exchange Resilient to Server Compromise. CRYPTO Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan
2006	B	`conf`	Resource Fairness and Composability of Cryptographic Protocols. TCC Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang
2006	J	`jnl`	Strengthening Zero-Knowledge Protocols Using Signatures. J. Cryptol. Juan A. Garay, Philip D. MacKenzie, Ke Yang
2006	J	`jnl`	Threshold Password-Authenticated Key Exchange. J. Cryptol. Philip D. MacKenzie, Thomas Shrimpton, Markus Jakobsson
2005	B	`conf`	Hard Bits of the Discrete Log with Applications to Password Authentication. CT-RSA Philip D. MacKenzie, Sarvar Patel
2005	A*	`conf`	Password authenticated key exchange using hidden smooth subgroups. CCS Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan
2005	J	`jnl`	Resource Fairness and Composability of Cryptographic Protocols. IACR Cryptol. ePrint Arch. Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang
2005	B	`conf`	Two-Server Password-Only Authenticated Key Exchange. ACNS Jonathan Katz, Philip D. MacKenzie, Gelareh Taban, Virgil D. Gligor
2005	A*	`conf`	Universally Composable Password-Based Key Exchange. EUROCRYPT Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie
2005	J	`jnl`	Universally Composable Password-Based Key Exchange. IACR Cryptol. ePrint Arch. Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie
2004	B	`conf`	Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract). TCC Philip D. MacKenzie, Michael K. Reiter, Ke Yang
2004	J	`jnl`	Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness. IACR Cryptol. ePrint Arch. Juan A. Garay, Philip D. MacKenzie, Ke Yang
2004	J	`jnl`	Efficient and Universally Composable Committed Oblivious Transfer and Applications. IACR Cryptol. ePrint Arch. Juan A. Garay, Philip D. MacKenzie, Ke Yang
2004	A*	`conf`	On Simulation-Sound Trapdoor Commitments. EUROCRYPT Philip D. MacKenzie, Ke Yang
2004	J	`jnl`	Two-party generation of DSA signatures. Int. J. Inf. Sec. Philip D. MacKenzie, Michael K. Reiter
2003	—	`conf`	An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack. Public Key Cryptography Philip D. MacKenzie
2003	A*	`conf`	Automatic generation of two-party computations. CCS Philip D. MacKenzie, Alina Oprea, Michael K. Reiter
2003	J	`jnl`	Delegation of cryptographic servers for capture-resilient devices. Distributed Comput. Philip D. MacKenzie, Michael K. Reiter
2003	J	`jnl`	Networked cryptographic devices resilient to capture. Int. J. Inf. Sec. Philip D. MacKenzie, Michael K. Reiter
2003	J	`jnl`	On Simulation-Sound Trapdoor Commitments. IACR Cryptol. ePrint Arch. Philip D. MacKenzie, Ke Yang
2003	A*	`conf`	Strengthening Zero-Knowledge Protocols Using Signatures. EUROCRYPT Juan A. Garay, Philip D. MacKenzie, Ke Yang
2003	J	`jnl`	Strengthening Zero-Knowledge Protocols using Signatures. IACR Cryptol. ePrint Arch. Juan A. Garay, Philip D. MacKenzie, Ke Yang
2002	J	`jnl`	Adaptively secure distributed public-key systems. Theor. Comput. Sci. Yair Frankel, Philip D. MacKenzie, Moti Yung
2002	A*	`conf`	Threshold Password-Authenticated Key Exchange. CRYPTO Philip D. MacKenzie, Thomas Shrimpton, Markus Jakobsson
2001	—	`conf`	Adaptive Security for the Additive-Sharing Based Proactive RSA. Public Key Cryptography Yair Frankel, Philip D. MacKenzie, Moti Yung
2001	J	`jnl`	An Improved Stability Bound for Binary Exponential Backoff. Theory Comput. Syst. Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie
2001	A*	`conf`	Delegation of cryptographic servers for capture-resilient devices. CCS Philip D. MacKenzie, Michael K. Reiter
2001	B	`conf`	More Efficient Password-Authenticated Key Exchange. CT-RSA Philip D. MacKenzie
2001	—	`conf`	Networked Cryptographic Devices Resilient to Capture. S&P Philip D. MacKenzie, Michael K. Reiter
2001	A*	`conf`	Two-Party Generation of DSA Signatures. CRYPTO Philip D. MacKenzie, Michael K. Reiter
2000	—	`conf`	"Psyeudorandom Intermixing": A Tool for Shared Cryptography. Public Key Cryptography Yair Frankel, Philip D. MacKenzie, Moti Yung
2000	A	`conf`	Binary Exponential Backoff Is Stable for High Arrival Rates. STACS Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie
2000	A*	`conf`	Concurrent Oblivious Transfer. FOCS Juan A. Garay, Philip D. MacKenzie
2000	J	`jnl`	Contention resolution with constant expected delay. J. ACM Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan
2000	—	`conf`	Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. Public Key Cryptography Ronald Cramer, Ivan Damgård, Philip D. MacKenzie
2000	J	`jnl`	Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. IACR Cryptol. ePrint Arch. Ronald Cramer, Ivan Damgård, Philip D. MacKenzie
2000	—	`conf`	Efficient and Fresh Cerification. Public Key Cryptography Irene Gassko, Peter Gemmell, Philip D. MacKenzie
2000	A	`conf`	Password-Authenticated Key Exchange Based on RSA. ASIACRYPT Philip D. MacKenzie, Sarvar Patel, Ram Swaminathan
2000	A*	`conf`	Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman. EUROCRYPT Victor Boyko, Philip D. MacKenzie, Sarvar Patel
2000	J	`jnl`	Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman. IACR Cryptol. ePrint Arch. Victor Boyko, Philip D. MacKenzie, Sarvar Patel
1999	A	`conf`	Abuse-Free Multi-party Contract Signing. DISC Juan A. Garay, Philip D. MacKenzie
1999	A*	`conf`	Abuse-Free Optimistic Contract Signing. CRYPTO Juan A. Garay, Markus Jakobsson, Philip D. MacKenzie
1999	A	`conf`	Adaptively-Secure Distributed Public-Key Systems. ESA Yair Frankel, Philip D. MacKenzie, Moti Yung
1999	A	`conf`	Adaptively-Secure Optimal-Resilience Proactive RSA. ASIACRYPT Yair Frankel, Philip D. MacKenzie, Moti Yung
1999	J	`jnl`	Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. J. Comput. Syst. Sci. Leslie Ann Goldberg, Philip D. MacKenzie
1999	—	`conf`	Anonymous Investing: Hiding the Identities of Stockholders. Financial Cryptography Philip D. MacKenzie, Jeffrey S. Sorensen
1999	J	`jnl`	Competitive Implementation of Parallel Programs. Algorithmica Xiaotie Deng, Elias Koutsoupias, Philip D. MacKenzie
1999	J	`jnl`	Secure and Lightweight Advertising on the Web. Comput. Networks Markus Jakobsson, Philip D. MacKenzie, Julien P. Stern
1998	J	`jnl`	An Omega(sqrt{log log n}) Lower Bound for Routing in Optical Networks. SIAM J. Comput. Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie
1998	B	`conf`	Computational Bounds for Fundamental Problems on General-Purpose Parallel Models. SPAA Philip D. MacKenzie, Vijaya Ramachandran
1998	J	`jnl`	ERCW PRAMs and Optical Communication. Theor. Comput. Sci. Philip D. MacKenzie, Vijaya Ramachandran
1998	J	`jnl`	On Contention Resolution Protocols and Associated Probabilistic Phenomena. J. ACM Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman
1998	A*	`conf`	Robust Efficient Distributed RSA-Key Generation. PODC Yair Frankel, Philip D. MacKenzie, Moti Yung
1998	A*	`conf`	Robust Efficient Distributed RSA-Key Generation. STOC Yair Frankel, Philip D. MacKenzie, Moti Yung
1998	J	`jnl`	Ultafast Expected Time Parallel Algorithms. J. Algorithms Philip D. MacKenzie, Quentin F. Stout
1997	A*	`conf`	Contention Resolution with Guaranteed Constant Expected Delay. FOCS Leslie Ann Goldberg, Philip D. MacKenzie
1997	J	`jnl`	Lower Bounds for Randomized Exclusive Write PRAMs. Theory Comput. Syst. Philip D. MacKenzie
1997	A*	`conf`	Optimal Resilience Proactive Public-Key Cryptosystems. FOCS Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung
1997	A*	`conf`	Proactive RSA. CRYPTO Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung
1997	J	`jnl`	The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms. SIAM J. Comput. Philip D. MacKenzie
1996	A*	`conf`	Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. SODA Leslie Ann Goldberg, Philip D. MacKenzie
1996	—	`conf`	ERCW PRAMs and Optical Communication. Euro-Par, Vol. II Philip D. MacKenzie, Vijaya Ramachandran
1996	A	`conf`	Mis-representation of Identities in E-cash Schemes and how to Prevent it. ASIACRYPT Agnes Hui Chan, Yair Frankel, Philip D. MacKenzie, Yiannis Tsiounis
1996	J	`jnl`	Proactive RSA. IACR Cryptol. ePrint Arch. Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung
1995	J	`jnl`	A Separation Between Reconfigurable Mesh Models. Parallel Process. Lett. Philip D. MacKenzie
1995	—	`conf`	A lower bound for the QRQW PRAM. SPDP Philip D. MacKenzie
1995	B	`conf`	Lower Bounds for Randomized Exclusive Write PRAMs. SPAA Philip D. MacKenzie
1994	B	`conf`	An W(log log n) Lower Bound for Routing in Optical Networks. SPAA Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie
1994	A*	`conf`	On contention resolution protocols and associated probabilistic phenomena. STOC Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman
1993	J	`jnl`	A Lower Bound for Order-Preserving Broadcast in the Postal Model. Parallel Process. Lett. Philip D. MacKenzie
1993	—	`conf`	A Separation Between Reconfigurable Mesh Models. IPPS Philip D. MacKenzie
1993	B	`conf`	Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs. SPAA Philip D. MacKenzie, Quentin F. Stout
1992	A*	`conf`	Load Balancing Requires Omega(log SODA Philip D. MacKenzie
1992	—	`—`	Parallel algorithms with ultra-fast expected times. Philip D. MacKenzie
1991	A*	`conf`	Ultra-Fast Expected Time Parallel Algorithms. SODA Philip D. MacKenzie, Quentin F. Stout