Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/319709.319713acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
Article
Free access

The proactive security toolkit and applications

Published: 01 November 1999 Publication History

Abstract

Existing security mechanisms focus on prevention of penetrations, detection of a penetration and (manual) recovery tools Indeed attackers focus their penetration efforts on breaking into critical modules, and on avoiding detection of the attack. As a result, security tools and procedures may cause the attackers to lose control over a specific module (computer, account), since the attacker would rather lose control than risk detection of the attack. While controlling the module, attacker may learn critical secret information or modify the module that make it much easier for the attacker to regain control over that module later. Recent results in cryptography give some hope of improving this situation; they show that many fundamental security tasks can be achieved with proactive security. Proactive security does not assume that there is any module completely secure against penetration Instead, we assume that at any given time period (day, week,.), a sufficient number of the modules in the system are secure (not penetrated). The results obtained so far include some of the most important cryptographic primitives such as signatures, secret sharing, and secure communication However, there was no usable implementation, and several critical issues (for actual use) were not addressed
In this work we report on a practical toolkit implementing the key proactive security mechanisms The toolkit provides secure interfaces to make it easy for applications to recover from penetrations. The toolkit also addresses other critical implementation issues, such as the initialization of the proactive secure system.
We describe the toolkit and discuss some of the potential applications. Some applications require minimal enhancements to the existing implementations - e.g. for secure logging (especially for intrusion detection), secure end-to-end communication and timestamping. Other applications require more significant enhancements, mainly distribution over multiple servers, examples are certification authority, key recovery, and secure file system or archive

References

[1]
H. Attiya, and J. Welch, D~strlbuted Computing" fundamentals, stmulattons and advanced topics Mc.Grow-Hill, 1998
[2]
G.R. Blakley, Safeguarding cryptographic keys. In Proc. AFIPS 1979 National Computer Conference, pp. 313-317. AFIPS, t 979.
[3]
D. Boneh and M. Franklin. Efficient generauon of shared RSA keys. In Proc. Crypto '97, pp. 425-539.
[4]
R. Canetti, R. Gennaro, A. Herzberg and D. Naor, Proactive Securay: Long-term protection against break-ins. CryptoBytes: the technical newsletter of RSA Labs, Vol. 3, number 1 - Spring, 1997.
[5]
R. Canetti, S. Halevi, and A. Herzberg. "Maintaining authenticated communication in the presence of break-ins". To be published in Journal of Cryptography, 1999. An extended abstract of this paper appeared in the Proceedings of the 16th ACM Symp. on Principles of Distributed Computation. 1997.
[6]
R. Canetti and A. Herzberg. Maintaimng security m the presence of transient faults In Crypto' 94, pp. 425-438, August, 1994.
[7]
CertCo, Root Authority, http://www.certco.com
[8]
C.S. Chow and A. Herzberg. Network randomizatlon protocol:,4 proactive pseudo-random generator. Appears in Proc. 5th USENIX UNIX Security Symposium, Salt Lake City, Utah, June 1995, pp. 55-63.
[9]
P. Feldman. A Practical Scheme for non-interactive verifiable secret sharing. In Proc.28th Annual Symp. on Foundations of Computer Science, pp. 427-437. IEEE, 1987.
[10]
Y. Frankel, P. Gemmell, P. Mackenzie, and M. Yung. Opttmal resilience proactive public-key cryptosystems. in Proc. 38th Annual Symp. on Foundations of Computer Science. IEEE, 1997.
[11]
Y. Frankel, P. Gemmell, P. Mackenzie, and M. Yung Proactive RSA. In Proc. of Crypto '97.
[12]
P. Gemmell. An introduction to threshold cryptography. In Cryptobytes, Winter 97, pp. 7-12, 1997.
[13]
R. Gennaro, S. Jarecki, H Krawczyk and T. Rabin, Robust threshold DSS szgnature. In Ueli Maurer, editor, Advances in Cryptology- Eurocrypt '96, pp. 354-371, 1996. Springer-Verlag Lecture Notes in Computer Science No. 1070.
[14]
V. Hamilton, G. lstrail- Sandia National Labs. lmplementatlon of proactive threshold pubIic-key protocols, Proceedings of the 1998 RSA Data Security Conference.
[15]
A. Herzberg, M. Jakobsson, S. Jarecki, H. Krawczyk and M. Yung. Proact&e pubhc key and signature systems, ACM Security '97.
[16]
A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung, Proacttve secret sharing, or: How to cope with perpetual leakage. In D. Coopersmith, editor, Advances in Cryptology - Crypto '95, pp. 339-352, 1995. Lecture Notes in Computer Science No. 963.
[17]
ITTC http://www.stanford.edu/--dabo/ITTC
[18]
A. lyengar, R. Cahn, C. Jutla and J.A. Garay, Design and tmplementatton of a secure distributed data reposztory, in IFIP 1998.
[19]
M. Malkin, T. Wu and D. Boneh, Experimenting with shared generation of RSA keys, in proceedings of the lntemet Society's 1999 Symposium on Network and Distributed System Security (SNDSS), pp. 43-56.
[20]
M. Naor, B. Pinkas and O. Reingold, Distributed pseudo-random functions and KDCs, to appear in Proc. of Eurocrypt '99.
[21]
R. Ostrovsky and M. Yung, How to withstand mobile virus attacks, PODC 199 i, pp.51-6 I.
[22]
T. Pedersen. Non-interactive and information theoretw secure verifiable secret sharing, in D. Davies, editor, Advances in Cryptology- Eurocrypto '91, pp. 522-526, 1991. Lecture Notes in Computer Science No. 547.
[23]
T. Pedersen. A threshold cryptosystem without a trusted party in J. Feigenbaum, editor, Advances in Cryptology - Crypto '91, pp. 129-140, 1991. Lecture Notes in Computer Science No. 576
[24]
T. Rabin, A simphfied approach to threshold and proactive RSA, Proc. of Crypto '98.
[25]
M. K. Reiter, The Rampart toolkit for bu~ldlng high-mtegrtty services. In K. P. Birman, F. Mattern and A. Schiper~ editors, Theory and Practice in Distributed Systems (LNCS 938), 99-110, Springer-Verlag, 1995.
[26]
M. K. Reiter, Secure agreement protocols Reliable and atomic group multicast in Rampart Proc. 2nd ACM Conference on Computer and Communication Security, 1994.
[27]
M. Reiter, M. Franklin, J. Lacy and R. Wright, The Key Management Service, Proc. of the 3rd ACM Conference on Computer and Communication Security, 1996.
[28]
A. Shamir. How to Share a Secret. Communications of the ACM, 22:612-613, 1979.
[29]
T. Wu, M. Malkin and D. Boneh, Building intruston tolerant applications, submitted to 8th USENIX Security Symposium.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
CCS '99: Proceedings of the 6th ACM conference on Computer and communications security
November 1999
160 pages
ISBN:1581131488
DOI:10.1145/319709
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1999

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

