KEM combiners
F Giacon, F Heuer, B Poettering - … Conference on Practice and Theory of …, 2018 - Springer
Key-encapsulation mechanisms (KEMs) are a common step** stone for constructing
public-key encryption. Secure KEMs can be built from diverse assumptions, including ones …
public-key encryption. Secure KEMs can be built from diverse assumptions, including ones …
Secure obfuscation in a weak multilinear map model
All known candidate indistinguishability obfuscation (iO) schemes rely on candidate
multilinear maps. Until recently, the strongest proofs of security available for iO candidates …
multilinear maps. Until recently, the strongest proofs of security available for iO candidates …
Multi-key fully-homomorphic encryption in the plain model
The notion of multi-key fully homomorphic encryption (multi-key FHE)[López-Alt, Tromer,
Vaikuntanathan, STOC'12] was proposed as a generalization of fully homomorphic …
Vaikuntanathan, STOC'12] was proposed as a generalization of fully homomorphic …
White-box vs. black-box complexity of search problems: Ramsey and graph property testing
Ramsey theory assures us that in any graph there is a clique or independent set of a certain
size, roughly logarithmic in the graph size. But how difficult is it to find the clique or …
size, roughly logarithmic in the graph size. But how difficult is it to find the clique or …
[HTML][HTML] When cryptography stops data science: strategies for resolving the conflicts between data scientists and cryptographers
The advent of the digital era and computer-based remote communications has significantly
enhanced the applicability of various sciences over the past two decades, notably data …
enhanced the applicability of various sciences over the past two decades, notably data …
Non-interactive multiparty computation without correlated randomness
We study the problem of non-interactive multiparty computation (NI-MPC) where a group of
completely asynchronous parties can evaluate a function over their joint inputs by sending a …
completely asynchronous parties can evaluate a function over their joint inputs by sending a …
From minicrypt to obfustopia via private-key functional encryption
Private-key functional encryption enables fine-grained access to symmetrically encrypted
data. Although private-key functional encryption (supporting an unbounded number of keys …
data. Although private-key functional encryption (supporting an unbounded number of keys …
Cryptanalysis of indistinguishability obfuscations of circuits over GGH13
Annihilation attacks, introduced in the work of Miles, Sahai, and Zhandry (CRYPTO 2016),
are a class of polynomial-time attacks against several candidate indistinguishability …
are a class of polynomial-time attacks against several candidate indistinguishability …
Robust combiners and universal constructions for quantum cryptography
A robust combiner combines many candidates for a cryptographic primitive and generates a
new candidate for the same primitive. Its correctness and security hold as long as one of the …
new candidate for the same primitive. Its correctness and security hold as long as one of the …
Threshold fully homomorphic encryption
We formally define and give the first construction of (leveled) threshold fully homomorphic
encryption for any access structure induced by a monotone boolean formula and in …
encryption for any access structure induced by a monotone boolean formula and in …