In anonymity networks (e.g., Tor, Crowds, Mixmaster, I2P, etc.), it is important to be able to measure quantitatively the guarantee that is given to the system. The degree of anonymity 
  
    
      
        d
      
    
    {\displaystyle d}
  
 is a device that was proposed at the 2002 Privacy Enhancing Technology (PET) conference. Two papers put forth the idea of using entropy as the basis for formally measuring anonymity: "Towards an Information Theoretic Metric for Anonymity", and "Towards Measuring Anonymity".  The ideas presented are very similar with minor differences in the final definition of 
  
    
      
        d
      
    
    {\displaystyle d}
  
.
 Anonymity networks have been developed and many have introduced methods of proving the anonymity guarantees that are possible, originally with simple Chaum Mixes and Pool Mixes the size of the set of users was seen as the security that the system could provide to a user.  This had a number of problems; intuitively if the network is international then it is unlikely that a message that contains only Urdu came from the United States, and vice versa.  Information like this and via methods like the predecessor attack and intersection attack helps an attacker increase the probability that a user sent the message.
 
As an example consider the network shown above, in here 
  
    
      
        A
        ,
        B
        ,
        C
      
    
    {\displaystyle A,B,C}
  
 and 
  
    
      
        D
      
    
    {\displaystyle D}
  
 are users (senders), 
  
    
      
        Q
        ,
        R
        ,
        S
      
    
    {\displaystyle Q,R,S}
  
, and 
  
    
      
        T
      
    
    {\displaystyle T}
  
 are servers (receivers), the boxes are mixes, and 
  
    
      
        {
        A
        ,
        B
        }
        ∈
        T
      
    
    {\displaystyle \{A,B\}\in T}
  
, 
  
    
      
        {
        A
        ,
        B
        ,
        C
        }
        ∈
        S
      
    
    {\displaystyle \{A,B,C\}\in S}
  
 and 
  
    
      
        {
        A
        ,
        B
        ,
        C
        ,
        D
        }
        ∈
        Q
        ,
        R
      
    
    {\displaystyle \{A,B,C,D\}\in Q,R}
  
 where 
  
    
      
        ∈
      
    
    {\displaystyle \in }
  
 denotes the anonymity set.  Now as there are pool mixes let the cap on the number of incoming messages to wait before sending be 
  
    
      
        2
      
    
    {\displaystyle 2}
  
; as such if 
  
    
      
        A
        ,
        B
      
    
    {\displaystyle A,B}
  
, or 
  
    
      
        C
      
    
    {\displaystyle C}
  
 is communicating with 
  
    
      
        R
      
    
    {\displaystyle R}
  
 and 
  
    
      
        S
      
    
    {\displaystyle S}
  
 receives a message then 
  
    
      
        S
      
    
    {\displaystyle S}
  
 knows that it must have come from 
  
    
      
        E
      
    
    {\displaystyle E}
  
 (as the links between the mixes can only have 
  
    
      
        1
      
    
    {\displaystyle 1}
  
 message at a time).  This is in no way reflected in 
  
    
      
        S
      
    
    {\displaystyle S}
  
's anonymity set, but should be taken into account in the analysis of the network.
 The degree of anonymity takes into account the probability associated with each user, it begins by defining the entropy of the system (here is where the papers differ slightly but only with notation, we will use the notation from .): 

  
    
      
        H
        (
        X
        )
        :=
        
          ∑
          
            i
            =
            1
          
          
            N
          
        
        
          [
          
            
              p
              
                i
              
            
            ⋅
            lg
            ⁡
            
              (
              
                
                  1
                  
                    p
                    
                      i
                    
                  
                
              
              )
            
          
          ]
        
      
    
    {\displaystyle H(X):=\sum _{i=1}^{N}\left[p_{i}\cdot \lg \left({\frac {1}{p_{i}}}\right)\right]}
  
,
where 
  
    
      
        H
        (
        X
        )
      
    
    {\displaystyle H(X)}
  
 is the entropy of the network, 
  
    
      
        N
      
    
    {\displaystyle N}
  
 is the number of nodes in the network, and 
  
    
      
        
          p
          
            i
          
        
      
    
    {\displaystyle p_{i}}
  
 is the probability associated with node 
  
    
      
        i
      
    
    {\displaystyle i}
  
