The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Philip D. MacKenzie: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.031secs, Finished in 0.035secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002