The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
COCA: A secure distributed online certification authority
Abstract
COCA is a fault-tolerant and secure online certification authority that has been built and deployed both in a local area network and in the Internet. Extremely weak assumptions characterize environments in which COCA's protocols execute correctly: no assumption is made about execution speed and message delivery delays; channels are expected to exhibit only intermittent reliability; and with 3 t+ 1 COCA servers up to t may be faulty or compromised. COCA is the first system to integrate a Byzantine quorum system (used to achieve availability) with proactive recovery (used to defend against mobile adversaries which attack, compromise, and control one replica for a limited period of time before moving on to another). In addition to tackling problems associated with combining fault-tolerance and security, new proactive recovery protocols had to be developed. Experimental results give a quantitative evaluation for the cost and effectiveness of the protocols.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Blind Signatures for Untraceable Payments
Chaum, D. (1983) · Advances in Cryptology · doi:10.1007/978-1-4757-0602-4_18 · Cited by 3,260
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Protocols for secure computations
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.88 · Cited by 2,661
Completeness theorems for non-cryptographic fault-tolerant distributed computation
Ben-Or, M., & Wigderson, A. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62213 · Cited by 2,524
Security without identification: transaction systems to make big brother obsolete
Chaum, D. (1985) · Communications of the ACM · doi:10.1145/4372.4373 · Cited by 1,666
Multiparty unconditionally secure protocols
Chaum, D., Crépeau, C., & Damgard, I. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62214 · Cited by 1,544
Efficient dispersal of information for security, load balancing, and fault tolerance
Rabin, M. O. (1989) · Journal of the ACM · doi:10.1145/62044.62050 · Cited by 1,365
Desmedt, Y., & Frankel, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_28 · Cited by 1,131
A practical scheme for non-interactive verifiable secret sharing
Feldman, P. (1987) · 28th Annual Symposium on Foundations of Computer Science (sfcs 1987) · doi:10.1109/sfcs.1987.4 · Cited by 1,125
Zimmermann, P. R. (1996) · Cited by 889
X.509 Internet Public Key Infrastructure Online Certificate Status Protocol - OCSP
Santesson, S., Myers, M., Ankney, R., Malpani, A., Galperin, S., & Adams, C. (2013) · doi:10.17487/rfc6960 · Cited by 804
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
Herzberg, A., Jarecki, S., Krawczyk, H., & Yung, M. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_27 · Cited by 738
Authentication in distributed systems: theory and practice
Lampson, B., Abadi, M., Burrows, M., & Wobber, E. (1992) · ACM Transactions on Computer Systems · doi:10.1145/138873.138874 · Cited by 607
Freier, A. O., Kocher, P. C., & Karlton, P. (1996) · Cited by 582
Authentication in distributed systems: a bibliography
Liebl, A. (1993) · ACM SIGOPS Operating Systems Review · doi:10.1145/163640.163643 · Cited by 534
Malkhi, D., & Reiter, M. (1998) · Distributed Computing · doi:10.1007/s004460050050 · Cited by 530
Client Puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks.
Juels, A., & Brainard, J. (1999) · Network and Distributed System Security Symposium · Cited by 488
Analysis of a denial of service attack on TCP
Schuba, C. L., Krsul, I. V., Kuhn, M. G., Spafford, E. H., Sundaram, A., & Zamboni, D. (1997) · Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097) · doi:10.1109/secpri.1997.601338 · Cited by 487
How to withstand mobile virus attacks (extended abstract)
Ostrovsky, R., & Yung, M. (1991) · Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 · doi:10.1145/112600.112605 · Cited by 465
X.509 Internet Public Key Infrastructure Online Certificate Status Protocol - OCSP
Myers, M., Ankney, R., Malpani, A., Galperin, S., & Adams, C. (1999) · doi:10.17487/rfc2560 · Cited by 448
Robust Threshold DSS Signatures
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_31 · Cited by 427
Shared generation of authenticators and signatures
Desmedt, Y., & Frankel, Y. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_37 · Cited by 394
Practical Byzantine fault tolerance
de Castro, O. T., & Miguel, M. D. (2000) · Cited by 372
Modelling a public-key infrastructure
Maurer, U. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-61770-1_45 · Cited by 324
Desmedt, Y. G. (1994) · European Transactions on Telecommunications · doi:10.1002/ett.4460050407 · Cited by 292
A simplified approach to threshold and proactive RSA
Rabin, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055722 · Cited by 262
Proactive public key and signature systems
Herzberg, A., Jakobsson, M., Jarecki, S., Krawczyk, H., & Yung, M. (1997) · Proceedings of the 4th ACM conference on Computer and communications security · doi:10.1145/266420.266442 · Cited by 253
On certificate revocation and validation
Kocher, P. C. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055481 · Cited by 230
Survivable information storage systems
Wylie, J. J., Bigrigg, M. W., Strunk, J. D., Ganger, G. R., Kiliccote, H., & Khosla, P. K. (2000) · Computer · doi:10.1109/2.863969 · Cited by 218
Optimal-resilience proactive public-key cryptosystems
Frankel, Y., Gemmell, P., MacKenzie, P. D., & Yung, M. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646127 · Cited by 217
Robust and Efficient Sharing of RSA Functions
Gennaro, R., Jarecki, S., Krawczyk, H., & Rabin, T. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_13 · Cited by 189
The Digital Distributed System Security Architecture
Gasser, M., Goldstein, A., Kaufman, C., & Lampson, B. (1989) · Cited by 186
Can we eliminate certificate revocation lists?
Rivest, R. L. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055482 · Cited by 181
The Rampart toolkit for building high-integrity services
Reiter, M. K. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60042-6_7 · Cited by 174
Proactive recovery in a Byzantine-fault-tolerant system
Castro, M., & Liskov, B. H. (2000) · doi:10.5555/1251229.1251248 · Cited by 174
Frankel, Y., Gemmell, P., MacKenzie, P. D., & Yung, M. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052254 · Cited by 168
A formal framework and evaluation method for network denial of service
Meadows, C. (2003) · Proceedings of the 12th IEEE Computer Security Foundations Workshop · doi:10.1109/csfw.1999.779758 · Cited by 166
Shared Generation of Authenticators and Signatures (Extended Abstract)
Desmedt, Y., & Frankel, Y. (1991) · UCL Discovery (University College London) · Cited by 159
Some recent research aspects of threshold cryptography
Desmedt, Y. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0030418 · Cited by 158
Secure and scalable replication in Phalanx
Malkhi, D., & Reiter, M. K. (2002) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/reldis.1998.740474 · Cited by 157
A cost-based framework for analysis of denial of service in networks
Meadows, C. A. (2001) · Journal of Computer Security · doi:10.3233/jcs-2001-91-206 · Cited by 137
Photuris: Session-Key Management Protocol
Karn, P., & Simpson, W. (1999) · doi:10.17487/rfc2522 · Cited by 134
A Note on Denial-of-Service in Operating Systems
Gligor, V. D. (1984) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1984.5010241 · Cited by 131
SPX: global authentication using public key certificates
Tardo, J. J., & Alagappan, K. (2002) · IEEE Computer Society Symposium on Research in Security and Privacy · doi:10.1109/risp.1991.130791 · Cited by 126
Zhou, L., Schneider, F. B., & van Renesse, R. (2005) · ACM Transactions on Information and System Security · doi:10.1145/1085126.1085127 · Cited by 118
Self-citationIncreasing availability and security of an authentication service
Gong, L. (1993) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.223866 · Cited by 115
Building intrusion tolerant applications
Malkin, M., Wu, T. D., & Boneh, D. (2002) · DARPA Information Survivability Conference and Exposition · doi:10.1109/discex.2000.824963 · Cited by 107
Maintaining Security in the Presence of Transient Faults
Canetti, R., & Herzberg, A. (2007) · Springer eBooks · doi:10.1007/3-540-48658-5_38 · Cited by 106
Secure distributed storage and retrieval
Garay, J. A., Gennaro, R., Jutla, C. S., & Rabin, T. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(98)00263-1 · Cited by 97
Distributing trust with the Rampart toolkit
Reiter, M. K. (1996) · Communications of the ACM · doi:10.1145/227210.227228 · Cited by 88
A security architecture for fault-tolerant systems
Reiter, M. K., Birman, K., & van Renesse, R. (1994) · ACM Transactions on Computer Systems · doi:10.1145/195792.195823 · Cited by 69
Recent-secure authentication: enforcing revocation in distributed systems
Stubblebine, S. G. (2002) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/secpri.1995.398935 · Cited by 61
Path independence for authentication in large-scale systems
Reiter, M. K., & Stubblebine, S. G. (1997) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/266420.266435 · Cited by 60
Revocation: Options and Challenges
Myers, M. D. (1998) · Financial Cryptography · Cited by 54
Solving Consensus in a Byzantine Environment Using an Unreliable Fault Detector.
Kihlstrom, K. P., Moser, L. E., & Melliar-Smith, P. M. (1997) · Cited by 53
Certificate revocation: Mechanics and meaning
Fox, B. L., & LaMacchia, B. A. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055479 · Cited by 50
A Response to “Can We Eliminate Certificate Revocation Lists?”
McDaniel, P. D., & Rubin, A. D. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45472-1_17 · Cited by 48
Reiter, M. K., Franklin, M. K., Lacy, J. B., et al. (1996) · Journal of Computer Security · doi:10.3233/jcs-1996-4402 · Cited by 35
Protecting Key Exchange and Management Protocols Against Resource Clogging Attacks
Oppliger, R. (1999) · Secure Information Networks · doi:10.1007/978-0-387-35568-9_11 · Cited by 22
Cited by
Fault-scalable Byzantine fault-tolerant services
Abd-El-Malek, M., Ganger, G. R., Goodson, G. R., Reiter, M. K., & Wylie, J. J. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095817 · Cited by 368
Efficient Byzantine Fault-Tolerance
Veronese, G. S., Correia, M., Bessani, A. N., Lung, L. C., & Verissimo, P. (2013) · IEEE Transactions on Computers · doi:10.1109/tc.2011.221 · Cited by 337
Separating agreement from execution for byzantine fault tolerant services
Yin, J., Martin, J.-P., Venkataramani, A., Alvisi, L., & Dahlin, M. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945470 · Cited by 309
URSA: Ubiquitous and Robust Access Control for Mobile Ad Hoc Networks
Luo, H., Kong, J., Zerfos, P., Lu, S., & Zhang, L. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.838598 · Cited by 294
Survivable zero trust for cloud computing environments
Ferretti, L., Magnanini, F., Andreolini, M., & Colajanni, M. (2021) · Computers & Security · doi:10.1016/j.cose.2021.102419 · Cited by 69
Metadata
- Authors
- Zhou, L., Schneider, F. B., & Van Renesse, R.
- Venue
- ACM Transactions on Computer Systems
- Published
- 2002-11
- Volume
- 20
- Issue
- 4
- Pages
- 329-368
- ISSN
- 0734-2071 (ISSN-L)
- 1557-7333
- OpenAlex
- W2095202767
- Cited by
- 278
- References
- 63
- FWCI
- 30.74
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.