.
Now the maximal entropy of a network occurs when there is uniform probability associated with each node 
  
    
      
        
          (
          
            
              1
              N
            
          
          )
        
      
    
    {\displaystyle \left({\frac {1}{N}}\right)}
  
 and this yields 
  
    
      
        
          H
          
            M
          
        
        :=
        H
        (
        X
        )
        ←
        lg
        ⁡
        (
        N
        )
      
    
    {\displaystyle H_{M}:=H(X)\gets \lg(N)}
  
.
The degree of anonymity (now the papers differ slightly in the definition here,  defines a bounded degree where it is compared to 
  
    
      
        
          H
          
            M
          
        
      
    
    {\displaystyle H_{M}}
  
 and  gives an unbounded definition—using the entropy directly, we will consider only the bounded case here) is defined as 

  
    
      
        d
        :=
        1
        −
        
          
            
              
                H
                
                  M
                
              
              −
              H
              (
              X
              )
            
            
              H
              
                M
              
            
          
        
        =
        
          
            
              H
              (
              X
              )
            
            
              H
              
                M
              
            
          
        
      
    
    {\displaystyle d:=1-{\frac {H_{M}-H(X)}{H_{M}}}={\frac {H(X)}{H_{M}}}}
  
.
Using this anonymity systems can be compared and evaluated using a quantitatively analysis.
 These papers also served to give concise definitions of an attacker:
 In the papers there are a number of example calculations of 
  
    
      
        d
      
    
    {\displaystyle d}
  
; we will walk through some of them here.
 In Crowds there is a global probability of forwarding (
  
    
      
        
          p
          
            f
          
        
      
    
    {\displaystyle p_{f}}
  
), which is the probability a node will forward the message internally instead of routing it to the final destination.  Let there be 
  
    
      
        C
      
    
    {\displaystyle C}
  
 corrupt nodes and 
  
    
      
        N
      
    
    {\displaystyle N}
  
 total nodes.  In Crowds the attacker is internal, passive, and local.  Trivially 
  
    
      
        
          H
          
            M
          
        
        ←
        lg
        ⁡
        (
        N
        −
        C
        )
      
    
    {\displaystyle H_{M}\gets \lg(N-C)}
  
, and overall the entropy is 
  
    
      
        H
        (
        x
        )
        ←
        
          
            
              N
              −
              
                p
                
                  f
                
              
              ⋅
              (
              N
              −
              C
              −
              1
              )
            
            N
          
        
        ⋅
        lg
        ⁡
        
          [
          
            
              N
              
                N
                −
                
                  p
                  
                    f
                  
                
                ⋅
                (
                N
                −
                C
                −
                1
                )
              
            
          
          ]
        
        +
        
          p
          
            f
          
        
        ⋅
        
          
            
              N
              −
              C
              −
              1
            
            N
          
        
        ⋅
        lg
        ⁡
        
          [
          
            N
            
              /
            
            
              p
              
                f
              
            
          
          ]
        
      
    
    {\displaystyle H(x)\gets {\frac {N-p_{f}\cdot (N-C-1)}{N}}\cdot \lg \left[{\frac {N}{N-p_{f}\cdot (N-C-1)}}\right]+p_{f}\cdot {\frac {N-C-1}{N}}\cdot \lg \left[N/p_{f}\right]}
  
, 
  
    
      
        d
      
    
    {\displaystyle d}
  
 is this value divided by 
  
    
      
        
          H
          
            M
          
        
      
    
    {\displaystyle H_{M}}
  
.
 In onion routing let's assume the attacker can exclude a subset of the nodes from the network, then the entropy would easily be 
  
    
      
        H
        (
        X
        )
        ←
        lg
        ⁡
        (
        S
        )
      
    
    {\displaystyle H(X)\gets \lg(S)}
  
, where 
  
    
      
        S
      
    
    {\displaystyle S}
  
 is the size of the subset of non-excluded nodes.  Under an attack model where a node can both globally listen to message passing and is a node on the path this decreases to 
  
    
      
        H
        (
        X
        )
        ←
        lg
        ⁡
        (
        L
        )
      
    
    {\displaystyle H(X)\gets \lg(L)}
  
, where 
  
    
      
        L
      
    
    {\displaystyle L}
  
 is the length of the onion route (this could be larger or smaller than 
  
    
      
        S
      
    
    {\displaystyle S}
  
), as there is no attempt in onion routing to remove the correlation between the incoming and outgoing messages.
 In 2004, Diaz, Sassaman, and DeWitte presented an analysis of two anonymous remailers using the Serjantov and Danezis metric, showing one of them to provide zero anonymity under certain realistic conditions.