2006 | ||
---|---|---|
64 | EE | Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan: A Method for Making Password-Based Key Exchange Resilient to Server Compromise. CRYPTO 2006: 142-159 |
63 | EE | Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang: Resource Fairness and Composability of Cryptographic Protocols. TCC 2006: 404-428 |
62 | EE | Philip D. MacKenzie, Thomas Shrimpton, Markus Jakobsson: Threshold Password-Authenticated Key Exchange. J. Cryptology 19(1): 27-66 (2006) |
61 | EE | Juan A. Garay, Philip D. MacKenzie, Ke Yang: Strengthening Zero-Knowledge Protocols Using Signatures. J. Cryptology 19(2): 169-209 (2006) |
2005 | ||
60 | EE | 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 |
59 | EE | Jonathan Katz, Philip D. MacKenzie, Gelareh Taban, Virgil D. Gligor: Two-Server Password-Only Authenticated Key Exchange. ACNS 2005: 1-16 |
58 | EE | Philip D. MacKenzie, Sarvar Patel: Hard Bits of the Discrete Log with Applications to Password Authentication. CT-RSA 2005: 209-226 |
57 | EE | Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie: Universally Composable Password-Based Key Exchange. EUROCRYPT 2005: 404-421 |
2004 | ||
56 | EE | Philip D. MacKenzie, Ke Yang: On Simulation-Sound Trapdoor Commitments. EUROCRYPT 2004: 382-400 |
55 | EE | Philip D. MacKenzie, Michael K. Reiter, Ke Yang: Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract). TCC 2004: 171-190 |
54 | EE | Philip D. MacKenzie, Michael K. Reiter: Two-party generation of DSA signatures. Int. J. Inf. Sec. 2(3-4): 218-239 (2004) |
2003 | ||
53 | EE | Philip D. MacKenzie, Alina Oprea, Michael K. Reiter: Automatic generation of two-party computations. ACM Conference on Computer and Communications Security 2003: 210-219 |
52 | EE | Juan A. Garay, Philip D. MacKenzie, Ke Yang: Strengthening Zero-Knowledge Protocols Using Signatures. EUROCRYPT 2003: 177-194 |
51 | EE | Philip D. MacKenzie: An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack. Public Key Cryptography 2003: 47-61 |
50 | EE | Philip D. MacKenzie, Michael K. Reiter: Delegation of cryptographic servers for capture-resilient devices. Distributed Computing 16(4): 307-327 (2003) |
49 | EE | Philip D. MacKenzie, Michael K. Reiter: Networked cryptographic devices resilient to capture. Int. J. Inf. Sec. 2(1): 1-20 (2003) |
2002 | ||
48 | EE | Philip D. MacKenzie, Thomas Shrimpton, Markus Jakobsson: Threshold Password-Authenticated Key Exchange. CRYPTO 2002: 385-400 |
47 | Yair Frankel, Philip D. MacKenzie, Moti Yung: Adaptively secure distributed public-key systems. Theor. Comput. Sci. 287(2): 535-561 (2002) | |
2001 | ||
46 | EE | Philip D. MacKenzie, Michael K. Reiter: Delegation of cryptographic servers for capture-resilient devices. ACM Conference on Computer and Communications Security 2001: 10-19 |
45 | EE | Philip D. MacKenzie, Michael K. Reiter: Two-Party Generation of DSA Signatures. CRYPTO 2001: 137-154 |
44 | EE | Philip D. MacKenzie: More Efficient Password-Authenticated Key Exchange. CT-RSA 2001: 361-377 |
43 | EE | Philip D. MacKenzie, Michael K. Reiter: Networked Cryptographic Devices Resilient to Capture. IEEE Symposium on Security and Privacy 2001: 12-25 |
42 | EE | Yair Frankel, Philip D. MacKenzie, Moti Yung: Adaptive Security for the Additive-Sharing Based Proactive RSA. Public Key Cryptography 2001: 240-263 |
41 | EE | 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 | ||
40 | EE | Philip D. MacKenzie, Sarvar Patel, Ram Swaminathan: Password-Authenticated Key Exchange Based on RSA. ASIACRYPT 2000: 599-613 |
39 | EE | Victor Boyko, Philip D. MacKenzie, Sarvar Patel: Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman. EUROCRYPT 2000: 156-171 |
38 | Juan A. Garay, Philip D. MacKenzie: Concurrent Oblivious Transfer. FOCS 2000: 314-324 | |
37 | Yair Frankel, Philip D. MacKenzie, Moti Yung: "Psyeudorandom Intermixing": A Tool for Shared Cryptography. Public Key Cryptography 2000: 306-325 | |
36 | Irene Gassko, Peter Gemmell, Philip D. MacKenzie: Efficient and Fresh Cerification. Public Key Cryptography 2000: 342-353 | |
35 | Ronald Cramer, Ivan Damgård, Philip D. MacKenzie: Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. Public Key Cryptography 2000: 354-373 | |
34 | EE | Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie: Binary Exponential Backoff Is Stable for High Arrival Rates. STACS 2000: 169-180 |
33 | EE | 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 | EE | Juan A. Garay, Markus Jakobsson, Philip D. MacKenzie: Abuse-Free Optimistic Contract Signing. CRYPTO 1999: 449-466 |
30 | EE | Juan A. Garay, Philip D. MacKenzie: Abuse-Free Multi-party Contract Signing. DISC 1999: 151-165 |
29 | EE | Yair Frankel, Philip D. MacKenzie, Moti Yung: Adaptively-Secure Distributed Public-Key Systems. ESA 1999: 4-27 |
28 | EE | Philip D. MacKenzie, Jeffrey S. Sorensen: Anonymous Investing: Hiding the Identities of Stockholders. Financial Cryptography 1999: 212-229 |
27 | EE | Xiaotie Deng, Elias Koutsoupias, Philip D. MacKenzie: Competitive Implementation of Parallel Programs. Algorithmica 23(1): 14-30 (1999) |
26 | EE | 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 | EE | Yair Frankel, Philip D. MacKenzie, Moti Yung: Robust Efficient Distributed RSA-Key Generation. PODC 1998: 320 |
23 | EE | Philip D. MacKenzie, Vijaya Ramachandran: Computational Bounds for Fundamental Problems on General-Purpose Parallel Models. SPAA 1998: 152-163 |
22 | EE | Yair Frankel, Philip D. MacKenzie, Moti Yung: Robust Efficient Distributed RSA-Key Generation. STOC 1998: 663-672 |
21 | EE | 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 | EE | 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 | EE | Philip D. MacKenzie, Vijaya Ramachandran: ERCW PRAMs and Optical Communication. Theor. Comput. Sci. 196(1-2): 153-180 (1998) |
1997 | ||
17 | EE | Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung: Proactive RSA. CRYPTO 1997: 440-454 |
16 | EE | Leslie Ann Goldberg, Philip D. MacKenzie: Contention Resolution with Guaranteed Constant Expected Delay. FOCS 1997: 213-222 |
15 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | 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 | EE | 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 |