This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Some citation information for these papers can be found at Google Scholar.
This is not a complete list of my publications. Please see my curriculum vitae for a complete list.
| A | C | D | E | F | H | I | J | N | O | P | R | S | T | U |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
ACNS
ASPLOS |
C & C
CCS CHI Comp. J. Comp. Net. CRYPTO CSF |
DCCA
DISC DC DNS |
EC (ACM)
EC (Usenix) ESORICS EUROCRYPT EuroSys |
FC | HPC |
ICDCS
ICICS ICNP I & C IJIS IPDPS ISC |
JCS
JoC |
NDSS
NSDI |
Oakland | PODC | RAID |
SOSP
SOUPS SRDS STOC |
TC
TCC TCS TISSEC TKDE TOCS TOPLAS TPDS TSE |
Usenix ATC
Usenix Sec. |
Back to Michael Reiter's home page
ACM Conference on Computer and Communications Security (CCS) [© ACM]
ACM Conference on Electronic Commerce (EC) [© ACM]
| 2000 | Privacy-preserving global customization
R. M. Arlein, B. Jai, M. Jakobsson, F. Monrose, and M. K. Reiter. Pages 176–184. doi:10.1145/352871.352891 |
ACM Conference on Human Factors in Computing Systems (CHI) [© ACM]
| 2008 | A user study of policy creation
in a flexible access-control system
L. Bauer, L. F. Cranor, R. W. Reeder, M. K. Reiter and K. Vaniea. Pages 543–552. doi:10.1145/1357054.1357143 |
| Expandable grids for visualizing and
authoring computer security policies
R. W. Reeder, L. Bauer, L. F. Cranor, M. K. Reiter, K. Bacon, K. How, and H. Strong. Pages 1473–1482. doi:10.1145/1357054.1357285 |
ACM Symposium on Operating Systems Principles (SOSP) [© ACM]
| 2007 | Low-overhead Byzantine fault-tolerant
storage
J. Hendricks, G. R. Ganger and M. K. Reiter. Pages 73–86. doi:10.1145/1294261.1294269 |
| 2005 | Fault-scalable Byzantine
fault-tolerant services
M. Abd-El-Malek, G. R. Ganger, G. R. Goodson, M. K. Reiter, and J. J. Wylie. Pages 59–74. doi:10.1145/1095810.1095817 |
ACM Symposium on Principles of Distributed Computing (PODC) [© ACM]
ACM Symposium on Theory of Computing (STOC) [© ACM]
| 1997 | Byzantine quorum systems
D. Malkhi and M. Reiter. Pages 569–578. doi:10.1145/258533.258650 Note: This paper is superceded by the journal version. |
ACM Transactions on Computer Systems (TOCS) [© ACM]
| 1994 | A security architecture for
fault-tolerant systems
M. K. Reiter, K. P. Birman, and R. van Renesse. 12(4):340–371. doi:10.1145/195792.195823 |
ACM Transactions on Information and System Security (TISSEC) [© ACM]
| 2001 | An authorization model for a public
key management service
P. Samarati, M. K. Reiter and S. Jajodia. 4(4):453–482. doi:10.1145/503339.503343 |
| 1999 | Authentication
metric analysis and design
M. K. Reiter and S. G. Stubblebine. 2(2):138–158. doi:10.1145/317087.317088 |
| 1998 | Crowds: Anonymity for web
transactions
M. K. Reiter and A. D. Rubin. 1(1):66–92. doi:10.1145/290163.290168 |
ACM Transactions on Programming Languages and Systems (TOPLAS) [© ACM]
| 1994 | How to securely replicate services
M. K. Reiter and K. P. Birman. 16(3):986–1009, May 1994. doi:10.1145/177492.177745 |
Applied Cryptography and Network Security (ACNS) [© Springer-Verlag]
| 2005 | Building reliable
mix networks with fair exchange
M. K. Reiter, X. Wang and M. Wright. Lecture Notes in Computer Science 3531, pages 378–392. doi:10.1007/11496137_26 |
| 2004 | Private keyword-based push and pull
with applications to anonymous communication
L. Kissner, A. Oprea, M. K. Reiter, D. Song, and K. Yang. Lecture Notes in Computer Science 3089, pages 16–30. |
The Computer Journal [© British Computer Society]
| 1995 | Securing
causal relationships in distributed systems
M. K. Reiter and L. Gong. 38(8):633–642. doi:10.1093/comjnl/38.8.633 |
| 1999 | On the security of pay-per-click and
other Web advertising schemes
V. Anupam, A. Mayer, K. Nissim, B. Pinkas, and M. K. Reiter. 31(11–16):1091–1100. doi:10.1016/S1389-1286(99)00023-7 |
Concurrency and Computation: Practice and Experience
| 2002 | Advanced concurrency control in Java
P. Felber and M. K. Reiter. 14(4):261–285. doi:10.1002/cpe.635 |
| 2001 | Two party generation of DSA
signatures
P. MacKenzie and M. K. Reiter. Lecture Notes in Computer Science 2139. Note: This paper is superceded by the journal version. |
Distributed Computing [© Springer-Verlag]
| 2003 | Objects shared by
Byzantine processes
D. Malkhi, M. Merritt, M. K. Reiter, and G. Taubenfeld. 16(1)37–48. doi:10.1007/s00446-002-0075-3 |
| Delegation of
cryptographic servers for capture-resilient devices
P. MacKenzie and M. K. Reiter. 16(4):307–327. doi:10.1007/s00446-003-0098-4 | |
| 1998 | Byzantine quorum
systems
D. Malkhi and M. Reiter. 11(4):203–213. doi:10.1007/s004460050050 |
| 1996 | Low-exponent RSA with related
messages
D. Coppersmith, M. Franklin, J. Patarin, and M. Reiter. Lecture Notes in Computer Science 1070, pages 1–9. |
| 1995 | Verifiable signature sharing
M. K. Franklin and M. K. Reiter. Lecture Notes in Computer Science 921, pages 50–63. |
European Conference on Computer Systems (EuroSys) [© ACM]
| 2008 | Flicker: An execution
infrastructure for TCB minimization
J. M. McCune, B. Parno, A. Perrig, M. K. Reiter and H. Isozaki. Pages 315–328. doi:10.1145/1352592.1352625 |
European Symposium on Research in Computer Security (ESORICS) [© Springer-Verlag]
| 2007 | Efficient proving for
practical distributed access-control systems
L. Bauer, S. Garriss and M. K. Reiter. Lecture Notes in Computer Science 4734, pages 19–37. doi:10.1007/978-3-540-74835-9_3 |
| 2006 | Finding peer-to-peer file-sharing
using coarse network behaviors
M. P. Collins and M. K. Reiter. Lecture Notes in Computer Science 4189, pages 1–17. doi:10.1007/11863908_1 |
| A linear logic of authorization
and knowledge
D. Garg, L. Bauer, K. D. Bowers, F. Pfenning and M. K. Reiter. Lecture Notes in Computer Science 4189, pages 297–312. doi:10.1007/11863908_19 |
IEEE Computer Security Foundations (CSF) [© IEEE]
| 1997 | Unreliable intrusion detection in
distributed computations
D. Malkhi and M. Reiter. Pages 116–124. doi:10.1109/CSFW.1997.596799 |
| 1996 | A high-throughput secure reliable
multicast protocol
D. Malki and M. Reiter. Pages 9–17. doi:10.1109/CSFW.1996.503686 Note: This paper is superceded by the journal version. |
IEEE International Conference on Network Protocols (ICNP) [© IEEE]
| 2006 | Forensic analysis for epidemic attacks in federated networks
Y. Xie, V. Sekar, M. K. Reiter and H. Zhang. Pages 43–53. doi:10.1109/ICNP.2006.320197 |
IEEE International Parallel and Distributed Processing Symposium (IPDPS) [© IEEE]
| 2008 | Self-optimizing distributed trees
M. K. Reiter, A. Samar and C. Wang. |
IEEE International Symposium on High Performance Distributed Computing [© IEEE]
| 2002 | A secure distributed search
system
Y. Xie, D. O'Hallaron and M. K. Reiter. Pages 321–330. doi:10.1109/HPDC.2002.1029932 |
IEEE Symposium on Reliable Distributed Systems (SRDS) [© IEEE]
IEEE Symposium on Security and Privacy (Oakland) [© IEEE]
IEEE Transactions on Computers (TC) [© IEEE]
| 1998 | Resilient
authentication using path independence
M. K. Reiter and S. G. Stubblebine. 47(12):1351–1362. doi:10.1109/12.737682 |
IEEE Transactions on Knowledge and Data Engineering (TKDE) [© IEEE]
| 2000 | An architecture for
survivable coordination in large distributed systems
D. Malkhi and M. K. Reiter. 12(2):187–202. doi:10.1109/69.842262 |
IEEE Transactions on Parallel and Distributed Systems (TPDS) [© IEEE]
| 2007 | Quiver: Consistent object
sharing for edge services
M. K. Reiter and A. Samar. doi:10.1109/TPDS.2007.70790 |
| 2001 | On k-set
consensus problems in asynchronous systems
R. De Prisco, D. Malkhi, and M. K. Reiter. 12(1):7–21. doi:10.1109/71.899936 |
| Fault detection for
Byzantine quorum systems
L. Alvisi, D. Malkhi, E. Pierce, and M. K. Reiter. 12(9):996–1007. doi:10.1109/71.954640 |
IEEE Transactions on Software Engineering (TSE) [© IEEE]
| 2000 | Secure
execution of Java applets using a remote playground
D. Malkhi and M. K. Reiter. 26(12):1197–1209. doi:10.1109/32.888632 |
| 1996 | A secure group
membership protocol
M. K. Reiter. 22(1):31–42. doi:10.1109/32.481515 |
| The design and
implementation of a secure auction service
M. K. Franklin and M. K. Reiter. 22(5):302–312. doi:10.1109/32.502223 |
IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) [© IEEE]
| 2007 | Minimizing response time
for quorum-system protocols over wide-area networks
F. Oprea and M. K. Reiter. Pages 409–418. doi:10.1109/DSN.2007.66 |
| 2006 | A multi-resolution
approach for worm detection and containment
V. Sekar, Y. Xie, M. K. Reiter and H. Zhang. Pages 189–198. doi:10.1109/DSN.2006.6 |
| 2004 | Efficient Byzantine-tolerant
erasure-coded storage
G. R. Goodson, J. J. Wylie, G. R. Ganger and M. K. Reiter. doi:10.1109/DSN.2004.1311884 |
| 2000 | Dynamic Byzantine quorum systems
L. Alvisi, D. Malkhi, E. Pierce, M. K. Reiter, and R. N. Wright. Pages 283–292. doi:10.1109/ICDSN.2000.857551 |
IFIP Working Conference on Dependable Computing for Critical Applications (DCCA) [© IEEE]
| 1999 | Fault detection for Byzantine quorum
systems
L. Alvisi, D. Malkhi, L. Pierce, and M. K. Reiter. Pages 357–371. doi:10.1109/DCFTS.1999.814307 Note: This paper is superceded by the journal version. |
| 2001 | Probabilistic quorum
systems
D. Malkhi, M. K. Reiter, A. Wool, and R. N. Wright. 170(2): 184–206. doi:10.1006/inco.2001.3054 |
Information Security Conference (ISC) [© Springer-Verlag]
| 2004 | Device-enabled authorization in the
Grey system
L. Bauer, S. Garriss, J. M. McCune, M. K. Reiter, J. Rouse, and P. Rutenbar. Lecture Notes in Computer Science 3650, pages 431–445. doi:10.1007/11556992_31 |
International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) [© ACM]
| 2008 | How low can you go? Recommendations
for hardware-supported minimal TCB code execution
J. M. McCune, B. Parno, A. Perrig, M. K. Reiter and A. Seshadri. Pages 14–25. doi:10.1145/1346281.1346285 |
International Conference on Distributed Computing Systems (ICDCS) [© IEEE]
| 2006 | M2: Multicasting mixes for efficient and anonymous communication
G. Perng, M. K. Reiter and C. Wang. doi:10.1109/ICDCS.2006.53 |
| 2001 | Backoff protocols for distributed mutual
exclusion and ordering
G. Chockler, D. Malkhi, and M. K. Reiter. Pages 11–20. doi:10.1109/ICDSC.2001.918928 |
International Conference on Financial Cryptography (FC) [© Springer-Verlag]
| 2004 | Timing attacks in low-latency
mix systems
B. N. Levine, M. K. Reiter, C. Wang and M. Wright. Lecture Notes in Computer Science 3110, pages 251–265. |
International Conference on Information and Communications Security (ICICS) [© Springer-Verlag]
| 2004 | Time-scoped searching of encrypted
audit logs
D. Davis, F. Monrose and M. K. Reiter. Lecture Notes in Computer Science 3269, pages 532–545. |
International Journal of Information Security [© Springer]
| 2007 | A multi-layer
framework for puzzle-based denial-of-service defense
X. Wang and M. K. Reiter. doi:10.1007/s10207-007-0042-x |
| 2004 | Two-party
generation of DSA signatures
P. MacKenzie and M. K. Reiter. 2(3–4):218–239. doi:10.1007/s10207-004-0041-0 |
| 2003 | Networked
cryptographic devices resilient to capture
P. MacKenzie and M. K. Reiter. 2(1):1–20. doi:10.1007/s10207-003-0022-8 |
| 2002 | Password hardening
based on keystroke dynamics
F. Monrose, M. K. Reiter, and S. G. Wetzel. 1(2):69–83. doi:10.1007/s102070100006 |
International Symposium on Distributed Computing (DISC) [© Springer-Verlag]
| 2007 | Probabilistic opaque quorum systems
M. G. Merideth and M. K. Reiter. Lecture Notes in Computer Science 4731, pages 403–419. doi:10.1007/978-3-540-75142-7_31 |
| 2006 | On consistency of encrypted files
A. Oprea and M. K. Reiter. Lecture Notes in Computer Science 4167, pages 254–268. doi:10.1007/11864219_18 |
| 2000 | Objects shared by Byzantine
processes
D. Malkhi, M. Merritt, M. K. Reiter, and G. Taubenfeld. Lecture Notes in Computer Science 1914, pages 345–359. Note: This paper is superceded by the journal version. |
International Symposium on Recent Advances in Intrusion Detection (RAID) [© Springer-Verlag]
| 2007 | Hit-list worm detection and bot
identification in large networks using protocol graphs
M. P. Collins and M. K. Reiter. Lecture Notes in Computer Science 4637, pages 276–295. doi:10.1007/978-3-540-74320-0_15 |
| 2006 | Behavioral distance measurement using hidden Markov models
D. Gao, M. K. Reiter and D. Song. Lecture Notes in Computer Science 4219, pages 19–40. doi:10.1007/11856214_2 |
| 2005 | Behavioral distance for intrusion detection
D. Gao, M. K. Reiter and D. Song. Lecture Notes in Computer Science 3858, pages 63–81. doi:10.1007/11663812_4 |
| 2004 | Seurat: A pointillist
approach to anomaly detection
Y. Xie, H. Kim, D. R. O'Hallaron, M. K. Reiter and H. Zhang. Lecture Notes in Computer Science 3224, pages 238–257. |
Internet Society Network and Distributed System Security Symposium (NDSS) [© Internet Society]
| 2008 | Taming the devil: Techniques for
evaluating anonymized network data
S. E. Coull, C. V. Wright, A. D. Keromytis, F. Monrose and M. K. Reiter. Pages 125–135. Note: The version posted here corrects notational errors in the published version. |
| 2007 | Playing devil's advocate: Inferring
sensitive information from anonymized network traces
S. E. Coull, C. V. Wright, F. Monrose, M. P. Collins and M. K. Reiter. Pages 35–47. |
| Consumable credentials in
logic-based access control
K. D. Bowers, L. Bauer, D. Garg, F. Pfenning, and M. K. Reiter. Pages 143–157. | |
| 2005 | Space-efficient block storage
integrity
A. Oprea, M. K. Reiter and K. Yang. Pages 17–28. |
| 1997 | A high-throughput
secure reliable multicast protocol
D. Malkhi and M. Reiter. 5:113–127. |
| 1996 | The
Ω key management service
M. K. Reiter, M. K. Franklin, J. B. Lacy, and R. N. Wright. 4(4):267–287. |
Security and Privacy in Digital Rights Management [© Springer-Verlag]
| 2002 | Discouraging software piracy using
software aging
M. Jakobsson and M. K. Reiter. Lecture Notes in Computer Science 2320. |
| 2000 | The load and
availability of Byzantine quorum systems
D. Malkhi, M. K. Reiter, and A. Wool. 29(6):1889–1906. doi:10.1137/S0097539797325235 |
Symposium on Usable Privacy and Security (SOUPS)
| 2007 | Lessons learned from the deployment
of a smartphone-based access-control system
L. Bauer, L. F. Cranor, M. K. Reiter and K. Vaniea. Pages 64–75. doi:10.1145/1280680.1280689 |
| 2003 | Diffusion without
false rumors: On propagating updates in a Byzantine environment
D. Malkhi, Y. Mansour and M. K. Reiter. 299(1–3):289–306. doi:10.1016/S0304-3975(02)00325-0 |
Theory of Cryptography Conference (TCC) [© Springer-Verlag]
| 2004 | Alternatives to non-malleability:
Definitions, constructions, and applications
P. MacKenzie, M. K. Reiter and K. Yang. Lecture Notes in Computer Science 2951, pages 171–190. |
USENIX Annual Technical Conference
| 2006 | Bump in the ether:
A framework for securing sensitive user input
J. M. McCune, A. Perrig and M. K. Reiter. Pages 185–198. |
| 2007 | Integrity checking
in cryptographic file systems with constant trusted storage
A. Oprea and M. K. Reiter. Pages 183–198. |
| On web browsing privacy in anonymized NetFlows
S. E. Coull, M. P. Collins, C. V. Wright, F. Monrose, and M. K. Reiter. Pages 339–352. | |
| 2004 | On gray-box
program tracking for anomaly detection
D. Gao, M. K. Reiter and D. Song. Pages 103–118. |
| On user
choice in graphical password schemes
D. Davis, F. Monrose and M. K. Reiter. Pages 151–164. | |
| 2002 | Toward speech-generated cryptographic
keys on resource constrained devices
F. Monrose, M. K. Reiter, Q. Li, D. P. Lopresti, and C. Shih. Pages 283–296. |
| 1999 | The design and analysis of graphical
passwords
I. Jermyn, A. Mayer, F. Monrose, A. Rubin, and M. K. Reiter. Pages 1–14. |
USENIX Symposium on Networked Systems Design and Implementation (NSDI)
| 2008 | cSamp: A system for network-wide
flow monitoring
V. Sekar, M. K. Reiter, W. Willinger, H. Zhang, R. R. Kompella, and D. G. Andersen. Pages 233–246. |
USENIX Workshop on Electronic Commerce
| 1998 | Detecting hit shaving in click-through
payment schemes
M. K. Reiter, V. Anupam, and A. Mayer. Pages 155–166. |