Boolean functions for cryptography and coding theory

C Carlet - 2021 - books.google.com
Boolean functions are essential to systems for secure and reliable communication. This
comprehensive survey of Boolean functions for cryptography and coding covers the whole …

DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead

B Falk, D Noble, R Ostrovsky, M Shtepel… - Theory of Cryptography …, 2023 - Springer
Abstract Distributed Oblivious Random Access Memory (DORAM) is a secure multiparty
protocol that allows a group of participants holding a secret-shared array to read and write to …

[HTML][HTML] Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families

MB Paterson, DR Stinson - Discrete Mathematics, 2016 - Elsevier
This paper provides a mathematical analysis of optimal algebraic manipulation detection
(AMD) codes. We prove several lower bounds on the success probability of an adversary …

Bulwark: Securing implantable medical devices communication channels

L Bu, MG Karpovsky, MA Kinsy - Computers & Security, 2019 - Elsevier
Implantable medical devices (IMDs) have been used to manage a broad range of diseases
and ailments. They are convenient for patients due to their small sizes, unobtrusiveness and …

Unconditionally secure non-malleable secret sharing and circular external difference families

S Veitch, DR Stinson - Designs, Codes and Cryptography, 2024 - Springer
Various notions of non-malleable secret sharing schemes have been considered. In this
paper, we review the existing work on non-malleable secret sharing and suggest a novel …

Pauli manipulation detection codes and applications to quantum communication over adversarial channels

T Bergamaschi - Annual International Conference on the Theory and …, 2024 - Springer
We introduce and explicitly construct a quantum error-detection code we coin a “Pauli
Manipulation Detection” code (or PMD), which detects every Pauli error with high probability …

Construction and nonexistence of strong external difference families

J Jedwab, S Li - Journal of Algebraic Combinatorics, 2019 - Springer
Strong external difference families (SEDFs) were introduced by Paterson and Stinson as a
more restrictive version of external difference families. SEDFs can be used to produce …

[HTML][HTML] Existence and non-existence results for strong external difference families

S Huczynska, MB Paterson - Discrete Mathematics, 2018 - Elsevier
We consider strong external difference families (SEDFs); these are external difference
families satisfying additional conditions on the patterns of external differences that occur …

Optimal algebraic manipulation detection codes in the constant-error model

R Cramer, C Padró, C Xing - Theory of Cryptography: 12th Theory of …, 2015 - Springer
Algebraic manipulation detection (AMD) codes, introduced at EUROCRYPT 2008, may, in
some sense, be viewed as keyless combinatorial authentication codes that provide security …

Some nonexistence results for strong external difference families using character theory

WJ Martin, DR Stinson - arXiv preprint arXiv:1610.06432, 2016 - arxiv.org
In this paper, we study the existence of $(v, m, k,\lambda) $-strong external difference
families (SEDFs). We use character-theoretic techniques to show that no SEDF exists when …