stack zeroization

Cargo.toml

@@ -15,7 +15,8 @@ members = [
  "opaque-debug",
  "wycheproof2blb",
  "zeroize",
- "zeroize_derive"
+ "zeroize_derive",
+ "zeroize_stack"
 ]
 exclude = ["aarch64-dit"]
 

zeroize_stack/Cargo.toml

@@ -0,0 +1,30 @@
+[package]
+name = "zeroize_stack"
+version = "0.1.0"
+description = """
+Securely zeroize the stack with a simple function built on
+the Portable Stack Manipulation (psm) crate and zeroize crate.
+"""
+authors = ["The RustCrypto Project Developers"]
+license = "Apache-2.0 OR MIT"
+homepage = "https://github.com/RustCrypto/utils/tree/master/stack_sanitizer"
+repository = "https://github.com/RustCrypto/utils"
+readme = "README.md"
+categories = ["cryptography", "memory-management", "no-std", "os"]
+keywords = ["memory", "memset", "secure", "volatile", "zero", "stack"]
+edition = "2024"
+rust-version = "1.85"
+
+[dependencies]
+libc = "0.2.156"
+psm = "0.1.26"
+zeroize = { version = "1.0" }
+
+[features]
+default = ["heap", "stack", "std"]
+heap = ["std"]
+stack = []
+std = []
+
+[package.metadata.docs.rs]
+all-features = true

zeroize_stack/README.md

