Philip D. MacKenzie

	2012
75		Jonathan Katz, Philip D. MacKenzie, Gelareh Taban, Virgil D. Gligor: Two-server password-only authenticated key exchange. J. Comput. Syst. Sci. 78(2): 651-669 (2012)
	2011
74		Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang: Resource Fairness and Composability of Cryptographic Protocols. J. Cryptology 24(4): 615-658 (2011)
	2010
73		Philip D. MacKenzie, Sarvar Patel, Ram Swaminathan: Password-authenticated key exchange based on RSA. Int. J. Inf. Sec. 9(6): 387-410 (2010)
	2006
72		Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan: A Method for Making Password-Based Key Exchange Resilient to Server Compromise. CRYPTO 2006: 142-159
71		Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang: Resource Fairness and Composability of Cryptographic Protocols. TCC 2006: 404-428
70		Philip D. MacKenzie, Thomas Shrimpton, Markus Jakobsson: Threshold Password-Authenticated Key Exchange. J. Cryptology 19(1): 27-66 (2006)
69		Juan A. Garay, Philip D. MacKenzie, Ke Yang: Strengthening Zero-Knowledge Protocols Using Signatures. J. Cryptology 19(2): 169-209 (2006)
	2005
68		Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan: Password authenticated key exchange using hidden smooth subgroups. ACM Conference on Computer and Communications Security 2005: 299-309
67		Jonathan Katz, Philip D. MacKenzie, Gelareh Taban, Virgil D. Gligor: Two-Server Password-Only Authenticated Key Exchange. ACNS 2005: 1-16
66		Philip D. MacKenzie, Sarvar Patel: Hard Bits of the Discrete Log with Applications to Password Authentication. CT-RSA 2005: 209-226
65		Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie: Universally Composable Password-Based Key Exchange. EUROCRYPT 2005: 404-421
64		Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie: Universally Composable Password-Based Key Exchange. IACR Cryptology ePrint Archive 2005: 196 (2005)
63		Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang: Resource Fairness and Composability of Cryptographic Protocols. IACR Cryptology ePrint Archive 2005: 370 (2005)
	2004
62		Philip D. MacKenzie, Ke Yang: On Simulation-Sound Trapdoor Commitments. EUROCRYPT 2004: 382-400
61		Philip D. MacKenzie, Michael K. Reiter, Ke Yang: Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract). TCC 2004: 171-190
60		Juan A. Garay, Philip D. MacKenzie, Ke Yang: Efficient and Universally Composable Committed Oblivious Transfer and Applications. IACR Cryptology ePrint Archive 2004: 53 (2004)
59		Juan A. Garay, Philip D. MacKenzie, Ke Yang: Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness. IACR Cryptology ePrint Archive 2004: 9 (2004)
58		Philip D. MacKenzie, Michael K. Reiter: Two-party generation of DSA signatures. Int. J. Inf. Sec. 2(3-4): 218-239 (2004)
	2003
57		Philip D. MacKenzie, Alina Oprea, Michael K. Reiter: Automatic generation of two-party computations. ACM Conference on Computer and Communications Security 2003: 210-219
56		Juan A. Garay, Philip D. MacKenzie, Ke Yang: Strengthening Zero-Knowledge Protocols Using Signatures. EUROCRYPT 2003: 177-194
55		Philip D. MacKenzie: An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack. Public Key Cryptography 2003: 47-61
54		Philip D. MacKenzie, Michael K. Reiter: Delegation of cryptographic servers for capture-resilient devices. Distributed Computing 16(4): 307-327 (2003)
53		Philip D. MacKenzie, Ke Yang: On Simulation-Sound Trapdoor Commitments. IACR Cryptology ePrint Archive 2003: 252 (2003)
52		Juan A. Garay, Philip D. MacKenzie, Ke Yang: Strengthening Zero-Knowledge Protocols using Signatures. IACR Cryptology ePrint Archive 2003: 37 (2003)
51		Philip D. MacKenzie, Michael K. Reiter: Networked cryptographic devices resilient to capture. Int. J. Inf. Sec. 2(1): 1-20 (2003)
	2002
50		Philip D. MacKenzie, Thomas Shrimpton, Markus Jakobsson: Threshold Password-Authenticated Key Exchange. CRYPTO 2002: 385-400
49		Yair Frankel, Philip D. MacKenzie, Moti Yung: Adaptively secure distributed public-key systems. Theor. Comput. Sci. 287(2): 535-561 (2002)
	2001
