Home > Articles > Programming > C/C++

Secure Coding in C and C++: An Interview with Robert Seacord

Danny Kalev talks to Robert C. Seacord, the author of Secure Coding in C and C++, second edition, about the new edition of his book, which features in C11 may be more dangerous than programmers realize, and advice for making your code more secure.

Read Secure Coding in C and C++, Second Edition or more than 24,000 other books and videos on Safari Books Online. Start a free trial today.


Like this article? We recommend

Danny Kalev: Eight years after the first edition, which new techniques and insights does the second edition of Secure Coding in C and C++ reveal? More generally, what has changed in the threat maps of C and C++ programming since 2005?

Robert Seacord: One of the big changes in the C and C++ languages has been the support for multiple threads of execution, including improved memory models and atomic objects and operations. In the long term, this is a good thing, but in the short term it brings concurrency class vulnerabilities into both languages. To deal with this specific issue, we have added a chapter on concurrency to the second edition. There have also been significant security improvements, including the addition of support for bounds-checking interfaces (originally specified in ISO/IEC TR 24731-1:2007) that caused us to significantly revise the chapter on strings. We’ve also taken pains to align the second edition more carefully with the C and C++ standards and to explain the effects of undefined behaviors in these languages on your code. To make the book more practical, we’ve eliminated research mitigation strategies in favor of existing solutions.

Danny: Speaking of the new C and C++ standards, are there new features that you consider inherently risky or more dangerous than programmers realize? For example, lambdas or perhaps move semantics that let programmers bind temporaries and literal values to rvalue references? Or maybe C99’s variable length arrays (which became optional in C11)?

Robert: Any new language feature with undefined behaviors is probably more dangerous than most programmers realize. Variable length arrays (VLAs) are essentially the same as traditional C arrays except that they are declared with a size that is not a constant integer expression. Consequently, the integer expression size and the declaration of a VLA are both evaluated at runtime. If the size argument supplied to a VLA is not a positive integer value, the behavior is undefined. Additionally, if the magnitude of the argument is excessive, the program may behave in an unexpected way. An attacker may be able to leverage this behavior to execute arbitrary code. The programmer must ensure that size arguments to VLAs, especially those derived from untrusted data, are in a valid range.

Danny: In your experience, is there a noticeable difference between programming in C and C++ versus programming in other programming languages as far as security is concerned? Are there languages that are inherently more secure, or will attackers simply find and exploit loopholes in every programming language, no matter what?

Robert: There is a noticeable difference between programming in C and C++ and programming in other languages, such as Java. The difference is not so much that one language is more secure than the other but that the attack surface is different. Buffer overflows are still a major problem in C and C++ but not a problem in Java. On the other hand, Java allows code from different code sources to run in the same virtual machine, greatly expanding the attack surface of the language and leading to multiple, recent, well-publicized vulnerabilities that can allow a remote, unauthenticated attacker to execute arbitrary code on a vulnerable system. The biggest mistake you can make is still the false assumption that your program is immune to vulnerabilities because of your choice of programming language.

Danny: In a similar vein, are there platforms that are more vulnerable to security risks than others? Are there platforms that you would consider bulletproof or at least close to that?

Robert: There have been many comparisons of the relative security of the Windows and Linux platforms but little scientific evidence to suggest one platform is more or less secure than the other. Operating systems such as OpenBSD emphasize security, but no platform should be viewed as bullet-proof.  Platform security tends to improve with time, so modern OS platforms that feature exploit mitigation such as address space layout randomization (ASLR) or implement a W^X policy such as data execution prevention (DEP) on Windows is preferable to older platforms that do not provide similar runtime protections. Overall security is a function of both vulnerability and threat. From this perspective, ubiquitous systems come under attack more frequently and might consequently be considered less secure.

Danny: Let’s focus on the new secure C11 library functions, such as strcpy_s and fopen_s. How important is replacing the traditional library functions with their secure counterparts? Which security aspects are not covered by the new library functions?

Robert: The bounds-checked interfaces defined in Annex K of the new C Standard are significantly improved over the functions they are designed to replace, meaning that developers using these interfaces are less likely to inadvertently code a buffer overflow. The strcpy_s() function is a close replacement for strcpy(), but includes an additional parameter to prevent buffer overflow that gives the size of the destination array. There are vulnerabilities that are not fully addressed by the APIs. The fopen_s() function opens files with exclusive (nonshared) access, but only if supported by the underlying operating system. This can leave a system open to vulnerabilities resulting from attackers exploiting race conditions when the file is accessed.

Danny: Most programmers are aware of the risks of buffer overflows. However, there are other techniques that attackers exploit, such as stack smashing and return-oriented programming attacks. Can you briefly explain what those two are and under which circumstances they might occur?

