default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhilip D. MacKenzie
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j22]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
- [j21]Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang:
Resource Fairness and Composability of Cryptographic Protocols. J. Cryptol. 24(4): 615-658 (2011) - 2010
- [j20]Philip D. MacKenzie, Sarvar Patel, Ram Swaminathan:
Password-authenticated key exchange based on RSA. Int. J. Inf. Sec. 9(6): 387-410 (2010)
2000 – 2009
- 2006
- [j19]Philip D. MacKenzie, Thomas Shrimpton, Markus Jakobsson:
Threshold Password-Authenticated Key Exchange. J. Cryptol. 19(1): 27-66 (2006) - [j18]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Strengthening Zero-Knowledge Protocols Using Signatures. J. Cryptol. 19(2): 169-209 (2006) - [c46]Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan:
A Method for Making Password-Based Key Exchange Resilient to Server Compromise. CRYPTO 2006: 142-159 - [c45]Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang:
Resource Fairness and Composability of Cryptographic Protocols. TCC 2006: 404-428 - 2005
- [c44]Jonathan Katz, Philip D. MacKenzie, Gelareh Taban, Virgil D. Gligor:
Two-Server Password-Only Authenticated Key Exchange. ACNS 2005: 1-16 - [c43]Craig Gentry, Philip D. MacKenzie, Zulfikar Ramzan:
Password authenticated key exchange using hidden smooth subgroups. CCS 2005: 299-309 - [c42]Philip D. MacKenzie, Sarvar Patel:
Hard Bits of the Discrete Log with Applications to Password Authentication. CT-RSA 2005: 209-226 - [c41]Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie:
Universally Composable Password-Based Key Exchange. EUROCRYPT 2005: 404-421 - [i9]Ran Canetti, Shai Halevi, Jonathan Katz, Yehuda Lindell, Philip D. MacKenzie:
Universally Composable Password-Based Key Exchange. IACR Cryptol. ePrint Arch. 2005: 196 (2005) - [i8]Juan A. Garay, Philip D. MacKenzie, Manoj Prabhakaran, Ke Yang:
Resource Fairness and Composability of Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2005: 370 (2005) - 2004
- [j17]Philip D. MacKenzie, Michael K. Reiter:
Two-party generation of DSA signatures. Int. J. Inf. Sec. 2(3-4): 218-239 (2004) - [c40]Philip D. MacKenzie, Ke Yang:
On Simulation-Sound Trapdoor Commitments. EUROCRYPT 2004: 382-400 - [c39]Philip D. MacKenzie, Michael K. Reiter, Ke Yang:
Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract). TCC 2004: 171-190 - [i7]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness. IACR Cryptol. ePrint Arch. 2004: 9 (2004) - [i6]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Efficient and Universally Composable Committed Oblivious Transfer and Applications. IACR Cryptol. ePrint Arch. 2004: 53 (2004) - 2003
- [j16]Philip D. MacKenzie, Michael K. Reiter:
Delegation of cryptographic servers for capture-resilient devices. Distributed Comput. 16(4): 307-327 (2003) - [j15]Philip D. MacKenzie, Michael K. Reiter:
Networked cryptographic devices resilient to capture. Int. J. Inf. Sec. 2(1): 1-20 (2003) - [c38]Philip D. MacKenzie, Alina Oprea, Michael K. Reiter:
Automatic generation of two-party computations. CCS 2003: 210-219 - [c37]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Strengthening Zero-Knowledge Protocols Using Signatures. EUROCRYPT 2003: 177-194 - [c36]Philip D. MacKenzie:
An Efficient Two-Party Public Key Cryptosystem Secure against Adaptive Chosen Ciphertext Attack. Public Key Cryptography 2003: 47-61 - [i5]Juan A. Garay, Philip D. MacKenzie, Ke Yang:
Strengthening Zero-Knowledge Protocols using Signatures. IACR Cryptol. ePrint Arch. 2003: 37 (2003) - [i4]Philip D. MacKenzie, Ke Yang:
On Simulation-Sound Trapdoor Commitments. IACR Cryptol. ePrint Arch. 2003: 252 (2003) - 2002
- [j14]Yair Frankel, Philip D. MacKenzie, Moti Yung:
Adaptively secure distributed public-key systems. Theor. Comput. Sci. 287(2): 535-561 (2002) - [c35]Philip D. MacKenzie, Thomas Shrimpton, Markus Jakobsson:
Threshold Password-Authenticated Key Exchange. CRYPTO 2002: 385-400 - 2001
- [j13]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) - [c34]Philip D. MacKenzie, Michael K. Reiter:
Delegation of cryptographic servers for capture-resilient devices. CCS 2001: 10-19 - [c33]Philip D. MacKenzie, Michael K. Reiter:
Two-Party Generation of DSA Signatures. CRYPTO 2001: 137-154 - [c32]Philip D. MacKenzie:
More Efficient Password-Authenticated Key Exchange. CT-RSA 2001: 361-377 - [c31]Yair Frankel, Philip D. MacKenzie, Moti Yung:
Adaptive Security for the Additive-Sharing Based Proactive RSA. Public Key Cryptography 2001: 240-263 - [c30]Philip D. MacKenzie, Michael K. Reiter:
Networked Cryptographic Devices Resilient to Capture. S&P 2001: 12-25 - 2000
- [j12]Leslie Ann Goldberg, Philip D. MacKenzie, Mike Paterson, Aravind Srinivasan:
Contention resolution with constant expected delay. J. ACM 47(6): 1048-1096 (2000) - [c29]Philip D. MacKenzie, Sarvar Patel, Ram Swaminathan:
Password-Authenticated Key Exchange Based on RSA. ASIACRYPT 2000: 599-613 - [c28]Victor Boyko, Philip D. MacKenzie, Sarvar Patel:
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman. EUROCRYPT 2000: 156-171 - [c27]Juan A. Garay, Philip D. MacKenzie:
Concurrent Oblivious Transfer. FOCS 2000: 314-324 - [c26]Yair Frankel, Philip D. MacKenzie, Moti Yung:
"Psyeudorandom Intermixing": A Tool for Shared Cryptography. Public Key Cryptography 2000: 306-325 - [c25]Irene Gassko, Peter Gemmell, Philip D. MacKenzie:
Efficient and Fresh Cerification. Public Key Cryptography 2000: 342-353 - [c24]Ronald Cramer, Ivan Damgård, Philip D. MacKenzie:
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. Public Key Cryptography 2000: 354-373 - [c23]Hesham Al-Ammal, Leslie Ann Goldberg, Philip D. MacKenzie:
Binary Exponential Backoff Is Stable for High Arrival Rates. STACS 2000: 169-180 - [i3]Victor Boyko, Philip D. MacKenzie, Sarvar Patel:
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman. IACR Cryptol. ePrint Arch. 2000: 44 (2000) - [i2]Ronald Cramer, Ivan Damgård, Philip D. MacKenzie:
Efficient Zero-Knowledge Proofs of Knowledge Without Intractability Assumptions. IACR Cryptol. ePrint Arch. 2000: 45 (2000)
1990 – 1999
- 1999
- [j11]Xiaotie Deng, Elias Koutsoupias, Philip D. MacKenzie:
Competitive Implementation of Parallel Programs. Algorithmica 23(1): 14-30 (1999) - [j10]Markus Jakobsson, Philip D. MacKenzie, Julien P. Stern:
Secure and Lightweight Advertising on the Web. Comput. Networks 31(11-16): 1101-1109 (1999) - [j9]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) - [c22]Yair Frankel, Philip D. MacKenzie, Moti Yung:
Adaptively-Secure Optimal-Resilience Proactive RSA. ASIACRYPT 1999: 180-194 - [c21]Juan A. Garay, Markus Jakobsson, Philip D. MacKenzie:
Abuse-Free Optimistic Contract Signing. CRYPTO 1999: 449-466 - [c20]Yair Frankel, Philip D. MacKenzie, Moti Yung:
Adaptively-Secure Distributed Public-Key Systems. ESA 1999: 4-27 - [c19]Philip D. MacKenzie, Jeffrey S. Sorensen:
Anonymous Investing: Hiding the Identities of Stockholders. Financial Cryptography 1999: 212-229 - [c18]Juan A. Garay, Philip D. MacKenzie:
Abuse-Free Multi-party Contract Signing. DISC 1999: 151-165 - 1998
- [j8]Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman:
On Contention Resolution Protocols and Associated Probabilistic Phenomena. J. ACM 45(2): 324-378 (1998) - [j7]Philip D. MacKenzie, Quentin F. Stout:
Ultafast Expected Time Parallel Algorithms. J. Algorithms 26(1): 1-33 (1998) - [j6]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) - [j5]Philip D. MacKenzie, Vijaya Ramachandran:
ERCW PRAMs and Optical Communication. Theor. Comput. Sci. 196(1-2): 153-180 (1998) - [c17]Yair Frankel, Philip D. MacKenzie, Moti Yung:
Robust Efficient Distributed RSA-Key Generation. PODC 1998: 320 - [c16]Philip D. MacKenzie, Vijaya Ramachandran:
Computational Bounds for Fundamental Problems on General-Purpose Parallel Models. SPAA 1998: 152-163 - [c15]Yair Frankel, Philip D. MacKenzie, Moti Yung:
Robust Efficient Distributed RSA-Key Generation. STOC 1998: 663-672 - 1997
- [j4]Philip D. MacKenzie:
Lower Bounds for Randomized Exclusive Write PRAMs. Theory Comput. Syst. 30(6): 599-626 (1997) - [j3]Philip D. MacKenzie:
The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms. SIAM J. Comput. 26(6): 1559-1580 (1997) - [c14]Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung:
Proactive RSA. CRYPTO 1997: 440-454 - [c13]Leslie Ann Goldberg, Philip D. MacKenzie:
Contention Resolution with Guaranteed Constant Expected Delay. FOCS 1997: 213-222 - [c12]Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung:
Optimal Resilience Proactive Public-Key Cryptosystems. FOCS 1997: 384-393 - 1996
- [c11]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 - [c10]Philip D. MacKenzie, Vijaya Ramachandran:
ERCW PRAMs and Optical Communication. Euro-Par, Vol. II 1996: 293-302 - [c9]Leslie Ann Goldberg, Philip D. MacKenzie:
Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. SODA 1996: 554-563 - [i1]Yair Frankel, Peter Gemmell, Philip D. MacKenzie, Moti Yung:
Proactive RSA. IACR Cryptol. ePrint Arch. 1996: 12 (1996) - 1995
- [j2]Philip D. MacKenzie:
A Separation Between Reconfigurable Mesh Models. Parallel Process. Lett. 5: 15-22 (1995) - [c8]Philip D. MacKenzie:
Lower Bounds for Randomized Exclusive Write PRAMs. SPAA 1995: 254-263 - [c7]Philip D. MacKenzie:
A lower bound for the QRQW PRAM. SPDP 1995: 231-237 - 1994
- [c6]Leslie Ann Goldberg, Mark Jerrum, Philip D. MacKenzie:
An W(log log n) Lower Bound for Routing in Optical Networks. SPAA 1994: 147-156 - [c5]Philip D. MacKenzie, C. Greg Plaxton, Rajmohan Rajaraman:
On contention resolution protocols and associated probabilistic phenomena. STOC 1994: 153-162 - 1993
- [j1]Philip D. MacKenzie:
A Lower Bound for Order-Preserving Broadcast in the Postal Model. Parallel Process. Lett. 3: 313-320 (1993) - [c4]Philip D. MacKenzie:
A Separation Between Reconfigurable Mesh Models. IPPS 1993: 84-88 - [c3]Philip D. MacKenzie, Quentin F. Stout:
Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs. SPAA 1993: 224-229 - 1992
- [b1]Philip D. MacKenzie:
Parallel algorithms with ultra-fast expected times. University of Michigan, USA, 1992 - [c2]Philip D. MacKenzie:
Load Balancing Requires Omega(log*n) Expected Time. SODA 1992: 94-99 - 1991
- [c1]Philip D. MacKenzie, Quentin F. Stout:
Ultra-Fast Expected Time Parallel Algorithms. SODA 1991: 414-423
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 18:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