CCS99
Sponsor:
CCS99: Sixth ACM Conference on Computer and Communication Security
November 1 - 4, 1999
Kent Ridge Digital Labs, Singapore

Acceptance Rates

Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)75
  • Downloads (Last 6 weeks)25
Reflects downloads up to 01 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Proactive Secret Sharing with Constant CommunicationTheory of Cryptography10.1007/978-3-031-48618-0_12(337-373)Online publication date: 27-Nov-2023
  • (2021)Machine Learning and Survey-based Predictors of InfoSec Non-ComplianceACM Transactions on Management Information Systems10.1145/346668913:2(1-20)Online publication date: 18-Oct-2021
  • (2011)IntroductionData Mining and Machine Learning in Cybersecurity10.1201/b10867-2(1-21)Online publication date: 23-May-2011
  • (2011)Adversarial Security: Getting to the Root of the ProblemOpen Research Problems in Network Security10.1007/978-3-642-19228-9_5(47-55)Online publication date: 2011
  • (2010)Implementing trustworthy services using replicated state machinesReplication10.5555/2172338.2172346(151-167)Online publication date: 1-Jan-2010
  • (2010)Adversarial securityProceedings of the 2010 IFIP WG 11.4 international conference on Open research problems in network security10.5555/1966201.1966208(47-55)Online publication date: 5-Mar-2010
  • (2008)Efficient state transfer for hypervisor-based proactive recoveryProceedings of the 2nd workshop on Recent advances on intrusiton-tolerant systems10.1145/1413901.1413905(1-6)Online publication date: 1-Apr-2008
  • (2007)Hypervisor-Based Efficient Proactive Recovery2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007)10.1109/SRDS.2007.25(83-92)Online publication date: Oct-2007
  • (2005)Implementing Trustworthy Services Using Replicated State MachinesIEEE Security and Privacy10.1109/MSP.2005.1253:5(34-43)Online publication date: 1-Sep-2005
  • (2005)Implementing Trustworthy Services Using Replicated State MachinesReplication10.1007/978-3-642-11294-2_8(151-167)Online publication date: 2005
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media