Mangement tokens were added to xous-names for the special case of servers that had exactly 1 connection, so they could explicitly control when they are disconnected (preventing e.g. griefing by rogue processes). This was a good idea except it also conflicts with the "eager TOFU" model of Xous security when you have servers that act as plugins to each other. Eager TOFU means Xous has a "trust on first use" model for capabilities, and eager implies that anyone who will use anything will claim it early on. This gives the important property that one can ask, "has everyone eaten their TOFU?" before doing anything really sensitive. If all the TOFU slots are used, then you can conclude that no new rogue servers can inject themselves into sensitive APIs and you can move forward. In the case of a plugin API with multiple plug options, when you unplug something, the previously eagerly occupied slot now becomes unoccopied -- and this becomes a flag against the TOFU check, disallowing sensitive operations to proceed. This is *particularly* a problem with the predictive history plugins for the IME. The architecture was created to allow for multiple histories to be used. Up until now, only the shellchat plugin was ever used, so, the eager TOFU check always passed. However, in creating more applications, this flaw was uncovered once we introduced a second plugin. This means predictors can not delegate their security to Xous-names. They must individually implement API tokens to control access to the prediction history (to prevent rogue apps from e.g. connecting to the predictor and then reading out the prediction history to figure out what the most recent words were typed). A subsequent commit will add the API tokens, but this commit simply has xous-names return a mangament token even if servers with more than 1 connection are created. The main downside of doing this is the management token lose meaning in the context of multiple servers; but, so long as the tokens aren't used for anything in those situations, it's fine (cue burning building meme). More importantly, it allows the existing code to manage the xous-names count to function even on a server that sets no explicit limit on connection count, which is now going to be the case for the prediction engines going forward. |
||
|---|---|---|
| .. | ||
| src | ||
| Cargo.toml | ||
| README.md | ||
xous-names
Specification
Server IDs (SIDs) are used by processes to send messages to servers. It is thus an attack surface. Furthermore, if a process can forge an SID before a server can claim it, it can “become” the server. Thus, it’s helpful to keep the SID a secret.
In Xous, an SID is a 128-bit number that, with two exceptions, is only
known to the server itself, and an oracle known as xous-name-server.
SIDs are never revealed to a process. Processes establish connections
to servers using a descriptive, human-readable string name. Since the
SIDs are random numbers, there is no way to turn the descriptive
string into the SID except by resolving it with xous-name-server.
On boot, a trusted set of processes are started which form the
operating system. These must all claim names in the name space before
any further processes are started, to prevent later processes from
claiming their names. Servers can also optionally limit the total
number of connections allowed, which effectively makes them unreachable
by less trusted code that is run after the core trusted set of processes
have started up. The trusted_init_done() libary call on the name
server will return true if all the servers that have a connection
limit have fully populated all of their connections.
The exception to random SIDs are the xous-name-server,
xous-log-server (note the trailing space), and ticktimer-server.
These are three well known names that have a defined,
fixed SID so that all processes can talk to them; xous-name-server is
necessarily well-known as it is the mechanism to resolve further
names, xous-log-server is necessary for debugging, so that bugs upstream
of name resolution can be logged. xous-name-server was picked because
name-server already has a meaning in the context of DNS. ticktimer-server
is necessary for implementing deterministic timing delays in
xous-name-server upon failure, and also for other processes to
wait a fixed period of time on initialization while the initial set
of name registrations occur.
A new process that intends to receive messages uses the register_name convenience
function in the xous-names/src/lib.rs file, with the following procedure.
-
It calls
register_namewith a preferred ASCII name string, limited to 64 characters. It also specifies how many connections the server will allow.Noneon the specifier means no limit. -
xous-name-serverreturns the borrowed memory to the server, where the buffer has been replaced with a response field. In the case that the registration is affirmed, the SID field inRegistrationcontains the assigned SID of calling process. In the case that the name is determined to be invalid (perhaps because it is already reserved or registered), it will return an error code. -
If the registration is denied, the server can attempt to re-register its SID with a different ASCII name string by repeating steps 2-3.
A process that would like to send a server a message must first request the
name server to broker a connection to the target process. It does this by
typically calling the request_conneciton_blocking convenience function
with the registered name of the server.
-
request_connection_blockingis called with the maximum 64-character ASCII name string. -
The convencience function creates a
Lookupmessage which is lent to the name server. -
xous-name-servercan respond with one of three results: A. affirm the connection by returning a connection ID B. a flat denial of the connection; or C. a slot containing a request to authenticate.
Here are the cases worked out:
A. affirming the connection: xous-name-server would use
MessageSender.pid() to extract the sender’s PID, and call
ConnectForProcess(PID,SID) on behalf of the sender. The sender can
then use the CID as the first argument to send_message(). This is
the common case, and many servers follow this path, such as those
asking for access to the ticktimer or other public services.
B. flat denial: xous-name-server simply returns a message saying the
request was denied. This is also the case when the request is malformed or incorrect.
No information shall be leaked about the
nature of the denial. Denials are also delayed to the nearest 0.1 second interval since boot
to eliminate side channels and to rate limit fuzzing requests. Some
services (such as the key server) are restricted to only a set of
trusted process loaded at boot, and therefore it should not be
discoverable.
C. request to authenticate: xous-name-server responds with success set
to false, but authenticate_request to true. The pubkey_id field
is populated with the ID of an acceptable Ed25519 public key for authentication, and
a 256-bit challenge nonce is provided in the challenge field. Authentication
consists of the requesting server proving that it has knowledge of a shared
secret, namely, an Ed25519 private key.
Upon generating the request to authenticate, xous-name-server computes
the correct response to the challenge and stores it in a table with
a timestamp.
The sending process must then sign the challenge and return an
Authenticate message, constructed similarly to the Lookup
message but with the response_to_challenge field filled out. It must
do this before AUTHENTICATE_TIMEOUT milliseconds have passed.
The server, upon receipt of an Authenticate message, merely checks
if the response_to_challenge matches any response stored in its
table, and if it does, it accepts the process as authenticated. It is
cryptographically unlikely for there to be a collision in the table;
however, this implementation is weak to an attacker potentially
stealing the response and using it. That being said, if an attacker
already has that level of control in the calling process, there
are bigger problems.
The AUTHENTICATE_TIMEOUT field is used to give xous-name-server
a chance to depopulate the response table over time, so that it
does not "leak" memory.
Current Implementation
The current implementation is a hash map that matches randomly generated names with a list of names each server selects for itself. Currently, any request to lookup and connect to a server will succeed up to the limit of connections (if any) specified by a server, but the hooks are there to enforce permissions and deny connections, and/or request authentication for connection.
Server names are crate-local, and are bound through library functions called during the creation of server access objects. In other words, there is no global name space for servers.