48		Philip D. MacKenzie, Michael K. Reiter: Delegation of cryptographic servers for capture-resilient devices. ACM Conference on Computer and Communications Security 2001: 10-19
47		Philip D. MacKenzie, Michael K. Reiter: Two-Party Generation of DSA Signatures. CRYPTO 2001: 137-154
46		Philip D. MacKenzie: More Efficient Password-Authenticated Key Exchange. CT-RSA 2001: 361-377
45		Philip D. MacKenzie, Michael K. Reiter: Networked Cryptographic Devices Resilient to Capture. IEEE Symposium on Security and Privacy 2001: 12-25
44		Yair Frankel, Philip D. MacKenzie, Moti Yung: Adaptive Security for the Additive-Sharing Based Proactive RSA. Public Key Cryptography 2001: 240-263
43		Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie: An Improved Stability Bound for Binary Exponential Backoff. Theory Comput. Syst. 34(3): 229-244 (2001)
	2000
42		Philip D. MacKenzie, Sarvar Patel, Ram Swaminathan: Password-Authenticated Key Exchange Based on RSA. ASIACRYPT 2000: 599-613
41		Victor Boyko, Philip D. MacKenzie, Sarvar Patel: Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman. EUROCRYPT 2000: 156-171
40		Juan A. Garay, Philip D. MacKenzie: Concurrent Oblivious Transfer. FOCS 2000: 314-324
39		Yair Frankel, Philip D. MacKenzie, Moti Yung: "Psyeudorandom Intermixing": A Tool for Shared Cryptography. Public Key Cryptography 2000: 306-325
38		Irene Gassko, Peter Gemmell, Philip D. MacKenzie: Efficient and Fresh Cerification. Public Key Cryptography 2000: 342-353
37		Ronald Cramer, Ivan Damgård, Philip D. MacKenzie: Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. Public Key Cryptography 2000: 354-373
36		Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie: Binary Exponential Backoff Is Stable for High Arrival Rates. STACS 2000: 169-180
35		Victor Boyko, Philip D. MacKenzie, Sarvar Patel: Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman. IACR Cryptology ePrint Archive 2000: 44 (2000)
34		Ronald Cramer, Ivan Damgård, Philip D. MacKenzie: Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. IACR Cryptology ePrint Archive 2000: 45 (2000)
33		Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan: Contention resolution with constant expected delay. J. ACM 47(6): 1048-1096 (2000)
	1999
32		Yair Frankel, Philip D. MacKenzie, Moti Yung: Adaptively-Secure Optimal-Resilience Proactive RSA. ASIACRYPT 1999: 180-194
31		Juan A. Garay, Markus Jakobsson, Philip D. MacKenzie: Abuse-Free Optimistic Contract Signing. CRYPTO 1999: 449-466
30		Juan A. Garay, Philip D. MacKenzie: Abuse-Free Multi-party Contract Signing. DISC 1999: 151-165
29		Yair Frankel, Philip D. MacKenzie, Moti Yung: Adaptively-Secure Distributed Public-Key Systems. ESA 1999: 4-27
28		Philip D. MacKenzie, Jeffrey S. Sorensen: Anonymous Investing: Hiding the Identities of Stockholders. Financial Cryptography 1999: 212-229
27		Xiaotie Deng, Elias Koutsoupias, Philip D. MacKenzie: Competitive Implementation of Parallel Programs. Algorithmica 23(1): 14-30 (1999)
26		Markus Jakobsson, Philip D. MacKenzie, Julien P. Stern: Secure and Lightweight Advertising on the Web. Computer Networks 31(11-16): 1101-1109 (1999)
25		Leslie Ann Goldberg, Philip D. MacKenzie: Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. J. Comput. Syst. Sci. 58(1): 232-258 (1999)
	1998
24		Yair Frankel, Philip D. MacKenzie, Moti Yung: Robust Efficient Distributed RSA-Key Generation. PODC 1998: 320
23		Philip D. MacKenzie, Vijaya Ramachandran: Computational Bounds for Fundamental Problems on General-Purpose Parallel Models. SPAA 1998: 152-163
22		Yair Frankel, Philip D. MacKenzie, Moti Yung: Robust Efficient Distributed RSA-Key Generation. STOC 1998: 663-672
21		Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman: On Contention Resolution Protocols and Associated Probabilistic Phenomena. J. ACM 45(2): 324-378 (1998)
20		Philip D. MacKenzie, Quentin F. Stout: Ultafast Expected Time Parallel Algorithms. J. Algorithms 26(1): 1-33 (1998)
19		Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie: An Omega(sqrt{log log n}) Lower Bound for Routing in Optical Networks. SIAM J. Comput. 27(4): 1083-1098 (1998)
18		Philip D. MacKenzie, Vijaya Ramachandran: ERCW PRAMs and Optical Communication. Theor. Comput. Sci. 196(1-2): 153-180 (1998)
	1997