@@ -0,0 +1,65 @@
+# [RustCrypto]: zeroize_stack
+
+[![Crate][crate-image]][crate-link]
+[![Docs][docs-image]][docs-link]
+![Apache 2.0/MIT Licensed][license-image]
+![MSRV][rustc-image]
+[![Build Status][build-image]][build-link]
+
+Securely zero the stack (a.k.a. [zeroize]) while avoiding compiler optimizations.
+
+This crate implements a portable approach to securely zeroing the stack using
+techniques which guarantee they won't be "optimized away" by the compiler.
+
+[Documentation]
+
+## About
+
+[Zeroing memory securely is hard] - compilers optimize for performance, and
+in doing so they love to "optimize away" unnecessary zeroing calls, as well 
+as make extra copies of data on the stack that cannot be easily zeroed. That's 
+what this crate is for.
+
+This crate isn't about tricks: it uses [psm::on_stack] to run a function on 
+a portable stack, and then uses [zeroize] to zero that stack. `psm` implements
+all of the assembly for several different architectures, and the [zeroize]
+portion of the task was implemented in pure Rust.
+
+- `#![no_std]` i.e. **embedded-friendly**! (`alloc` is required)
+- No functionality besides securely zeroing the a function's stack usage!
+
+## License
+
+Licensed under either of:
+
+* [Apache License, Version 2.0](http://www.apache.org/licenses/LICENSE-2.0)
+* [MIT license](http://opensource.org/licenses/MIT)
+
+at your option.
+
+### Contribution
+
+Unless you explicitly state otherwise, any contribution intentionally submitted
+for inclusion in the work by you, as defined in the Apache-2.0 license, shall be
+dual licensed as above, without any additional terms or conditions.
+
+[//]: # (badges)
+
+[crate-image]: https://img.shields.io/crates/v/zeroize.svg
+[crate-link]: https://crates.io/crates/zeroize
+[docs-image]: https://docs.rs/zeroize/badge.svg
+[docs-link]: https://docs.rs/zeroize/
+[license-image]: https://img.shields.io/badge/license-Apache2.0/MIT-blue.svg
+[rustc-image]: https://img.shields.io/badge/rustc-1.85+-blue.svg
+[build-image]: https://github.com/RustCrypto/utils/actions/workflows/zeroize.yml/badge.svg?branch=master
+[build-link]: https://github.com/RustCrypto/utils/actions/workflows/zeroize.yml?query=branch:master
+
+[//]: # (general links)
+
+[RustCrypto]: https://github.com/RustCrypto
+[zeroize]: https://en.wikipedia.org/wiki/Zeroisation
+[`Zeroize` trait]: https://docs.rs/zeroize/latest/zeroize/trait.Zeroize.html
+[Documentation]: https://docs.rs/zeroize/
+[Zeroing memory securely is hard]: http://www.daemonology.net/blog/2014-09-04-how-to-zero-a-buffer.html
+[psm::on_stack]: https://docs.rs/psm/latest/psm/fn.on_stack.html
+[good cryptographic hygiene]: https://github.com/veorq/cryptocoding#clean-memory-of-secret-data

zeroize_stack/TODO.md

@@ -0,0 +1,47 @@
+# TODO:
+
+## Likely impossible and/or unsafe
+
+* Add support for async closures, possibly using a macro to define the functions if necessary. Use `futures::executor::block_on(f())` to poll the entire future completion inside the stack switched context, and avoid `.await` that yields control outside of the `on_stack()` boundary. Something like:
+
+```rust
+pub unsafe fn exec_async_on_sanitized_stack<Fut, F, R>(
+ stack: &mut [u8],
+ f: F,
+) -> Result<R, Box<dyn std::any::Any + Send>>
+where
+ F: FnOnce() -> Fut + UnwindSafe,
+ Fut: Future<Output = R>,
+{
+ let mut result = None;
+
+ on_stack(stack, || {
+ result = Some(catch_unwind(AssertUnwindSafe(|| {
+ // Block on the future inside the heap stack
+ futures::executor::block_on(f())
+ })));
+ });
+
+ result.expect("Closure did not run")
+}
+```
+
+Copilot provided that code, but Gemini says that after the future is awaited, there will be no way for the program to know which stack to return to. Also, there is an open issue regarding async closures in `stacker` that has not been resolved after 7 months. https://github.com/rust-lang/stacker/issues/111
+
+## Safe
+
+* Handle unwinds better: currently we return a `Result<R, Box<dyn Any + Send>>`. The error case is a little bit tricky to handle, as dropping the error could cause a panic. The program should either panic, or return the panic payload's message.
+
+* Either:
+ * Panic when the OS is `hermit` or it is running on `wasm32` or `wasm64`, as their stacks don't behave the same as all of the others.
+ * Run the closure without `psm::on_stack` and generate a compiler warning stating that the target's stack layout is not supported with basic stack switching.
+ * Implement different types of `AlignedHeapStack` to cover `wasm32` and `hermit` as performed in the `stacker` crate.
+
+## Would require a PR to `stacker` to zero the allocated stack on drop
+
+* Use stacker crate to handle stack size management: if I read some of the `stacker` docs correctly, that crate should be able to extend the size of the stack when it is about to overflow. If that is correct, we could use their techniques to allocate a new stack and zeroize the old one whenever our allocated stack is about to overflow, eliminating the primary remaining `# Safety` comment. Note: we may not be able to zeroize the old stack immediately as the stack switching process likely attempts to return to the old stack once execution completes; we might have to wait until execution completes before zeroizing all heap-stacks.
+
+## Requires `asm!`
+
+* Add an `asm!` alternative method for stack bleaching. In theory, it would be better to use `asm!` as we would not need to worry about the size of the allocated switched stack, and it would keep all of the code running on the actual stack and not the heap, possibly preserving performance. The problem with this is that using pointers from `asm!` and rust code to zero the space between the pointers results in segmentation faults on `x86_64`.
+ * when testing this, assert that the two pointers are not equal to each other and not null.

zeroize_stack/src/heap/alloc.rs

@@ -0,0 +1,77 @@
+//! This file contains code derived from the Rust project,
+//! originally written by Alex Crichton and licensed under
+//! the Apache License, Version 2.0 or the MIT license, at
+//! your option.
+//!
+//! Copyright (c) 2014 Alex Crichton
+//!
+//! Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
+//! http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
+//! <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
+//! option. This file may not be copied, modified, or distributed
+//! except according to those terms.
+
+use core::{ptr, sync::atomic};
+
+extern crate std;
+
+/// A zeroizing heap-based stack. Feed one of these into the `switch_stacks` 
+/// function.
+pub struct ZeroizingHeapStack {
+ new_stack: *mut u8,
+ stack_bytes: usize,
+}
+
+const ALIGNMENT: usize = 32;
+
+impl ZeroizingHeapStack {
+ /// Initializes a new "Zeroizing Heap Stack". To be fed into the `switch_stacks` 
+ /// function, and it can be reused, but it must not be reused while it is in use.
+ /// The borrow-checker should enforce this.
+ pub fn new(stack_kb: usize) -> ZeroizingHeapStack {
+ let stack_bytes = stack_kb * 1024;
+ assert!(
+ stack_bytes as isize > 0,
+ "stack_kb must be positive and must not overflow isize when expanded to number of bytes instead of KB"
+ );
+ // On these platforms we do not use stack guards. this is very unfortunate,
+ // but there is not much we can do about it without OS support.
+ // We simply allocate the requested size from the global allocator with a suitable
+ // alignment.
+ let stack_bytes = stack_bytes
+ .checked_add(ALIGNMENT - 1)
+ .expect("unreasonably large stack requested")
+ / ALIGNMENT
+ * ALIGNMENT;
+ let layout = std::alloc::Layout::from_size_align(stack_bytes, ALIGNMENT).unwrap();
+ let ptr = unsafe { std::alloc::alloc(layout) };
+ assert!(!ptr.is_null(), "unable to allocate stack");
+ ZeroizingHeapStack {
+ new_stack: ptr,
+ stack_bytes,
+ }
+ }
+ /// Returns (`start ptr of usable stack`, `size of usable stack`).
+ pub fn stack_area(&self) -> (*mut u8, usize) {
+ (self.new_stack, self.stack_bytes)
+ }
+}
+
+impl Drop for ZeroizingHeapStack {
+ fn drop(&mut self) {
+ let mut ptr = self.new_stack as *mut u128;
+ for _ in 0..self.stack_bytes / size_of::<u128>() {
+ unsafe {
+ ptr::write_volatile(ptr, 0);
+ ptr = ptr.add(1);
+ }
+ }
+ atomic::compiler_fence(atomic::Ordering::SeqCst);
+ unsafe {
+ std::alloc::dealloc(
+ self.new_stack,
+ std::alloc::Layout::from_size_align_unchecked(self.stack_bytes, ALIGNMENT),
+ );
+ }
+ }
+}