2000 character limit reached
On the usefulness of linear types for correct nonce use enforcement during compile time (2305.04138v1)
Published 6 May 2023 in cs.CR and cs.SE
Abstract: Cryptographic algorithms and protocols often need unique random numbers as parameters (e.g. nonces). Failure to satisfy this requirement lead to vulnerable implementation and can result in security breach. We show how linear types and static type checking can be used to enforce the correct generation of a new unique random number for each function invocation.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.