17		Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung: Proactive RSA. CRYPTO 1997: 440-454
16		Leslie Ann Goldberg, Philip D. MacKenzie: Contention Resolution with Guaranteed Constant Expected Delay. FOCS 1997: 213-222
15		Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung: Optimal Resilience Proactive Public-Key Cryptosystems. FOCS 1997: 384-393
14		Philip D. MacKenzie: The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms. SIAM J. Comput. 26(6): 1559-1580 (1997)
13		Philip D. MacKenzie: Lower Bounds for Randomized Exclusive Write PRAMs. Theory Comput. Syst. 30(6): 599-626 (1997)
	1996
12		Agnes Hui Chan, Yair Frankel, Philip D. MacKenzie, Yiannis Tsiounis: Mis-representation of Identities in E-cash Schemes and how to Prevent it. ASIACRYPT 1996: 276-285
11		Philip D. MacKenzie, Vijaya Ramachandran: ERCW PRAMs and Optical Communication. Euro-Par, Vol. II 1996: 293-302
10		Leslie Ann Goldberg, Philip D. MacKenzie: Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. SODA 1996: 554-563
	1995
9		Philip D. MacKenzie: Lower Bounds for Randomized Exclusive Write PRAMs. SPAA 1995: 254-263
8		Philip D. MacKenzie: A Separation Between Reconfigurable Mesh Models. Parallel Processing Letters 5: 15-22 (1995)
	1994
7		Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie: An W(log log n) Lower Bound for Routing in Optical Networks. SPAA 1994: 147-156
6		Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman: On contention resolution protocols and associated probabilistic phenomena. STOC 1994: 153-162
	1993
5		Philip D. MacKenzie: A Separation Between Reconfigurable Mesh Models. IPPS 1993: 84-88
4		Philip D. MacKenzie, Quentin F. Stout: Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs. SPAA 1993: 224-229
3		Philip D. MacKenzie: A Lower Bound for Order-Preserving Broadcast in the Postal Model. Parallel Processing Letters 3: 313-320 (1993)
	1992
2		Philip D. MacKenzie: Load Balancing Requires Omega(log*n) Expected Time. SODA 1992: 94-99
	1991
1		Philip D. MacKenzie, Quentin F. Stout: Ultra-Fast Expected Time Parallel Algorithms. SODA 1991: 414-423

Coauthor Index

1	Hesham Al-Ammal	[36] [43]
2	Victor Boyko	[35] [41]
3	Ran Canetti	[64] [65]
4	Agnes Hui Chan	[12]
5	Ronald Cramer	[34] [37]
6	Ivan Damgård (Ivan Bjerre Damgård)	[34] [37]
7	Xiaotie Deng	[27]
8	Yair Frankel	[12] [15] [17] [22] [24] [29] [32] [39] [44] [49]
9	Juan A. Garay	[30] [31] [40] [52] [56] [59] [60] [63] [69] [71] [74]
10	Irene Gassko	[38]
11	Peter Gemmell	[15] [17] [38]
12	Craig Gentry	[68] [72]
13	Virgil D. Gligor	[67] [75]
14	Leslie Ann Goldberg (Leslie A. Henderson)	[7] [10] [16] [19] [25] [33] [36] [43]
15	Shai Halevi	[64] [65]
16	Markus Jakobsson	[26] [31] [50] [70]
17	Mark Jerrum	[7] [19]
18	Jonathan Katz	[64] [65] [67] [75]
19	Elias Koutsoupias	[27]
20	Yehuda Lindell	[64] [65]
21	Alina Oprea	[57]
22	Sarvar Patel	[35] [41] [42] [66] [73]
23	Mike Paterson	[33]
24	C. Greg Plaxton	[6] [21]
25	Manoj Prabhakaran	[63] [71] [74]
26	Rajmohan Rajaraman	[6] [21]
27	Vijaya Ramachandran	[11] [18] [23]
28	Zulfikar Ramzan	[68] [72]
29	Michael K. Reiter	[45] [47] [48] [51] [54] [57] [58] [61]
30	Thomas Shrimpton	[50] [70]
31	Jeffrey S. Sorensen	[28]
32	Aravind Srinivasan	[33]
33	Julien P. Stern	[26]
34	Quentin F. Stout	[1] [4] [20]
35	Ram Swaminathan	[42] [73]
36	Gelareh Taban	[67] [75]
37	Yiannis Tsiounis	[12]
38	Ke Yang	[52] [53] [56] [59] [60] [61] [62] [63] [69] [71] [74]
39	Moti Yung (Mordechai M. Yung)	[15] [17] [22] [24] [29] [32] [39] [44] [49]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page