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 …
comprehensive survey of Boolean functions for cryptography and coding covers the whole …
Lightweight techniques for private heavy hitters
This paper presents a new protocol for solving the private heavy-hitters problem. In this
problem, there are many clients and a small set of data-collection servers. Each client holds …
problem, there are many clients and a small set of data-collection servers. Each client holds …
Information-theoretically secret key generation for fading wireless channels
The multipath-rich wireless environment associated with typical wireless usage scenarios is
characterized by a fading channel response that is time-varying, location-sensitive, and …
characterized by a fading channel response that is time-varying, location-sensitive, and …
Authenticated private information retrieval
This paper introduces protocols for authenticated private information retrieval. These
schemes enable a client to fetch a record from a remote database server such that (a) the …
schemes enable a client to fetch a record from a remote database server such that (a) the …
Non-malleable codes
We introduce the notion of “non-malleable codes” which relaxes the notion of error
correction and error detection. Informally, a code is non-malleable if the message contained …
correction and error detection. Informally, a code is non-malleable if the message contained …
Reusable fuzzy extractors for low-entropy distributions
Fuzzy extractors (Dodis et al., in Advances in cryptology—EUROCRYPT 2014, Springer,
Berlin, 2014, pp 93–110) convert repeated noisy readings of a secret into the same …
Berlin, 2014, pp 93–110) convert repeated noisy readings of a secret into the same …
Non-malleable codes from additive combinatorics
Non-malleable codes provide a useful and meaningful security guarantee in situations
where traditional errorcorrection (and even error-detection) is impossible; for example, when …
where traditional errorcorrection (and even error-detection) is impossible; for example, when …
Robust fuzzy extractors and authenticated key agreement from close secrets
Consider two parties holding correlated random variables W and W′, respectively, that are
within distance t of each other in some metric space. These parties wish to agree on a …
within distance t of each other in some metric space. These parties wish to agree on a …
Algebraic manipulation detection codes
Algebraic manipulation detection codes are a cryptographic primitive that was introduced by
Cramer et al.(Eurocrypt 2008). It encompasses several methods that were previously used in …
Cramer et al.(Eurocrypt 2008). It encompasses several methods that were previously used in …
Non-malleable secret sharing
V Goyal, A Kumar - Proceedings of the 50th Annual ACM SIGACT …, 2018 - dl.acm.org
A number of works have focused on the setting where an adversary tampers with the shares
of a secret sharing scheme. This includes literature on verifiable secret sharing, algebraic …
of a secret sharing scheme. This includes literature on verifiable secret sharing, algebraic …