Robert: Stack smashing occurs when a buffer overflow occurs on an automatic array on the stack, and the overflow results in information on the stack, such as the return address and base pointer in the returning function being overwritten. If the return address is overwritten by an attacker with the address of malicious code inserted in the program, the attacker can run arbitrary code with the permissions of the vulnerable process. Return-oriented programming is the latest wrinkle. Rather than returning to code that the attacker inserts in the stack or data segment, the attacker returns to small code snippets that already exist in the code segment. Any number of these code snippets can be called sequentially, basically providing a return-oriented programming language that an attacker can use to write malicious programs that execute in the code segment, bypassing mitigation strategies that prevent data execution.

Danny: If you could suggest a few concrete changes to the current standards of either C or C++ that would make these programming languages more secure, what would those be?

Robert: CERT has been active in the C and C++ Standards Committees for many years, and we have made numerous proposals to improve the security of both these languages. Many of our proposals have been adopted; others have not. Some of our adopted proposals include analyzability, static assertions, “no-return” functions, and support for opening files with exclusive mode ('x' as the last character in the mode argument). We also supported the adoption of the bounds-checking interfaces and the removal of the insecure gets() function. In C++, we supported the requirement that an exception thrown from a function marked noexcept should immediately terminate the program.

Among our C proposals that were not accepted was a proposal to add two functions to the C11 Standard Library to encrypt and decrypt pointers. These functions would be similar to the EncodePointer() and DecodePointer() functions in Microsoft Windows. In many systems and applications, pointers to functions are stored unencrypted in locations addressable by exploit code. An attacker exploiting a vulnerability in a program could potentially overwrite the function pointer and thereby hijack the process when the function is called. The proposal was not adopted by the committee because it was felt that the appropriate solution was for compilers to automatically encrypt and decrypt these pointers without requiring the programmer to invoke these library calls. This analysis is correct—however, it is now a quality-of-implementation issue as to whether a compiler implements this feature—and I am not aware of any that do.

Danny: What is your best advice to C and C++ programmers who want to write more secure code (in addition to reading your book, that is)?

Robert: C and C++ programmers should familiarize themselves with the CERT Secure Coding Standards at www.securecoding.cert.org. They should also acquire the appropriate language standards and reference them frequently. Both the C and C++ standards are available from the ANSI eStandards Store at webstore.ansi.org for a reasonable price. After that, I suggest programmers start with a subset of the language they have studied and grow this subset carefully. For example, bit-fields have complex, nonintuitive semantics; you might not want to use this C language feature until you acquire the appropriate expertise.

Danny: What is the biggest misconception about secure coding that you’ve encountered in your long career as a Senior Vulnerability Analyst?

Robert: It is very hard to pick just one. I’ve already covered “just program in Java and you’ll be okay.” Replace strcpy() with strncpy() was another good one. Actually, I’ve thought of the winner: programs have vulnerabilities because programmers are stupid and lazy. Secure coding is extremely difficult, and programmers get less help than they should from their compilers and tools. Large, complex languages can be problematic because the subset programmers might know does not match the subset needed for the current projects they are working on. This is particularly true during maintenance. Developers are frequently under pressure to deliver functionality on schedule; code quality and security may suffer as a result.

Danny: In what ways, then, can compilers and software tools be improved so that programmers may get more help with respect to security?

Robert: There are many ways, but I would like to provide a very specific example. For several years, CERT has been working with WG14 to produce the draft TS 17961 C Secure Coding Rules Technical Specification. ISO/IEC TS 17961 defines secure coding rules for analyzers that wish to diagnose insecure code beyond the requirements of the C Language Standard. The application of static analysis to security has been performed in an ad hoc manner by different vendors, resulting in nonuniform coverage of significant security issues. This specification enumerates secure coding rules and requires analysis engines to diagnose violations of these rules as a matter of conformance to this specification. These rules may be extended in an implementation-dependent manner, which provides a minimum coverage guarantee to customers of any and all conforming static analysis implementations. Various types of analyzers, including static analysis tools and C language compilers, can be used to check if a program contains any violations of the coding rules.

Danny: What are your estimates regarding the security threats of the future? Do you see new kinds of threats looming ahead, for example?

Robert: One of the reasons the CERT Program at the Software Engineering Institute (SEI) works in this area is that software security is a very hard problem, one that is unlikely to be solved any time soon. A January report by the Defense Science Board (DSB) Task Force on Resilient Military Systems likened the problem to complex national security challenges of the past, such as “the counter U-boat strategy in WWII and nuclear deterrence in the Cold War.” One of the primary problems is that market forces are still driving greater performance in preference to software security, so in general, systems are frequently becoming less and not more secure. A good example of this trend is described in Vulnerability Note VU#162289, “C compilers may silently discard some wraparound checks.”

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020