On the usefulness of linear types for correct nonce use enforcement during compile time

05/06/2023
by   Richard Ostertág, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/08/2021

Bionic Optical Physical Unclonable Functions for Authentication and Encryption

Information security is of great importance for modern society with all ...
research
04/07/2023

Parameterized Algebraic Protocols

We propose algebraic protocols that enable the definition of protocol te...
research
11/23/2021

Deconfined Global Types for Asynchronous Sessions

Multiparty sessions with asynchronous communications and global types pl...
research
04/15/2020

Hardening X.509 Certificate Issuance using Distributed Ledger Technology

The security of cryptographic communication protocols that use X.509 cer...
research
05/26/2023

Complete Multiparty Session Type Projection with Automata

Multiparty session types (MSTs) are a type-based approach to verifying c...
research
07/10/2020

Zur Benutzbarkeit und Verwendung von API-Dokumentationen

A good documentation is essential for a good usability of (security) API...
research
12/24/2019

Smooth Operator – The Use of Smooth Integers in Fast Generation of RSA Keys

Primality generation is the cornerstone of several essential cryptograph...

Please sign up or login with your details

Forgot password? Click here to reset