The most potent threat associated with NomCom eligibility is that an organization or group of coordinating organizations could attempt to obtain a majority of NomCom positions, in order to select an IETF leadership in support of an agenda that might be self-serving and against the interests of the community as a whole.
Note that [
RFC 8713] lets the NomCom Chair decide the NomCom voting requirement, so a simple majority may be inadequate. However, seven of ten forms a quorum, so at worst seven NomCom members working together can almost certainly impose their will.
Whatever the merits of admitting remote attendees, it reduces the minimum cost of creating a NomCom-eligible volunteer from three in-person trips of around five days each over the course of at least eight months, to zero financial cost and the time required to log in three times over at least eight months. Some organizations might not be deterred in either case, while others might.
A large number of legitimate volunteers makes it quite difficult to control a majority of NomCom slots. Setting aside limitations on the number of selections from any organization, basic probability shows that to have even a 50% chance of controlling six or more NomCom positions, an attacker needs roughly 60% of the volunteer pool. For example, if there are 300 "legitimate" volunteers, an attacker must produce 365 volunteers to exceed a 50% chance of NomCom capture (see
Appendix A).
A sudden surge in the number of volunteers, particularly of people that no one recognizes as a part of the community, is an early-warning sign of an attempt at capture. Anyone with concerns about the integrity of the process should bring those concerns to the IESG to investigate. Where needed, the confirming bodies can take action to invalidate such candidates as defined in
Section 3.7.3 of
RFC 8713.
While loosening eligibility criteria lowers the cost to an attacker of producing eligible volunteers, it also increases the number of legitimate volunteers which increases the difficulty of an attack.
The two-per-organization limit described in
Section 4.17 of
RFC 8713 complicates such a capture attack. To circumvent it, an organization would have to do one or more of the following:
-
coordinate with at least two like-minded organizations to produce a NomCom majority,
-
incentivize members of other organizations (possibly through a funding agreement) to support its agenda, and/or
-
propose candidates with false affiliations.
While the IETF does not routinely confirm the affiliation of volunteers, as part of an investigation it could eliminate volunteers who have misrepresented said affiliation. Publishing the list of volunteers and affiliations also gives the community an opportunity to review the truth of such claims.
Assuming that 300 legitimate volunteers are all from different organizations, three conspiring organizations would need 771 volunteers (257 per organization) for a 50% chance of NomCom capture (see
Appendix A).
Attendance at three meetings requires at least eight months of waiting. Given the volume of volunteers necessary to capture the process, an attack requires a surge in attendees over the course of a year. Such a surge might trigger a community challenge to the list of eligible volunteers, and/or a leadership investigation to detect suspicious behavior (e.g., logging in to a single session and then immediately logging out). In the event of abuse of process, the leadership would then have months to adjust policy in response before the NomCom cycle begins, and/or disqualify candidates.
Note that counting remote participation towards NomCom eligibility allows for a single individual to mount an attack that previously required coordination. By registering for remote attendance to IETF meetings using a number of different identities over a year, an individual can make each of those identities NomCom eligible and then serve under any one of them that is selected for the NomCom. Once selected, an individual could seek to disrupt the process or prevent the timely conclusion of its work. Less severely, an attacker could simply improve their chances of being selected for NomCom.
This attack is much harder to detect or prevent than equivalent attacks were previously, as it does not require coordination among multiple attendees. While the attacker cannot be sure of fee waivers for some or all of the different identities, the lower cost for remote participation also makes this attack more feasible than it would have been under prior rules.
However, the voting member recall procedure in
Section 5.7 of
RFC 8713 exists to allow removal and replacement of disruptive figures.
Additional changes to the process to further obstruct attacks against the NomCom are beyond the scope of this document. However, a challenge process against volunteers with a suspicious reported affiliation, or that might be aliases of a single volunteer, could trigger an investigation.
Similarly, the challenge to the random selection described in
Section 4.17 of
RFC 8713 can explicitly include appeals against the data used to qualify the volunteer, rather than the randomization process.