Decrypt xor-encryption
Jelly, 27 26 bytes

ØJḟ“&lt;&gt;`{}”ḟØAɓi@€_33^\96_ị


Try it online!

Alternate version, 22 bytes (non-competing)

Jelly finally caught up with other golfing langs and got a printable ASCII atom, so this works now.

ØṖḟ“&lt;&gt;`{}”ḟØAɓi@€’^\Nị


Try it online!

How it works

ØJḟ“&lt;&gt;`{}”ḟØAɓi@€_33^\96_ị  Main link. Argument: s (string)

ØJ                          Yield Jelly's code page, i.e., 32 non-ASCII characters,
                            followed by all printable ASCII characters, followed by
                            129 non-ASCII characters.
  ḟ“&lt;&gt;`{}”                  Filterfalse; remove the characters "&lt;&gt;`{}".
          ḟØA               Filterfalse; remove all uppercase ASCII letters.
                            Let's call the resulting alphabet a.
             ɓ              Begin a new, dyadic chain.
                            Left argument: s. Right argument: a
              i@€           Find the (1-based) index of all characters of s in a.
                 _33        Subtract 33, so ' ' maps to 0, '~' maps to 63.
                    ^\      Compute the cumulative bitwise XOR.
                            We didn't take the bitwise NOT of the first index,
                            which can be rectified by subtracting all results from
                            63. However, we must also add 33 to account for the
                            fact that the index of ' ' in a is 33.
                      96_   Subtract the results from 96.
                         ị  Index into a.